Abstract is missing.
- Abstract Interpretation of Denotational Definions (A Survey)Flemming Nielson. 1-20
- Temporal Reasoning Under Generalized Fairness ConstraintsE. Allen Emerson, Chin-Laung Lei. 21-36
- Décidabiité de l égalité des Languages Algébriques Infinitaires SimplesDidier Caucal. 37-48
- Some Probabilistic Powerdomains in the Category SFPDavid de Frutos-Escrig. 49-59
- Icons and Local Definitions in Logic ProgrammingM. A. Nait Abdallah. 60-72
- Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and IdentificationPaul G. Spirakis. 73-86
- A Parallel Statistical Cooling AlgorithmEmile H. L. Aarts, F. M. J. de Bont, J. H. A. Habers, Peter J. M. van Laarhoven. 87-97
- Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic TimeAndrzej Lingas. 98-103
- Polynomial Time Algorithms for Finding Integer Relations Among Real NumbersJohan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr. 105-118
- New Upperbounds for Decentralized Extrema-Finding in a Ring of ProcessorsHans Leo Bodlaender, Jan van Leeuwen. 119-129
- Algorithms for Visibility Representations of Planar GraphsRoberto Tamassia, Ioannis G. Tollis. 130-141
- Speeding up Random Access Machines by Few ProcessorsFriedhelm Meyer auf der Heide. 142-152
- Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined GraphsThomas Lengauer. 153-170
- On Sparseness, Ambiguity and other Decision Problems for Acceptors and TransducersOscar H. Ibarra, Bala Ravikumar. 171-179
- Variétés de Semis Groupes et Mots InfinisJean-Pierre Pécuchet. 180-191
- Equations in Free Partially Commutative MonoidsChristine Duboc. 192-202
- Separating and TestingPhilippe Darondeau. 203-212
- Décomposition de Fonctions RationnellesChristian Choffrut, Marcel Paul Schützenberger. 213-226
- Long Unavoidable PatternsUrsula Schmidt. 227-235
- Abstract Implementations and Correctness ProofsGilles Bernot, Michel Bidoit, Christine Choppy. 236-251
- Strictness and SerializabilityUdo Kelter. 252-261
- Towards Specification and Proof of Asynchronous SystemsB. Gamatie. 262-276
- Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report)Harry B. Hunt III, Richard Edwin Stearns. 277-290
- Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract)Chandra M. R. Kintala, Detlef Wotschke. 291-305
- Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-MachinesLouis E. Rosier, Hsu-Chun Yen. 306-320
- On Sparse Oracles Separating Feasible Complexity ClassesJuris Hartmanis, Lane A. Hemachandra. 321-333
- On Generalized Kolmogorov ComplexityJosé L. Balcázar, Ronald V. Book. 334-340
- Area-time Optimal Division for T=Omega(log n):::1+epsilon:::Kurt Mehlhorn, Franco P. Preparata. 341-352
- A Time-Space Tradeoff for Element DistinctnessAllan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson. 353-358
- Parallel Machines and their Communication Theoretical LimitsRüdiger Reischuk. 359-368