ISBN: 3-540-67141-2
TITLE: STACS 2000
AUTHOR: Reichel, Horst; Tison, Sophie (Eds.)
TOC:

Codes and Graphs 1
M. Amin Shokrollahi
A Classification of Symbolic Transition Systems 13
Thomas A. Henzinger, Rupak Majumdar
Circuits versus Trees in Algebraic Complexity 35
Pascal Koiran
On the Many Faces of Block Codes 53
Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
A New Algorithm for MAX-2-SAT 65
Edward A. Hirsch
Bias Invariance of Small Upper Spans 74
Jack H. Lutz, Martin J. Strauss
The Complexity of Planarity Testing 87
Eric Allender, Meena Mahajan
About Cube-Free Morphisms 99
Gwnal Richomme, Francis Wlazinski
Linear Cellular Automata with Multiple State Variables 110
Jarkko Kari
Two-Variable Word Equations 122
Lucian Ilie, Wojciech Plandowski
Average-Case Quantum Query Complexity 133
Andris Ambainis, Ronald de Wolf
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs 145
Juraj Hromkovic, Martin Sauerhoff
The Boolean Hierarchy of NP-Partitions 157
Sven Kosub, Klaus W. Wagner
Binary Exponential Backoff Is Stable for High Arrival Rates 169
Hesham Al-Ammal, Leslie Ann Goldberg, Phil MacKenzie
The Data Broadcast Problem with Preemption 181
Nicolas Schabanel
An Approximate L^p-Difference Algorithm for Massive Data Streams 193
Jessica H. Fong, Martin J. Strauss
Succinct Representations of Model Based Belief Revision 205
Paolo Penna
Logics Capturing Local Properties 217
Leonid Libkin
The Complexity of Poor Man's Logic 230
Edith Hemaspaandra
Fast Integer Sorting in Linear Space 242
Yijie Han
On the Performance of WEAK-HEAPSORT 254
Stefan Edelkamp, Ingo Wegener
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers 267
Luca Aceto, Zoltn sik, Anna Inglfsdttir
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers 279
Catalin Dima
Small Progress Measures for Solving Parity Games 290
Marcin Jurdzinski
Multi-linearity Self-Testing with Relative Error 302
Frdric Magniez
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies 314
Vikraman Arvind, Johannes Kbler, Martin Mundhenk, Jacobo Torn
Hard Instances of Hard Problems 324
Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
Simulation and Bisimulation over One-Counter Processes 334
Petr Jancar, Antonn Kucera, Faron Moller
Decidability of Reachability Problems for Classes of Two Counters Automata 346
Alain Finkel, Grgoire Sutre
Hereditary History Preserving Bisimilarity Is Undecidable 358
Marcin Jurdzinski, Mogens Nielsen
The Hardness of Approximating Spanner Problems 370
Michael Elkin, David Peleg
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality 382
Hans-Joachim Bckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
lambda-Coloring of Graphs 395
Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
Optimal Proof Systems and Sparse Sets 407
Harry Buhrman, Steve Fenner, Lance Fortnow, Dieter van Melkebeek
Almost Complete Sets 419
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results 431
Vikraman Arvind, Johannes Kbler
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications 443
Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude Knig
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem 455
Klaus Jansen, Maxim I. Sviridenko
Controlled Conspiracy-2 Search 466
Ulf Lorenz
The Stability of Saturated Linear Dynamical Systems Is Undecidable 479
Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
Tilings: Recursivity and Regularity 491
Julien Cervelle, Bruno Durand
Listing All Potential Maximal Cliques of a Graph 503
Vincent Bouchitt, Ioan Todinca
Distance Labeling Schemes for Well-Separated Graph Classes 516
Michal Katz, Nir A. Katz, David Peleg
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs 529
Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry
Characterizing and Deciding MSO-Definability of Macro Tree Transductions 542
Joost Engelfriet, Sebastian Maneth
Languages of DotDepth 3/2 555
Christian Glaer, Heinz Schmitz
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures 567
Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
The CNN Problem and Other k-Server Variants 581
Elias Koutsoupias, David Scot Taylor
The Weighted 2-Server Problem 593
Marek Chrobak, Jir Sgall
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem 605
Yair Bartal, Elias Koutsoupias
Spectral Bounds on General Hard Core Predicates 614
Mikael Goldmann, Alexander Russell
Randomness in Visual Cryptography 626
Annalisa De Bonis, Alfredo De Santis
Online Dial-a-Ride Problems: Minimizing the Completion Time 639
Norbert Ascheuer, Sven O. Krumke, Jrg Rambau
The Power Range Assignment Problem in Radio Networks on the Plane 651
Andrea E.F. Clementi, Paolo Penna, Riccardo Silvestri
Author Index 661
END
