Abstract is missing.
- Looking for MUM and DAD: Text-Text Comparisons Do HelpMike Paterson, Shlomit Tassa, Uri Zwick. 1-10
- Branch and Bound on the Network ModelSanjay Jain. 11-21
- A Near Optimal Algorithm for the Extended Cow-Path Problem in the Presence of Relative ErrorsPallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar. 22-36
- Efficient Algorithms for Vertex Arboricity of Planar GraphsAbhik Roychoudhury, Susmita Sur-Kolay. 37-51
- A Condition for the Three Colourability of Planar Locally Path GraphsAjit A. Diwan, N. Usharani. 52-61
- A Framework for the Specification of Reactive and Concurrent Systems in ZPeter Baumann, Karl Lermer. 62-79
- Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed SystemsJob Zwiers, Ulrich Hannemann, Yassine Lakhnech, Willem P. de Roever. 80-95
- Verifying Part of the ACCESS.bus Protocol Using PVSJozef Hooman. 96-110
- Reusing Batch Parsers as Incremental ParsersLuigi Petrone. 111-123
- The Expressive Power of Indeterminate Primitives in Asynchronous ComputationPrakash Panangaden. 124-150
- The Transformation CalculusJacques Garrigue. 151-165
- Equational Axiomatization of Bicoercibility for Polymorphic TypesJerzy Tiuryn. 166-179
- From Causal Consistency to Sequential Consistency in Shared Memory SystemsMichel Raynal, André Schiper. 180-194
- Observation of Software for Distributed Systems with RCLAlexander I. Tomlinson, Vijay K. Garg. 195-209
- Partiality and Approximation Schemes for Local Consistency in Networks of ConstraintsNick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos. 210-224
- Maximal Extensions os Simplification OrderingsDeepak Kapur, G. Sivakumar. 225-239
- Average Polynominal Time Is Hard for Exponential Time Under sn-ReductionsRainer Schuler. 240-247
- On Self-Testing without the Generator BottleneckRavi Kumar, D. Sivakumar. 248-262
- Obseving Behaviour CategoricallyMogens Nielsen, Allan Cheng. 263-278
- An Algorithm for Reducing Binary BranchingsPaul Caspi, Jean-Claude Fernandez, Alain Girault. 279-293
- On the Complexity of Bisimilarity for Value-Passing Processes (Extended Abstract)Michele Boreale, Luca Trevisan. 294-308
- On the Expressive Power of CCSAshvin Dsouza, Bard Bloom. 309-323
- Polarized Name PassingMartin Odersky. 324-337
- Path Balance Heuristic for Self-Adjusting Binary Search TreesR. Balasubramanian, Venkatesh Raman. 338-348
- Pattern Matching in Compressed TextsS. Rao Kosaraju. 349-362
- All-Pairs Min-Cut in Sparse NetworksSrinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis. 363-376
- Minimizing Space Usage in Evaluation of Expression TreesSandip K. Biswas, Sampath Kannan. 377-390
- Smooth Surfaces for Multi-Scale Shape RepresentationHerbert Edelsbrunner. 391-412
- On Parallel Complexity of Planar TriangulationsChristos Levcopoulos, Andrzej Lingas, Cao Wang. 413-427
- Computing a Largest Empty Anchored Cylinder, and Related ProblemsFrank Follert, Elmar Schömer, Jürgen Sellen, Michiel H. M. Smid, Christian Thiel. 428-442
- Computing Hierarchies of Clusters from the Euclidean Minimum Spanning Tree in Linear TimeDrago Krznaric, Christos Levcopoulos. 443-455
- Determinizing Büchi Asnchronous AutomataNils Klarlund, Madhavan Mukund, Milind A. Sohoni. 456-470
- Achilles and the Tortoise Climbing Up the Arithmetical HierarchyEugene Asarin, Oded Maler. 471-483
- Generalized Temporal Verification DiagramsAnca Browne, Zohar Manna, Henny Sipma. 484-498
- Model Checking of Probabalistic and Nondeterministic SystemsAndrea Bianco, Luca de Alfaro. 499-513