Abstract is missing.
- Scheduling Parallel Communication: The h-relation ProblemMicah Adler, John W. Byers, Richard M. Karp. 1-20
- Decomposable Structures, Boolean Function Representations, and OptimizationStefan Arnborg. 21-36
- The Complexity of Interval Routing on Random GraphsMichele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela. 37-49
- Bridging Across the log(n) Space FrontierViliam Geffert. 50-65
- Second Order Logic and the Weak Exponential HierarchiesGeorg Gottlob, Nicola Leone, Helmut Veith. 66-81
- On the Computing Paradigm and Computational ComplexityJuris Hartmanis. 82-92
- Ranked Structures in Nonmonotonic Reasoning and Belief Revision: AbstractDaniel J. Lehmann. 93
- Symbolic Dynamics and Finite AutomataDominique Perrin. 94-104
- Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract)Alexander A. Razborov. 105
- Physics and the New ComputationPaul M. B. Vitányi. 106-128
- Measure on P: Robustness of the NotionEric Allender, Martin Strauss. 129-138
- Comparing Counting Classes for Logspace, One-way Logspace, and First-orderHans-Jörg Burtschick. 139-148
- Automata That Take AdviceCarsten Damm, Markus Holzer. 149-158
- Nonuniform Lower Bounds for Exponential Time ClassesSteven Homer, Sarah Mocas. 159-168
- On a Quantitative Notion of UniformitySusanne Kaufmann, Martin Kummer. 169-178
- Separations by Random Oracles and Almost Classes for Generalized ReducibilitiesWolfgang Merkle, Yongge Wang. 179-190
- On the Complexity of Finite Memory Policies for Markov Decision ProcessesDanièle Beauquier, Dima Burago, Anatol Slissenko. 191-200
- Derandomization for Sparse Approximations and Independent SetsThomas Hofmeister, Hanno Lefmann. 201-210
- Asymptotically Efficient In-Place MergingJyrki Katajainen, Tomi Pasanen, George Titan. 211-220
- The Complexity of the Falsifiability Problem for Pure Implicational FormulasPeter Heusch. 221-226
- Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization ProblemsViggo Kann. 227-236
- Some Typical Properties of Large AND/OR Boolean FormulasHanno Lefmann, Petr Savický. 237-246
- The Hedge: An Efficient Storage Device for Turing Machines with One Head (Extended Abstract)Martin Hühne. 247-256
- Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-CompleteOsamu Maruyama, Satoru Miyano. 257-266
- Honecomb NetworksIvan Stojmenovic. 267-276
- Witness-Isomorphic Reductions and the Local Search Problem (Extended Abstract)Sophie Fischer, Lane A. Hemaspaandra, Leen Torenvliet. 277-287
- Multiple Product Modulo Arbitrary NumbersClaudia Bertram-Kretzberg, Thomas Hofmeister. 288-298
- Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility ProblemsChristoph Meinel, Stephan Waack. 299-308
- Strong Optimal Lower Bounds for Turing Machines that Accept Nonregular LanguagesAlberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini. 309-318
- A Superpolynomial Lower Bound for (1, +k(n))-Branching ProgramsStanislav Zák. 319-325
- Deterministic Parsing for Augmented Context-free GrammarsLuca Breveglieri, Alessandra Cherubini, Stefano Crespi-Reghizzi. 326-336
- A Periodicity Theorem on Words and ApplicationsFilippo Mignosi, Antonio Restivo, Sergio Salemi. 337-348
- A New Approach to Analyse Coupled-Context-Free LanguagesGünter Hotz, Gisela Pitsch. 349-358
- Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)Miki Hermann, Phokion G. Kolaitis. 359-370
- Graph Reducibility of Term Rewriting SystemsM. R. K. Krishna Rao. 371-381
- Positive Recursive Type AssignmentPawel Urzyczyn. 382-391
- String Recognition on Anonymous RingsEvangelos Kranakis, Danny Krizanc, Flaminia L. Luccio. 392-401
- The Firing Squad Synchronization Problem on Cayley GraphsZsuzsanna Róka. 402-411
- Solving Cheap Graph Problems an MeshesJop F. Sibeyn, Michael Kaufmann. 412-422
- An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free ProcessesOlaf Burkart, Didier Caucal, Bernhard Steffen. 423-433
- On Congruences and Partial OrdersSerge Bauget, Paul Gastin. 434-443
- Performance Preorder: Ordering Processes with Respect to SpeedFlavio Corradini, Roberto Gorrieri, Marco Roccetti. 444-453
- Towards a Semantic Theory of CML (Extended Abstract)William Ferreira, Matthew Hennessy. 454-466
- Modular Constructions of Distributing AutomataSébastien Huguet, Antoine Petit. 467-478
- On the Proof Method for Bisimulation (Extended Abstract)Davide Sangiorgi. 479-488
- Towards a Calculus of Predicate TransformersClare E. Martin. 489-498
- An Abstract Account of CompositionMartín Abadi, Stephan Merz. 499-508
- Syntax and Semantics of ProcolRoel van der Goot, Arie de Bruin. 509-518
- Synthesizing Distinguishing Formulae for Real Time Systems (Extended Abstract)Jens Chr. Godskesen, Kim Guldstrand Larsen. 519-528
- From Timed Automata to Logic - and BackFrançois Laroussinie, Kim Guldstrand Larsen, Carsten Weise. 529-539
- Incremental Model Checking for Decomposable Structures (Extended Abstract)Johann A. Makowsky, Elena V. Ravve. 540-551
- Automata for the Modal mu-Calculus and related ResultsDavid Janin, Igor Walukiewicz. 552-562
- A v-Calculus with Local Views for Systems of Sequential AgentsPeter Niebert. 563-573
- An Operator Calculus Approach to the Evolution of Dynamic Data StructuresR. Feinsilver, René Schott. 574-586