| Complexity (Session 1) | |
| Philosophical Issues in Kolmogorov Complexity (Invited Lecture) | p. 1 |
| Circuit Complexity and the Expressive Power of Generalized First-Order Formulas | p. 16 |
| One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier | p. 28 |
| Formal Languages (Session 2) | |
| Abelian Squares Are Avoidable on 4 Letters | p. 41 |
| Polynomial Size Test Sets for Context-Free Languages | p. 53 |
| Quasi-Deterministic OL Systems | p. 65 |
| On Growing Context-Sensitive Languages | p. 77 |
| Finite Automata (Session 3) | |
| Numeration Systems, Linear Recurrences, and Regular Sets | p. 89 |
| The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable | p. 101 |
| Semi-Commutations and Rational Expressions | p. 113 |
| New Results Concerning Synchronized Finite Automata | p. 126 |
| Graph Grammars and Complexity (Session 4) | |
| A Greibach Normal Form for Context-Free Graph Grammars | p. 138 |
| On Reverse and General Definite Tree Languages | p. 150 |
| Reductions to Sets of Low Information Content | p. 162 |
| UP and the Low and High Hierarchies: A Relativized Separation | p. 174 |
| Algorithm Analysis (Session 5) | |
| Analytic Analysis of Algorithms (Invited Lecture) | p. 186 |
| How to Count Quickly and Accurately | p. 211 |
| The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects | p. 223 |
| Algorithms (Session 6) | |
| Polynomial Hash Functions Are Reliable | p. 235 |
| Adaptive Pattern Matching | p. 247 |
| Randomised Interpolation and Approximation of Sparse Polynomials | p. 261 |
| Two Strikes Against Perfect Phylogeny | p. 273 |
| Parallel Computation (Session 7) | |
| Disjunctive Systems and L-Domains | p. 284 |
| Optimal Parallel Algorithms for Periods, Palindromes and Squares | p. 296 |
| Near-Perfect Token Distribution | p. 308 |
| Fast Integer Merging on the EREW PRAM | p. 318 |
| Graph Algorithms (Session 8) | |
| Approximation Algorithms for Graph Augmentation | p. 330 |
| Fast Incremental Planarity Testing | p. 342 |
| Maintenance of Triconnected Components of Graphs | p. 354 |
| Suboptimal Cuts: Their Enumeration, Weight and Number | p. 366 |
| Symbolic Computation (Session 9) | |
| Grobner Bases: An Introduction (Invited Lecture) | p. 378 |
| Buchberger's Algorithm: The Term Rewriter's Point of View | p. 380 |
| Completion of Rewrite Systems with Membership Constraints | p. 392 |
| Geometric Algorithms (Session 10) | |
| A New Metric Between Polygons, and How to Compute it | p. 404 |
| On Nearest-Neighbor Graphs | p. 416 |
| A Tail Estimate for Mulmuley's Segment Intersection Algorithm | p. 427 |
| Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine | p. 439 |
| Logic and Models I (Session 11) | |
| Infinitary Logic for Computer Science (Invited Lecture) | p. 450 |
| Characterization of Temporal Property Classes | p. 474 |
| Lazy Lambda Calculus: Theories, Models and Local Structure Characterization | p. 487 |
| Logic and Models II (Session 12) | |
| Logic Programming Semantics Made Easy | p. 499 |
| On the Complexity of Dataflow Analysis of Logic Programs | p. 509 |
| Comparison of Abstract Interpretations | p. 521 |
| A Proposed Categorical Semantics for Pure ML | p. 533 |
| Time Specification (Session 13) | |
| What Good Are Digital Clocks? | p. 545 |
| Behavioural Abstraction in TCCS | p. 559 |
| Timing Petri Nets Categorically | p. 571 |
| Asynchronous Cellular Automata for Infinite Traces | p. 583 |
| Concurrency Semantics (Session 14) | |
| A Trace Semantics for Petri Nets | p. 595 |
| Asynchronous Communication of Petri Nets and the Refinement of Transitions | p. 605 |
| A Parametric Approach to Localities | p. 617 |
| Proved Trees | p. 629 |
| Program Development (Session 15) | |
| Interfaces Between Languages for Communicating Systems (Invited Lecture) | p. 641 |
| Toward Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations (Invited Lecture) | p. 656 |
| Process Equivalences (Session 16) | |
| Program Composition via Unification | p. 672 |
| Barbed Bisimulation | p. 685 |
| Checking Equivalences Between Concurrent Systems of Finite Agents | p. 696 |
| Testing Preorders for Probabilistic Processes | p. 708 |
| Author Index | p. 721 |
| Table of Contents provided by Blackwell. All Rights Reserved. |