Abstract is missing.
- Circuit Complexity before the Dawn of the New MillenniumEric Allender. 1-18
- A Lambda Calculus with Letrecs and BarriersArvind, Jan-Willem Maessen, Rishiyur S. Nikhil, Joseph E. Stoy. 19-36
- TablesJ. Ian Munro. 37-42
- Mechanized Formal Methods: Progress and ProspectsJohn M. Rushby. 43-51
- The Parameter Space of the ::::d::::-step ConjectureJ. C. Lagarias, N. Prabhu, James A. Reeds. 52-63
- On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning TreesGautam Das, Sanjiv Kapoor, Michiel H. M. Smid. 64-75
- Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in Presence of ObstaclesPinaki Mitra, Subhas C. Nandy. 76-87
- Weak Bisimulation and Model Checking for Basic Parallel ProcessesRichard Mayr. 88-99
- Testing Processes for EfficiencyKamal Jain, S. Arun-Kumar. 100-110
- Regularity is Decidable for Normed PA Processes in Polynomial TimeAntonín Kucera. 111-122
- Dynamic Maintenance of Shortest Path Trees in Simple PolygonsSanjiv Kapoor, Tripurari Singh. 123-134
- Close Approximation of Minimum Rectangular CoveringsChristos Levcopoulos, Joachim Gudmundsson. 135-146
- A New Competitive Algorithm for Agent Searching in Unknown StreetsPallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar. 147-155
- On the Design of Hybrid Control Systems Using Automata ModelsDang Van Hung, Wang Ji. 156-167
- Constraint Reaction in FDPhilippe Codognet, Daniel Diaz, Francesca Rossi. 168-179
- Winskel is (Almost) Right: Towards a Mechanized Semantics TextbookTobias Nipkow. 180-192
- An Optimal Deterministic Algorithm for Online b-MatchingBala Kalyanasundaram, Kirk Pruhs. 193-199
- Tight Bounds for Prefetching and Buffer Management Algorithms for Parallel I/O SystemsPeter J. Varman, Rakesh M. Verma. 200-211
- Complexity of the Gravitational Method for Linear ProgrammingThomas L. Morin, Nagabhushana Prabhu, Z. Zhang. 212-223
- Optimal and Information Theoretic Syntactic Pattern Recognition Involving Traditional and Transposition ErrorsB. John Oommen, R. K. S. Loke. 224-237
- Minimal Relative Normalization in Orthogonal Expression Reduction SystemsJohn R. W. Glauert, Zurab Khasidashvili. 238-249
- Trace Consistency and InevitablityRamaswamy Ramanujam. 250-261
- Finite State Implementations of Knowledge-Based ProgramsRon van der Meyden. 262-273
- Higher-Order Proof by ConsistencyHenrik Linnestad, Christian Prehofer, Olav Lysne. 274-285
- Advocating OwnershipHenning Fernau, Klaus-Jörn Lange, Klaus Reinhardt. 286-297
- Non-cancellative Boolean Circuits: A Generalization of Monotone Boolean CircuitsRimli Sengupta, H. Venkateswaran. 298-309
- Limitations of the QRQW and EREW PRAM ModelsMiroslaw Kutylowski, Krzysztof Lorys. 310-321
- Pinpointing Computation with Modular Queries in the Boolean HierarchyManindra Agrawal, Richard Beigel, Thomas Thierauf. 322-334
- Characterization of the Principal Type of Normal Forms in an Intersection Type SystemEmilie Sayag, Michel Mauny. 335-346
- Correcting Errors in the Curry SystemMilind Gandhe, G. Venkatesh, Amitabha Sanyal. 347-358
- Immediate Fixpoints and Their Use in Groundness AnalysisHarald Søndergaard. 359-370
- Graph Types for Monadic Mobile ProcessesNobuko Yoshida. 371-386