STACS A

58 papers

YearTitle / Authors
2006A Faster Algorithm for the Steiner Tree Problem.
Daniel Mölle, Stefan Richter, Peter Rossmanith
2006Amortized Rigidness in Dynamic Cartesian Trees.
Iwona Bialynicka-Birula, Roberto Grossi
2006Combining Multiple Heuristics.
Tzur Sayag, Shai Fine, Yishay Mansour
2006Complete Codes in a Sofic Shift.
Marie-Pierre Béal, Dominique Perrin
2006Conflict-Free Colorings of Rectangles Ranges.
Khaled M. Elbassioni, Nabil H. Mustafa
2006Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two.
Alexander Healy, Emanuele Viola
2006Convergence and Approximation in Potential Games.
George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
2006Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements.
Reuven Cohen, David Peleg
2006DAG-Width and Parity Games.
Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer
2006Datalog and Constraint Satisfaction with Infinite Templates.
Manuel Bodirsky, Víctor Dalmau
2006Definability of Languages by Generalized First-Order Formulas over (N, +).
Amitabha Roy, Howard Straubing
2006Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.
Ahmed A. Belal, Amr Elmasry
2006Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games.
Kousha Etessami, Mihalis Yannakakis
2006Energy-Efficient Algorithms for Flow Time Minimization.
Susanne Albers, Hiroshi Fujiwara
2006Entanglement in Interactive Proof Systems with Binary Answers.
Stephanie Wehner
2006Equivalence of F-Algebras and Cubic Forms.
Manindra Agrawal, Nitin Saxena
2006Estimating Entropy and Entropy Norm on Data Streams.
Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan
2006Evaluating Monotone Circuits on Cylinders, Planes and Tori.
Nutan Limaye, Meena Mahajan, Jayalal Sarma
2006Exact Price of Anarchy for Polynomial Congestion Games.
Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann
2006External String Sorting: Faster and Cache-Oblivious.
Rolf Fagerberg, Anna Pagh, Rasmus Pagh
2006Fast FPT-Algorithms for Cleaning Grids.
Josep Díaz, Dimitrios M. Thilikos
2006Flat Holonomies on Automata Networks.
Gene Itkis, Leonid A. Levin
2006Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences.
Andrey Yu. Rumyantsev, M. A. Ushakov
2006Generalized Modal Satisfiability.
Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
2006Generating Randomized Roundings with Cardinality Constraints and Derandomizations.
Benjamin Doerr
2006Grid Vertex-Unfolding Orthogonal Polyhedra.
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
2006Interprocedurally Analyzing Polynomial Identities.
Markus Müller-Olm, Michael Petter, Helmut Seidl
2006Invariants of Automatic Presentations and Semi-synchronous Transductions.
Vince Bárány
2006Kolmogorov Complexity and the Recursion Theorem.
Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
2006Kolmogorov Complexity with Error.
Lance Fortnow, Troy Lee, Nikolai K. Vereshchagin
2006Linear Advice for Randomized Logarithmic Space.
Lance Fortnow, Adam R. Klivans
2006Markov Decision Processes with Multiple Objectives.
Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger
2006Memoryless Facility Location in One Pass.
Dimitris Fotakis
2006Nested Pebbles and Transitive Closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
2006Oblivious Symmetric Alternation.
Venkatesan T. Chakaravarthy, Sambuddha Roy
2006On Critical Exponents in Fixed Points of Binary
Dalia Krieger
2006On Hypergraph and Graph Isomorphism with Bounded Color Classes.
Vikraman Arvind, Johannes Köbler
2006On the Accepting Power of 2-Tape Büchi Automata.
Olivier Finkel
2006On the Complexity of the "Most General" Firing Squad Synchronization Problem.
Darin Goldstein, Kojiro Kobayashi
2006Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets.
John M. Hitchcock
2006Online Sorting Buffers on Line.
Rohit Khandekar, Vinayaka Pandit
2006Optimal Node Routing.
Yossi Azar, Yoel Chaiutin
2006Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
Daniel Golovin, Vineet Goyal, R. Ravi
2006Quantum Algorithms for Matching and Network Flows.
Andris Ambainis, Robert Spalek
2006Redundancy in Complete Sets.
Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang
2006Regular Expressions and NFAs Without
Georg Schnitger
2006Regularity Problems for Visibly Pushdown Languages.
Vince Bárány, Christof Löding, Olivier Serre
2006Reliable Computations Based on Locally Decodable Codes.
Andrei Romashchenko
2006STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings
Bruno Durand, Wolfgang Thomas
2006Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds.
Harry Buhrman, Leen Torenvliet, Falk Unger
2006Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games.
Krishnendu Chatterjee, Thomas A. Henzinger
2006The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms.
Paolo Penna, Carmine Ventre
2006The Number of Runs in a String: Improved Analysis of the Linear Upper Bound.
Wojciech Rytter
2006The Ubiquitous Digital Tree.
Philippe Flajolet
2006Theory and Application of Width Bounded Geometric Separator.
Bin Fu
2006Tradeoffs in Depth-Two Superconcentrators.
Chinmoy Dutta, Jaikumar Radhakrishnan
2006Weighted Asynchronous Cellular Automata.
Dietrich Kuske
2006Weighted Picture Automata and Weighted Logics.
Ina Mäurer