Abstract is missing.
- Experiments, Powerdomains and Fully Abstract Models for Applicative MultiprogrammingSamson Abramsky. 1-13
- Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic LogicPiotr Berman. 14-25
- Reversal-Bounded and Visit-Bounded Realtime ComputationsAndreas Brandstädt, Klaus W. Wagner. 26-39
- Input-Driven Languages are Recognized in log n SpaceBurchard von Braunmühl, Rutger Verbeek. 40-51
- How to Search in HistoryBernard Chazelle. 52-63
- Constructive Mathematics as a Programming Logic I: Some Principles of TheoryRobert L. Constable. 64-77
- The Classifikation of Problems which have Fast Parallel AlgorithmsStephen A. Cook. 78-93
- A Fair Calculus of Communicating SystemsGerardo Costa, Colin Stirling. 94-105
- Two Way Finite State GeneratorsKarel Culik II, Emo Welzl. 106-114
- A Complete Set of Axioms for a Theory of Communicating Sequential ProcessesRocco De Nicola. 115-126
- The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)Michael J. Fischer. 127-140
- Methods in the Analysis of Algorithms: Evaluations of a Recursive Partitioning ProcessPhilippe Flajolet. 141-158
- Space and Reversal Complexity of Probabilistic One-Way Turing MachinesRusins Freivalds. 159-170
- Pseudorandom Number Generation and Space ComplexityMerrick L. Furst, Richard J. Lipton, Larry J. Stockmeyer. 171-176
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)David Harel. 177-194
- Propositional Dynamic Logic of FlowchartsDavid Harel, Rivi Sherman. 195-206
- Fast Triangulation of Simple PolygonsStefan Hertel, Kurt Mehlhorn. 207-218
- On Containment Problems for Finite-Turn Languages (Extended Abstract)Yair Itzhaik, Amiram Yehudai. 219-231
- On Languages Generated by SemigroupsLadislav Janiga, Václav Koubek. 232-240
- Apects of Programs With Finite ModesHans Langmaack. 241-254
- Estimating a Probability Using Finite Memory (Extended Abstract)Frank Thomson Leighton, Ronald L. Rivest. 255-269
- The Greedy and Delauney Triangulations are not Bad in the Average Case and Minimum Weight Geometric Triangulation of Multi-Connected Polygons is NP-CompleteAndrzej Lingas. 270-284
- Decision Problems for Exponential Rings: The p-adic caseAngus Macintyre. 285-289
- Functional Behaviour of Nondeterministic ProgramsMichael G. Main, David B. Benson. 290-301
- A Single Shortest Path Algorithm for Graphs with SeparatorsKurt Mehlhorn, Bernd H. Schmidt. 302-309
- Isomorphism Testing and Canonical Forms for k-Contractable Graphs (A Generalization of Bounded Valence and Bounded Genus)Gary L. Miller. 310-327
- Finding DominatorsRenata Ochranová. 328-334
- Characterizing Composability of Abstract ImplementationsFernando Orejas. 335-346
- Propositional Logics of Programs: New DirectionsRohit Parikh. 347-359
- A New Probabilistic Model for the Study of Algorithmic Properties of Random Graph ProblemsMarco Protasi, Maurizio Talamo. 360-367
- On Diagonalization Methods and the Structure of Language ClassesKenneth W. Regan. 368-380
- A New Solution for the Byzantine Generals Problem (Extended Abstract)Rüdiger Reischuk. 382-393
- Modular Decompostion of Automata (Survey)Dieter Rödding. 394-412
- A Kernel Language for Algebraic Specification and Implementation - Extended AbstractDonald Sannella, Martin Wirsing. 413-427
- A Fast Construction oF Disjoint Paths in Communication NetworksEli Shamir, Eli Upfal. 428-438
- A Tight Omega(loglog n)-Bound on the Time for Parallel Ram s to Compute Nondegenerated Boolean FunctionsHans-Ulrich Simon. 439-444
- The Identification of Propositions and types in Martin-Löf s Type Theory: A Programming ExampleJan M. Smith. 445-456
- Remarks on Searching Labyrinths by AutomataAndrzej Szepietowski. 457-464
- Metrical an Ordered Properties of PowerdomainsSophie Tison, Max Dauchet, Gérard Comyn. 465-474
- Economy of Description for Program Schemes -Extended Abstract-Peter Drum, Detlef Wotschke. 475-486
- On Approximate String MatchingEsko Ukkonen. 487-495
- Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular ProgramsPawel Urzyczyn. 498-504
- A Note on Powerdomains and ModalitiyGlynn Winskel. 505-514
- Reasoning with Fairness ConstraintsDavid Michael Ritchie Park. 516-517