Abstract is missing.
- System Specification and Refinement in Temporal LogicAmir Pnueli. 1-38
- Fixed Points of Büchi AutomataMads Dam. 39-50
- An Automata-Theoretic Decision Procedure for Future Interval LogicY. S. Ramakrishna, Laura K. Dillon, Louise E. Moser, P. M. Melliar-Smith, G. Kutty. 51-67
- Improving the Results of Static Analyses Programs by Local Decreasing IterationPhilippe Granger. 68-79
- Implicit Point Location in Arrangements of Line Segments, with an Application to Motion PlanningPankaj K. Agarwal, Marc J. van Kreveld. 80-91
- An Optimal Algorithm for the Intersection Radius of a Set of Convex PolygonsShreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya. 92-103
- C-sensitive Triangulations Approximate the MinMax Length TriangulationChristos Levcopoulos, Andrzej Lingas. 104-115
- Superpolynomial Circuits, Almost Sparse Oracles and the Exponential HierarchyHarry Buhrman, Steven Homer. 116-127
- Structural Average Case ComplexityRainer Schuler, Tomoyuki Yamakami. 128-139
- On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse SetsVikraman Arvind, Johannes Köbler, Martin Mundhenk. 140-151
- One-way Functions and Isomorphism ConjectureK. Ganesan. 152-163
- Solving the Lagrangian Dual when the Number of Constraints is FixedRicha Agarwala, David Fernández-Baca. 164-175
- Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic ApproachLaks V. S. Lakshmanan, Daniel A. Nonen. 176-190
- Proving Polynomials PositiveJoachim Steinbach. 191-202
- An Abstract Interpretation Scheme for Groundedness, Freeness, and Sharing Analysis of Logic ProgramsRenganathan Sundararajan, John S. Conery. 203-216
- Polymorphic Typing by Abstract InterpretationBruno Monsuez. 217-228
- The Gallina Specification language: A Case StudyGérard P. Huet. 229-240
- Verification of Large Software SystemsWolfgang Reif. 241-252
- Detection of Unstable Predicates in Distributed ProgramsVijay K. Garg, Brian Waldecker. 253-264
- Fast Sequential and Randomised Parallel Algorithms for Rigidity and approximate Min k-cutSachin B. Patkar, H. Narayanan. 265-278
- Approximation Through Local Optimality: Designing Networks with Small DegreeR. Ravi, Balaji Raghavachari, Philip N. Klein. 279-290
- Games and Full Completeness for Multiplicative Linear Logic (Extended Abstract)Samson Abramsky, Radha Jagadeesan. 291-301
- Real-Time Calculi and Expansion TheoremsJens Chr. Godskesen, Kim Guldstrand Larsen. 302-315
- Branching Bisimulation for Context-free ProcessesDidier Caucal. 316-327
- CCS, Location and Asynchronous Transition SystemsMadhavan Mukund, Mogens Nielsen. 328-341
- Reasonong about Safety and Liveness Properties for Probabilistic ProcessesLinda Christoff, Ivan Christoff. 342-355
- String Matching Under a General Matching RelationS. Muthukrishnan, H. Ramesh. 356-367
- On the Complexity of Certified Write All AlgorithmsCharles U. Martel, Ramesh Subramonian. 368-379
- Selection from Read-Only Memory and Sorting with Optimum Data MovementJ. Ian Munro, Venkatesh Raman. 380-391
- Some Observations on 2-way Probabilistic Finite AutomataBala Ravikumar. 392-403
- Recent Developments in Algorithms for the Maximum-Flow Problem (Abstract)Kurt Mehlhorn. 404