Abstract is missing.
- Unifying ModelsBernhard Steffen. 1-20
- Predecessor Queries in Dynamic Integer SetsGerth Stølting Brodal. 21-32
- Semi-Dynamic Shortest Paths and Breadth-First Search in DigraphsPaolo Giulio Franciosa, Daniele Frigioni, Roberto Giaccio. 33-46
- Greibach Normal Form Transformation, RevisitedRobert Koch, Norbert Blum. 47-54
- Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite AutomataJuraj Hromkovic, Sebastian Seibert, Thomas Wilke. 55-66
- Memory Management for Union-Find AlgorithmsChristophe Fiorio, Jens Gustedt. 67-79
- Fast Online Multiplication of Real NumbersMatthias Schröder. 81-92
- The Operators min and max on the Polynomial HierarchyHarald Hempel, Gerd Wechsung. 93-104
- Resource-Bounded Kolmogorov Complexity RevisitedHarry Buhrman, Lance Fortnow. 105-116
- Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time ComputationsPavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger. 117-128
- Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity ClassesMaciej Liskiewicz. 129-140
- MOD::p::-tests, Almost Independence and Small Probability Spaces (Extended Abstract)Claudia Bertram-Kretzberg, Hanno Lefmann. 141-152
- Hybrid Diagrams: A Deductive-Algorithmic Approach to Hybrid System VerificationLuca de Alfaro, Arjun Kapur, Zohar Manna. 153-164
- Temporal Logics for the Specification of Performance and ReliabilityLuca de Alfaro. 165-176
- Efficient Scaling-Invariant Checking of Timed BisimulationCarsten Weise, Dirk Lenzkes. 177-188
- Gossiping and Broadcasting versus Computing Functions in NetworksMartin Dietzfelbinger. 189-200
- On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision DiagramsStephan Waack. 201-212
- A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision DiagramsChristoph Meinel, Anna Slobodová. 213-224
- On the Classification of Computable LanguagesJohn Case, Efim B. Kinber, Arun Sharma, Frank Stephan. 225-236
- A Conditional-Logical Approach to Minimum Cross-EntropyGabriele Kern-Isberner. 237-248
- Undecidability Results on Two-Variable LogicsErich Grädel, Martin Otto, Eric Rosen. 249-260
- Methods and Applications of (MAX, +) Linear AlgebraStephane Gaubert, Max Plus. 261-282
- Regular Expressions and Context-Free Grammars for Picture LanguagesOliver Matz. 283-294
- Measuring Nondeterminism in Pushdown AutomataJonathan Goldstine, Hing Leung, Detlef Wotschke. 295-306
- On Polynomially D-Verbose SetsArfst Nickelsen. 307-318
- A Downward Translation in the Polynomial HierarchyEdith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel. 319-328
- Strict Sequential P-completenessKlaus Reinhardt. 329-338
- An Unambiguous Class Possessing a Complete SetKlaus-Jörn Lange. 339-350
- Deadlock-Free Interval Routing SchemesMichele Flammini. 351-362
- Power Consumption in Packet Radio Networks (Extended Abstract)Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc. 363-374
- The Complexity of Generating Test InstancesChristoph Karg, Johannes Köbler, Rainer Schuler. 375-386
- Efficient Construction of Hitting Sets for Systems of Linear FunctionsAlexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim. 387-398
- Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended Abstract)Ingrid Biehl, Bernd Meyer. 399-412
- Minimal Transition Systems for History-Preserving BisimulationUgo Montanari, Marco Pistore. 413-425
- On Ergodic Linear Cellular Automata over Z::m::Gianpiero Cattaneo, Enrico Formenti, Giovanni Manzini, Luciano Margara. 427-438
- Intrinsic Universality of a 1-Dimensional Reversible Cellular AutomatonJérôme Olivier Durand-Lose. 439-450
- The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract)Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit. 451-462
- Algebraic and Logical Characterizations of Deterministic Linear Time ClassesThomas Schwentick. 463-474
- Finding the k Shortest Paths in ParallelEric Ruppert. 475-486
- Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal GraphsElias Dahlhaus. 487-498
- Distance Approximating Spanning TreesErich Prisner. 499-510
- A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract)Rainer Feldmann, Burkhard Monien, Peter Mysliwietz, Stefan Tschöke. 511-522
- An Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract)Joan Feigenbaum, Martin Strauss. 523-534
- Equivalence of Measures of Complexity ClassesJosef M. Breutzmann, Jack H. Lutz. 535-545
- Better Algorithms for Minimum Weight Vertex-Connectivity ProblemsVincenzo Auletta, Domenico Parente. 547-558
- RNC-Approximation Algorithms for the Steiner ProblemHans Jürgen Prömel, Angelika Steger. 559-570
- Pattern Matching in Trace Monoids (Extended Abstract)Jochen Meßner. 571-582
- Removing epsilon-Transitions in Timed AutomataVolker Diekert, Paul Gastin, Antoine Petit. 583-594
- Probabilistic Proof Systems - A SurveyOded Goldreich. 595-611