Abstract is missing.
- Codes and GraphsMohammad Amin Shokrollahi. 1-12 [doi]
- A Classification of Symbolic Transition SystemsThomas A. Henzinger, Rupak Majumdar. 13-34 [doi]
- Circuits versus Trees in Algebraic ComplexityPascal Koiran. 35-52 [doi]
- On the Many Faces of Block CodesKaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan. 53-64 [doi]
- A New Algorithm for MAX-2-SATEdward A. Hirsch. 65-73 [doi]
- Bias Invariance of Small Upper SpansJack H. Lutz, Martin Strauss. 74-86 [doi]
- The Complexity of Planarity TestingEric Allender, Meena Mahajan. 87-98 [doi]
- About Cube-Free MorphismsGwénaël Richomme, Francis Wlazinski. 99-109 [doi]
- Linear Cellular Automata with Multiple State VariablesJarkko Kari. 110-121 [doi]
- Two-Variable Word EquationsLucian Ilie, Wojciech Plandowski. 122-132 [doi]
- Average-Case Quantum Query ComplexityAndris Ambainis, Ronald de Wolf. 133-144 [doi]
- Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching ProgramsJuraj Hromkovic, Martin Sauerhoff. 145-156 [doi]
- The Boolean Hierarchy of NP-PartitionsSven Kosub, Klaus W. Wagner. 157-168 [doi]
- Binary Exponential Backoff Is Stable for High Arrival RatesHesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie. 169-180 [doi]
- The Data Broadcast Problem with PreemptionNicolas Schabanel. 181-192 [doi]
- An Approximate L:::p:::-Difference Algorithm for Massive Data StreamsJessica H. Fong, Martin Strauss. 193-204 [doi]
- Succinct Representations of Model Based Belief RevisionPaolo Penna. 205-216 [doi]
- Logics Capturing Local PropertiesLeonid Libkin. 217-229 [doi]
- The Complexity of Poor Man s LogicEdith Hemaspaandra. 230-242 [doi]
- Fast Integer Sorting in Linear SpaceYijie Han. 242-253 [doi]
- On the Performance of WEAK-HEAPSORTStefan Edelkamp, Ingo Wegener. 254-266 [doi]
- On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural NumbersLuca Aceto, Zoltán Ésik, Anna Ingólfsdóttir. 267-278 [doi]
- Real-Time Automata and the Kleene Algebra of Sets of Real NumbersCatalin Dima. 279-289 [doi]
- Small Progress Measures for Solving Parity GamesMarcin Jurdzinski. 290-301 [doi]
- Multi-linearity Self-Testing with Relative ErrorFrédéric Magniez. 302-313 [doi]
- Nondeterministic Instance Complexity and Hard-to-Prove TautologiesVikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán. 314-323 [doi]
- Hard Instances of Hard ProblemsJack H. Lutz, Vikram Mhetre, Sridhar Srinivasan. 324-333 [doi]
- Simulation and Bisimulation over One-Counter ProcessesPetr Jancar, Antonín Kucera, Faron Moller. 334-345 [doi]
- Decidability of Reachability Problems for Classes of Two Counters AutomataAlain Finkel, Grégoire Sutre. 346-357 [doi]
- Hereditary History Preserving Bisimilarity Is UndecidableMarcin Jurdzinski, Mogens Nielsen. 358-369 [doi]
- The Hardness of Approximating Spanner ProblemsMichael Elkin, David Peleg. 370-381 [doi]
- An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle InequalityHans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger. 382-394 [doi]
- lambda-Coloring of GraphsHans Leo Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen. 395-406 [doi]
- Optimal Proof Systems and Sparse SetsHarry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek. 407-418 [doi]
- Almost Complete SetsKlaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn. 419-430 [doi]
- Graph Isomorphism Is Low for ZPP(NP) and Other Lowness ResultsVikraman Arvind, Johannes Köbler. 431-442 [doi]
- An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical CommunicationsEvripidis Bampis, Rodolphe Giroudeau, Jean-Claude König. 443-454 [doi]
- Polynomial Time Approximation Schemes for the Multiprocessor Open and Flow Shop Scheduling ProblemKlaus Jansen, Maxim Sviridenko. 455-465 [doi]
- Controlled Conspiracy-2 SearchUlf Lorenz. 466-478 [doi]
- The Stability of Saturated Linear Dynamical Systems Is UndecidableVincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis. 479-490 [doi]
- Tilings: Recursivity and RegularityJulien Cervelle, Bruno Durand. 491-502 [doi]
- Listing All Potential Maximal Cliques of a GraphVincent Bouchitté, Ioan Todinca. 503-515 [doi]
- Distance Labeling Schemes for Well-Separated Graph ClassesMichal Katz, Nir A. Katz, David Peleg. 516-528 [doi]
- Pruning Graphs with Digital Search Trees. Application to Distance Hereditary GraphsJean-Marc Lanlignel, Olivier Raynaud, Eric Thierry. 529-541 [doi]
- Characterizing and Deciding MSO-Definability of Macro Tree TransductionsJoost Engelfriet, Sebastian Maneth. 542-554 [doi]
- Languages of Dot-Depth 3/2Christian Glaßer, Heinz Schmitz. 555-566 [doi]
- Random Generation and Approximate Counting of Ambiguously Described Combinatorial StructuresAlberto Bertoni, Massimiliano Goldwurm, Massimo Santini. 567-580 [doi]
- The CNN Problem and Other k-Server VariantsElias Koutsoupias, David Scot Taylor. 581-592 [doi]
- The Weighted 2-Server ProblemMarek Chrobak, Jiri Sgall. 593-604 [doi]
- On the Competitive Ratio of the Work Function Algorithm for the k-Server ProblemYair Bartal, Elias Koutsoupias. 605-613 [doi]
- Spectral Bounds on General Hard Core PredicatesMikael Goldmann, Alexander Russell. 614-625 [doi]
- Randomness in Visual CryptographyAnnalisa De Bonis, Alfredo De Santis. 626-638 [doi]
- Online Dial-a-Ride Problems: Minimizing the Completion TimeNorbert Ascheuer, Sven Oliver Krumke, Jörg Rambau. 639-650 [doi]
- The Power Range Assignment Problem in Radio Networks on the PlaneAndrea E. F. Clementi, Paolo Penna, Riccardo Silvestri. 651-660 [doi]