Abstract is missing.
- The Complexity of Manipulating Hierarchically Defined Sets of RectanglesJon Louis Bentley, Thomas Ottmann. 1-15
- The Transformational Machine: Theme and VariationsAndrei P. Ershov. 16-32
- Probabilistic Two-Way MachinesRusins Freivalds. 33-45
- A Survey of Some Recent Results on Computational Complexity in Weak Theories of ArithmeticDeborah Joseph, Paul Young. 46-60
- A Survey on Oracle TechniquesBernhard Korte, Rainer Schrader. 61-77
- Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey)Burkhard Monien, Ivan Hal Sudborough. 78-93
- Representations of Graphs by Means of Products and Their ComplexityJaroslav Nesetril. 94-102
- Parsing Strategies: A Concise Survey (Preliminary Report)Anton Nijholt. 103-120
- The Art of DynamizingJan van Leeuwen, Mark H. Overmars. 121-131
- Fast Parallel Computation of Polynomials Using Few ProcessesLeslie G. Valiant, Sven Skyum. 132-139
- Generalizations of Petri NetsRüdiger Valk. 140-155
- Partial Match Retrieval in Implicit Data StructuresHelmut Alt, Kurt Mehlhorn, J. Ian Munro. 156-161
- A Characterization of Floyd-Provable ProgramsHajnal Andréka, István Németi, Ildikó Sain. 162-171
- Semantics of CSP via Translation into CCSEgidio Astesiano, Elena Zucca. 172-182
- More about the Geography of Context-Free LanguagesJoffroy Beauquier, Jean Berstel. 183-192
- On the Power of Algebraic SpecificationsJan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing. 193-204
- An Application of the Theory of Free Partially Commutative Monoids: Asymptotic Densities of Trace LanguagesAlberto Bertoni, M. Brambilla, Giancarlo Mauri, Nicoletta Sabadini. 205-215
- On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report)Ronald V. Book, Matthias Jantzen, Burkhard Monien, Colm Ó Dúnlaing, Celia Wrathall. 216-223
- On the Tranformation of Derivation Graphs to Derivation Trees (Preliminary Report)Franz-Josef Brandenburg. 224-233
- Pushdown Automata with Restricted Use of Storage SymbolsAndreas Brandstädt. 234-241
- Structured NetsLudmila Cherkasova, Vadim E. Kotov. 242-251
- Retraceability, Repleteness and Busy Beaver SetsRobert P. Daley. 252-261
- Combining T and level-NWerner Damm, Irène Guessarian. 262-270
- On Realization and ImplementationHans-Dieter Ehrich. 271-280
- Multiplicative Complexity of a Bilinear Form over a Commutative RingDima Grigoriev. 281-286
- Making Dynamic Logic First-OrderPetr Hájek. 287-295
- Partial Interpretations of Program SchemataJ. Horejs. 296-303
- Closure Properties of the Family of Languages Recognized by One-Way Two-Head Deterministic Finite State AutomataJuraj Hromkovic. 304-313
- Another Hierarchy Defined by Multihead Finite AutomataLadislav Janiga. 314-320
- An Extension of Rabin s Complete Proof ConceptJerzy W. Jaromczyk. 321-326
- How to Find Invariants for Coloured Petri NetsKurt Jensen. 327-338
- Relationships between Probabilistic and Deterministic Tape ComplexityH. Jung. 339-346
- Grammatical Levels of the Position Restricted GrammarsAlica Kelemenová. 347-359
- A General Framework for Comparing Sequential and Parallel RewritingH. C. M. Kleijn, Grzegorz Rozenberg. 360-368
- A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic LimitWalter Knödel. 369-378
- Codings of Nonnegative IntegersIvan Korec. 379-388
- The Maximum k-Flow in a NetworkVáclav Koubek, Antonín Ríha. 389-397
- On the Constructive Description of Graph Languages Accepted by Finite AutomataHans-Jörg Kreowski, Grzegorz Rozenberg. 398-409
- Weighted Multidimensional B-trees Used as Nearly Optimal Dynamic DictionariesHans-Peter Kriegel, Vijay K. Vaishnavi. 410-417
- Maximum Flow in Planar NetworksLudek Kucera. 418-422
- Probabilistic Combinatorial OptimizationKarl J. Lieberherr. 423-432
- Time-Processor Trade-offs for Universal Parallel ComputersFriedhelm Meyer auf der Heide. 433-441
- Negative Results on the Size of Deterministic Right ParsersJan Pittl. 442-451
- Key-Equivalence of Functional Dependency Statements SystemsJaroslav Pokorný. 452-462
- On Representations of Dynamic Algebras with ReversionJan Reiterman, Vera Trnková. 463-472
- A Framework for Studying GrammarsBranislav Rovan. 473-482
- On Existence of Complete Predicate Calculus in Metamathematics without ExponentiationVladimir Yu. Sazonov. 483-490
- On Structural Similarity of Context-Free GrammarsEljas Soisalon-Soininen, Derick Wood. 491-498
- Axioms for the Term-Wise Correctness of ProgramsStefan Sokolowski. 499-507
- Complexity and EntropyLudwig Staiger. 508-514
- Axiomatic Semantics of Indirect AddressingJuraj Steiner. 515-523
- Testing of Join Dependency Preserving by a Modified Chase MethodKatsumi Tanaka, Yahiko Kambayashi. 524-533
- A Starvation-Free Solution of the Dining Philosopher s Problem by Use of Interaction SystemsHorst Wedde. 534-543
- Admissible Representations of Effective CPO sKlaus Weihrauch, Gisela Schäfer. 544-553
- Preserving Total Order in Constant Expected TimeJuraj Wiedermann. 554-562
- Constructive Category Theory (No. 1)Akira Kanda. 563-577
- Two Pebbles Don t SufficeLothar Budach. 578-589