STACS A

55 papers

YearTitle / Authors
2000A Classification of Symbolic Transition Systems.
Thomas A. Henzinger, Rupak Majumdar
2000A New Algorithm for MAX-2-SAT.
Edward A. Hirsch
2000About Cube-Free Morphisms.
Gwénaël Richomme, Francis Wlazinski
2000Almost Complete Sets.
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
2000An Approximate L
Jessica H. Fong, Martin Strauss
2000An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
2000An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000Average-Case Quantum Query Complexity.
Andris Ambainis, Ronald de Wolf
2000Bias Invariance of Small Upper Spans.
Jack H. Lutz, Martin Strauss
2000Binary Exponential Backoff Is Stable for High Arrival Rates.
Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
2000Characterizing and Deciding MSO-Definability of Macro Tree Transductions.
Joost Engelfriet, Sebastian Maneth
2000Circuits versus Trees in Algebraic Complexity.
Pascal Koiran
2000Codes and Graphs.
Mohammad Amin Shokrollahi
2000Controlled Conspiracy-2 Search.
Ulf Lorenz
2000Decidability of Reachability Problems for Classes of Two Counters Automata.
Alain Finkel, Grégoire Sutre
2000Distance Labeling Schemes for Well-Separated Graph Classes.
Michal Katz, Nir A. Katz, David Peleg
2000Fast Integer Sorting in Linear Space.
Yijie Han
2000Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results.
Vikraman Arvind, Johannes Köbler
2000Hard Instances of Hard Problems.
Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
2000Hereditary History Preserving Bisimilarity Is Undecidable.
Marcin Jurdzinski, Mogens Nielsen
2000Languages of Dot-Depth 3/2.
Christian Glaßer, Heinz Schmitz
2000Linear Cellular Automata with Multiple State Variables.
Jarkko Kari
2000Listing All Potential Maximal Cliques of a Graph.
Vincent Bouchitté, Ioan Todinca
2000Logics Capturing Local Properties.
Leonid Libkin
2000Multi-linearity Self-Testing with Relative Error.
Frédéric Magniez
2000Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.
Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
2000On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.
Yair Bartal, Elias Koutsoupias
2000On the Many Faces of Block Codes.
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
2000On the Performance of WEAK-HEAPSORT.
Stefan Edelkamp, Ingo Wegener
2000On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
2000Online Dial-a-Ride Problems: Minimizing the Completion Time.
Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau
2000Optimal Proof Systems and Sparse Sets.
Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek
2000Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.
Klaus Jansen, Maxim Sviridenko
2000Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.
Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry
2000Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
2000Randomness in Visual Cryptography.
Annalisa De Bonis, Alfredo De Santis
2000Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.
Catalin Dima
2000STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings
Horst Reichel, Sophie Tison
2000Simulation and Bisimulation over One-Counter Processes.
Petr Jancar, Antonín Kucera, Faron Moller
2000Small Progress Measures for Solving Parity Games.
Marcin Jurdzinski
2000Spectral Bounds on General Hard Core Predicates.
Mikael Goldmann, Alexander Russell
2000Succinct Representations of Model Based Belief Revision.
Paolo Penna
2000The Boolean Hierarchy of NP-Partitions.
Sven Kosub, Klaus W. Wagner
2000The CNN Problem and Other k-Server Variants.
Elias Koutsoupias, David Scot Taylor
2000The Complexity of Planarity Testing.
Eric Allender, Meena Mahajan
2000The Complexity of Poor Man's Logic.
Edith Hemaspaandra
2000The Data Broadcast Problem with Preemption.
Nicolas Schabanel
2000The Hardness of Approximating Spanner Problems.
Michael Elkin, David Peleg
2000The Power Range Assignment Problem in Radio Networks on the Plane.
Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2000The Stability of Saturated Linear Dynamical Systems Is Undecidable.
Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
2000The Weighted 2-Server Problem.
Marek Chrobak, Jirí Sgall
2000Tilings: Recursivity and Regularity.
Julien Cervelle, Bruno Durand
2000Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.
Juraj Hromkovic, Martin Sauerhoff
2000Two-Variable Word Equations.
Lucian Ilie, Wojciech Plandowski
2000lambda-Coloring of Graphs.
Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen