Abstract is missing.
- Algenraic Operational SemanticsYuri Gurevich. 1-2
- On Ambiguity of DTOL SystemsK. G. Subramanian, Do Long Van, Rani Siromoney. 3-14
- The Equivalence Problem for n-Tape Finite Automata with Simple CyclesKarel Culik II, Matti Linna. 15-25
- Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their RepresentationOscar H. Ibarra, Bala Ravikumar. 26-43
- Automata, Games, and Positive Monadic Theories of TreesMichel Parigot. 44-57
- An Algorithm for Colouring Perfect Planar GraphsIain A. Stewart. 58-64
- Efficient Algorithms for Domination and Hamilton Circuit Problems on Permutation GraphsP. Shanti Sastry, N. Jayakumar, C. E. Veni Madhavan. 65-78
- Fast Parallel Algorithms for the Subgraph Homophormism and the Subgraph Isomorphism Problem for Classes of Planat GraphsAndrzej Lingas, Andrzej Proskurowski. 79-94
- Improved Bounds for Covering General Polygons with RectanglesChristos Levcopoulos. 95-102
- Submodule Construction as Equation Solving CCSJoachim Parrow. 103-123
- Computations in Undistinguished NetworksShaji Bhaskar, Gael N. Buckley. 124-137
- A Distributed Algorithm to Implement N-Party RendevouzRajive Bagrodia. 138-152
- Merge and Termination in Process AlgebraJos C. M. Baeten, Rob J. van Glabbeek. 153-172
- Parallelism and Programming: A PerspectiveK. Mani Chandy, Jayadev Misra. 173-194
- On Optimal Parallelization of Sorting NetworksEthan Gannett, Suresh C. Kothari, Hsu-Chun Yen. 195-206
- Parallel Algorithms for Approximate Edge Colouring of Simple graphsO. A. Ogunyode. 207-225
- An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing NetworksSanguthevar Rajasekaran, Thanasis Tsantilas. 226-241
- An O(n²) Algorithm for Fan-Out Free Query OptimizationPratul Dublish, S. N. Maheshwari. 242-264
- Weak Consistency Of Read-only Transactions: A Tool to Improve Concurrency in Heterogeneous Locking ProtocolsR. C. Hansdah, Lalit M. Patnaik. 265-281
- Optimizing Join Queries in Distributed DatabaseSakti Pramanik, David Vineyard. 282-304
- Reasoning in Systems of Equations and InequationsChilukuri K. Mohan, Mandayam K. Srivas, Deepak Kapur. 305-325
- Specification = Program + TypesLee Naish. 326-339
- Paraconsistent Logic ProgrammingHoward A. Blair, V. S. Subrahmanian. 340-360
- Semantics of Distributed Horn Clause ProgramsRamaswamy Ramanujam. 361-371
- The Calculus of Constructions: State of the ArtGérard P. Huet. 372
- Models for Re-UseDavid Gries. 373-375
- Hierarchical Refinement Of A Z SpecificationDave Neilson. 376-399
- Lazy pattern matching in the ML languageAlain Laville. 400-419 [doi]
- Program Development Using Lambda AbstractionAlberto Pettorossi. 420-434
- Relativized Arthur-Merlin versus Merlin-Arthur GamesMiklos Santha. 435-442
- Probabalistic Quantifiers vs. Distrustful AdversariesStathis Zachos, Martin Furer. 443-455
- On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF FormulasVikraman Arvind, Somenath Biswas. 456-469
- A Look-Ahead Interpreter for Sequential Prolog and Its ImplementationAshok Kumar, Vishv M. Malhotra. 470-484
- Extension of Weakest Precondition Formalism to a Low Level LanguageAmitabha Sanyal, Supratim Biswas, Vishv M. Malhotra. 485-499
- Retrospection on the Compiler StructureKesav V. Nori, Sanjeev Kumar, M. Pavan Kumar. 500-527
- Some Recent Applications of KnowledgeRohit Parikh. 528-539