17. STACS 2000:
Lille,
France
Horst Reichel, Sophie Tison (Eds.):
STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings.
Lecture Notes in Computer Science 1770 Springer 2000, ISBN 3-540-67141-2 BibTeX
@proceedings{DBLP:conf/stacs/2000,
editor = {Horst Reichel and
Sophie Tison},
title = {STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
booktitle = {STACS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1770},
year = {2000},
isbn = {3-540-67141-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Mohammad Amin Shokrollahi:
Codes and Graphs.
1-12
Electronic Edition (Springer LINK) BibTeX
- Thomas A. Henzinger, Rupak Majumdar:
A Classification of Symbolic Transition Systems.
13-34
Electronic Edition (Springer LINK) BibTeX
- Pascal Koiran:
Circuits versus Trees in Algebraic Complexity.
35-52
Electronic Edition (Springer LINK) BibTeX
- Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan:
On the Many Faces of Block Codes.
53-64
Electronic Edition (Springer LINK) BibTeX
- Edward A. Hirsch:
A New Algorithm for MAX-2-SAT.
65-73
Electronic Edition (Springer LINK) BibTeX
- Jack H. Lutz, Martin Strauss:
Bias Invariance of Small Upper Spans.
74-86
Electronic Edition (Springer LINK) BibTeX
- Eric Allender, Meena Mahajan:
The Complexity of Planarity Testing.
87-98
Electronic Edition (Springer LINK) BibTeX
- Gwénaël Richomme, Francis Wlazinski:
About Cube-Free Morphisms.
99-109
Electronic Edition (Springer LINK) BibTeX
- Jarkko Kari:
Linear Cellular Automata with Multiple State Variables.
110-121
Electronic Edition (Springer LINK) BibTeX
- Lucian Ilie, Wojciech Plandowski:
Two-Variable Word Equations.
122-132
Electronic Edition (Springer LINK) BibTeX
- Andris Ambainis, Ronald de Wolf:
Average-Case Quantum Query Complexity.
133-144
Electronic Edition (Springer LINK) BibTeX
- Juraj Hromkovic, Martin Sauerhoff:
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs.
145-156
Electronic Edition (Springer LINK) BibTeX
- Sven Kosub, Klaus W. Wagner:
The Boolean Hierarchy of NP-Partitions.
157-168
Electronic Edition (Springer LINK) BibTeX
- Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
Binary Exponential Backoff Is Stable for High Arrival Rates.
169-180
Electronic Edition (Springer LINK) BibTeX
- Nicolas Schabanel:
The Data Broadcast Problem with Preemption.
181-192
Electronic Edition (Springer LINK) BibTeX
- Jessica H. Fong, Martin Strauss:
An Approximate Lp-Difference Algorithm for Massive Data Streams.
193-204
Electronic Edition (Springer LINK) BibTeX
- Paolo Penna:
Succinct Representations of Model Based Belief Revision.
205-216
Electronic Edition (Springer LINK) BibTeX
- Leonid Libkin:
Logics Capturing Local Properties.
217-229
Electronic Edition (Springer LINK) BibTeX
- Edith Hemaspaandra:
The Complexity of Poor Man's Logic.
230-242
Electronic Edition (Springer LINK) BibTeX
- Yijie Han:
Fast Integer Sorting in Linear Space.
242-253
Electronic Edition (Springer LINK) BibTeX
- Stefan Edelkamp, Ingo Wegener:
On the Performance of WEAK-HEAPSORT.
254-266
Electronic Edition (Springer LINK) BibTeX
- Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir:
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.
267-278
Electronic Edition (Springer LINK) BibTeX
- Catalin Dima:
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers.
279-289
Electronic Edition (Springer LINK) BibTeX
- Marcin Jurdzinski:
Small Progress Measures for Solving Parity Games.
290-301
Electronic Edition (Springer LINK) BibTeX
- Frédéric Magniez:
Multi-linearity Self-Testing with Relative Error.
302-313
Electronic Edition (Springer LINK) BibTeX
- Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán:
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.
314-323
Electronic Edition (Springer LINK) BibTeX
- Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan:
Hard Instances of Hard Problems.
324-333
Electronic Edition (Springer LINK) BibTeX
- Petr Jancar, Antonín Kucera, Faron Moller:
Simulation and Bisimulation over One-Counter Processes.
334-345
Electronic Edition (Springer LINK) BibTeX
- Alain Finkel, Grégoire Sutre:
Decidability of Reachability Problems for Classes of Two Counters Automata.
346-357
Electronic Edition (Springer LINK) BibTeX
- Marcin Jurdzinski, Mogens Nielsen:
Hereditary History Preserving Bisimilarity Is Undecidable.
358-369
Electronic Edition (Springer LINK) BibTeX
- Michael Elkin, David Peleg:
The Hardness of Approximating Spanner Problems.
370-381
Electronic Edition (Springer LINK) BibTeX
- Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger:
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.
382-394
Electronic Edition (Springer LINK) BibTeX
- Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
lambda-Coloring of Graphs.
395-406
Electronic Edition (Springer LINK) BibTeX
- Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek:
Optimal Proof Systems and Sparse Sets.
407-418
Electronic Edition (Springer LINK) BibTeX
- Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn:
Almost Complete Sets.
419-430
Electronic Edition (Springer LINK) BibTeX
- Vikraman Arvind, Johannes Köbler:
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results.
431-442
Electronic Edition (Springer LINK) BibTeX
- Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König:
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications.
443-454
Electronic Edition (Springer LINK) BibTeX
- Klaus Jansen, Maxim Sviridenko:
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem.
455-465
Electronic Edition (Springer LINK) BibTeX
- Ulf Lorenz:
Controlled Conspiracy-2 Search.
466-478
Electronic Edition (Springer LINK) BibTeX
- Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable.
479-490
Electronic Edition (Springer LINK) BibTeX
- Julien Cervelle, Bruno Durand:
Tilings: Recursivity and Regularity.
491-502
Electronic Edition (Springer LINK) BibTeX
- Vincent Bouchitté, Ioan Todinca:
Listing All Potential Maximal Cliques of a Graph.
503-515
Electronic Edition (Springer LINK) BibTeX
- Michal Katz, Nir A. Katz, David Peleg:
Distance Labeling Schemes for Well-Separated Graph Classes.
516-528
Electronic Edition (Springer LINK) BibTeX
- Jean-Marc Lanlignel, Olivier Raynaud, Eric Thierry:
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs.
529-541
Electronic Edition (Springer LINK) BibTeX
- Joost Engelfriet, Sebastian Maneth:
Characterizing and Deciding MSO-Definability of Macro Tree Transductions.
542-554
Electronic Edition (Springer LINK) BibTeX
- Christian Glaßer, Heinz Schmitz:
Languages of Dot-Depth 3/2.
555-566
Electronic Edition (Springer LINK) BibTeX
- Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini:
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.
567-580
Electronic Edition (Springer LINK) BibTeX
- Elias Koutsoupias, David Scot Taylor:
The CNN Problem and Other k-Server Variants.
581-592
Electronic Edition (Springer LINK) BibTeX
- Marek Chrobak, Jiri Sgall:
The Weighted 2-Server Problem.
593-604
Electronic Edition (Springer LINK) BibTeX
- Yair Bartal, Elias Koutsoupias:
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem.
605-613
Electronic Edition (Springer LINK) BibTeX
- Mikael Goldmann, Alexander Russell:
Spectral Bounds on General Hard Core Predicates.
614-625
Electronic Edition (Springer LINK) BibTeX
- Annalisa De Bonis, Alfredo De Santis:
Randomness in Visual Cryptography.
626-638
Electronic Edition (Springer LINK) BibTeX
- Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau:
Online Dial-a-Ride Problems: Minimizing the Completion Time.
639-650
Electronic Edition (Springer LINK) BibTeX
- Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
The Power Range Assignment Problem in Radio Networks on the Plane.
651-660
Electronic Edition (Springer LINK) BibTeX
Copyright © Sat May 16 23:43:06 2009
by Michael Ley (ley@uni-trier.de)
