
Conferences in DBLP
 Mohammad Amin Shokrollahi
Codes and Graphs. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:112 [Conf]
 Thomas A. Henzinger, Rupak Majumdar
A Classification of Symbolic Transition Systems. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:1334 [Conf]
 Pascal Koiran
Circuits versus Trees in Algebraic Complexity. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:3552 [Conf]
 Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan
On the Many Faces of Block Codes. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:5364 [Conf]
 Edward A. Hirsch
A New Algorithm for MAX2SAT. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:6573 [Conf]
 Jack H. Lutz, Martin Strauss
Bias Invariance of Small Upper Spans. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:7486 [Conf]
 Eric Allender, Meena Mahajan
The Complexity of Planarity Testing. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:8798 [Conf]
 Gwénaël Richomme, Francis Wlazinski
About CubeFree Morphisms. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:99109 [Conf]
 Jarkko Kari
Linear Cellular Automata with Multiple State Variables. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:110121 [Conf]
 Lucian Ilie, Wojciech Plandowski
TwoVariable Word Equations. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:122132 [Conf]
 Andris Ambainis, Ronald de Wolf
AverageCase Quantum Query Complexity. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:133144 [Conf]
 Juraj Hromkovic, Martin Sauerhoff
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:145156 [Conf]
 Sven Kosub, Klaus W. Wagner
The Boolean Hierarchy of NPPartitions. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:157168 [Conf]
 Hesham AlAmmal, Leslie Ann Goldberg, Philip D. MacKenzie
Binary Exponential Backoff Is Stable for High Arrival Rates. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:169180 [Conf]
 Nicolas Schabanel
The Data Broadcast Problem with Preemption. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:181192 [Conf]
 Jessica H. Fong, Martin Strauss
An Approximate L^{p}Difference Algorithm for Massive Data Streams. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:193204 [Conf]
 Paolo Penna
Succinct Representations of Model Based Belief Revision. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:205216 [Conf]
 Leonid Libkin
Logics Capturing Local Properties. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:217229 [Conf]
 Edith Hemaspaandra
The Complexity of Poor Man's Logic. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:230242 [Conf]
 Yijie Han
Fast Integer Sorting in Linear Space. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:242253 [Conf]
 Stefan Edelkamp, Ingo Wegener
On the Performance of WEAKHEAPSORT. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:254266 [Conf]
 Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
On the TwoVariable Fragment of the Equational Theory of the MaxSum Algebra of the Natural Numbers. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:267278 [Conf]
 Catalin Dima
RealTime Automata and the Kleene Algebra of Sets of Real Numbers. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:279289 [Conf]
 Marcin Jurdzinski
Small Progress Measures for Solving Parity Games. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:290301 [Conf]
 Frédéric Magniez
Multilinearity SelfTesting with Relative Error. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:302313 [Conf]
 Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
Nondeterministic Instance Complexity and HardtoProve Tautologies. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:314323 [Conf]
 Jack H. Lutz, Vikram Mhetre, Sridhar Srinivasan
Hard Instances of Hard Problems. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:324333 [Conf]
 Petr Jancar, Antonín Kucera, Faron Moller
Simulation and Bisimulation over OneCounter Processes. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:334345 [Conf]
 Alain Finkel, Grégoire Sutre
Decidability of Reachability Problems for Classes of Two Counters Automata. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:346357 [Conf]
 Marcin Jurdzinski, Mogens Nielsen
Hereditary History Preserving Bisimilarity Is Undecidable. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:358369 [Conf]
 Michael Elkin, David Peleg
The Hardness of Approximating Spanner Problems. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:370381 [Conf]
 HansJoachim 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. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:382394 [Conf]
 Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
lambdaColoring of Graphs. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:395406 [Conf]
 Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek
Optimal Proof Systems and Sparse Sets. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:407418 [Conf]
 Klaus AmbosSpies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
Almost Complete Sets. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:419430 [Conf]
 Vikraman Arvind, Johannes Köbler
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:431442 [Conf]
 Evripidis Bampis, Rodolphe Giroudeau, JeanClaude König
An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:443454 [Conf]
 Klaus Jansen, Maxim Sviridenko
Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling Problem. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:455465 [Conf]
 Ulf Lorenz
Controlled Conspiracy2 Search. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:466478 [Conf]
 Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis
The Stability of Saturated Linear Dynamical Systems Is Undecidable. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:479490 [Conf]
 Julien Cervelle, Bruno Durand
Tilings: Recursivity and Regularity. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:491502 [Conf]
 Vincent Bouchitté, Ioan Todinca
Listing All Potential Maximal Cliques of a Graph. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:503515 [Conf]
 Michal Katz, Nir A. Katz, David Peleg
Distance Labeling Schemes for WellSeparated Graph Classes. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:516528 [Conf]
 JeanMarc Lanlignel, Olivier Raynaud, Eric Thierry
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:529541 [Conf]
 Joost Engelfriet, Sebastian Maneth
Characterizing and Deciding MSODefinability of Macro Tree Transductions. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:542554 [Conf]
 Christian Glaßer, Heinz Schmitz
Languages of DotDepth 3/2. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:555566 [Conf]
 Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:567580 [Conf]
 Elias Koutsoupias, David Scot Taylor
The CNN Problem and Other kServer Variants. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:581592 [Conf]
 Marek Chrobak, Jiri Sgall
The Weighted 2Server Problem. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:593604 [Conf]
 Yair Bartal, Elias Koutsoupias
On the Competitive Ratio of the Work Function Algorithm for the kServer Problem. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:605613 [Conf]
 Mikael Goldmann, Alexander Russell
Spectral Bounds on General Hard Core Predicates. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:614625 [Conf]
 Annalisa De Bonis, Alfredo De Santis
Randomness in Visual Cryptography. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:626638 [Conf]
 Norbert Ascheuer, Sven Oliver Krumke, Jörg Rambau
Online DialaRide Problems: Minimizing the Completion Time. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:639650 [Conf]
 Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
The Power Range Assignment Problem in Radio Networks on the Plane. [Citation Graph (0, 0)][DBLP] STACS, 2000, pp:651660 [Conf]
