Abstract is missing.
- Vertex Packing AlgorithmsLászló Lovász. 1-14
- Linear and Branching Structures in the Semantics and Logics of Reactive SystemsAmir Pnueli. 15-32
- About Rational Sets of Factors of a Bi-Infinite WordDanièle Beauquier, Maurice Nivat. 33-42
- A Fair Protocol for Signing Contracts (Extended Abstract)Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest. 43-52
- The Influence of Key Length on the Area-Time Complexity of SortingGianfranco Bilardi, Franco P. Preparata. 53-62
- Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract)Luc Bougé. 63-70
- On Total Regulators Generated by Derivation RelationsWalter Bucher, Andrzej Ehrenfeucht, David Haussler. 71-79
- Optimal Solutions for a Class of Point Retrieval ProblemsBernard Chazelle, Herbert Edelsbrunner. 80-89
- Fractional Cascading: A Data Structuring Technique with Geometric ApplicationsBernard Chazelle, Leonidas J. Guibas. 90-100
- Hierarchies of One-Way Multihead Automata LanguagesMarek Chrobak. 101-110
- Partitioning Point Sets in 4 DimensionsRichard Cole. 111-119
- A Completeness Theorem for Recursively Defined TypesMario Coppo. 120-129
- Categorial Combinatory LogicPierre-Louis Curien. 130-139
- Towards a Uniform Topological Treatment of Streams and Functions on StreamsJ. W. de Bakker, Joost N. Kok. 140-148
- Infinite Streams and Finite Observations in the Semantics of Uniform ConcurrencyJ. W. de Bakker, John-Jules Ch. Meyer, Ernst-Rüdiger Olderog. 149-157
- Imposed-Functional Dependencies Inducing Horizontal DecompositionsPaul De Bra. 158-170
- Characterization of High Level Tree TransducersJoost Engelfriet, Heiko Vogler. 171-178
- Ambiguity and TranscendencePhilippe Flajolet. 179-188
- A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)Steven Fortune. 189-198
- Deterministic and Las Vegas Primality Testing AlgorithmsMartin Fürer. 199-209
- Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract)Harold N. Gabow, Matthias F. M. Stallmann. 210-220
- Operational Semantics for Order-Sorted AlgebraJoseph A. Goguen, Jean-Pierre Jouannaud, José Meseguer. 221-231
- A Universal Domain Technique for Profinite PosetsCarl A. Gunter. 232-243
- A Simple Proof of the Skolem-Mahler-Lech TheoremGeorges Hansel. 244-249
- On Complete Problems for NP /cap CoNPJuris Hartmanis, Neil Immerman. 250-259
- An Algebraic Theory of Fair Asynchronous Communicating ProcessesMatthew Hennessy. 260-269
- Hoare s Logic for Nondeterministic Regular Programs: A Nonstandard Completeness TheoremMaria Teresa Hortalá-González, Mario Rodríguez-Artalejo. 270-280
- Powerdomains as Algebraic Lattices (Preliminary Report)Karel Hrbacek. 281-289
- Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract)Mark Jerrum. 290-299
- Do Rational Equivalence Relations have Regular Cross-Sections?J. Howard Johnson. 300-309
- On Probabilistic Time and SpaceHermann Jung. 310-317
- The Nearest Neighbor Problem on Bounded DomainsRolf G. Karlsson, J. Ian Munro, Edward L. Robertson. 318-327
- Routing Through a Generalized SwitchboxMichael Kaufmann, Kurt Mehlhorn. 328-337
- On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary AlphabetVeikko Keränen. 338-347
- Every Commutative Quasirational Language is RegularJuha Kortelainen. 348-355
- A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version)Thomas G. Kurtz, Udi Manber. 356-362
- Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract)Gad M. Landau, Mordechai M. Yung, Zvi Galil. 363-372
- A Context Dependent Equivalence between ProcessesKim Guldstrand Larsen. 373-382
- Lower Bounds by Kolmogorov-Complexity (Extended Abstract)Ming Li. 383-393
- A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version)Michael Luby, Prabhakar Ragde. 394-403
- Applications of an Infinite Squarefree CO-CFLMichael G. Main, Walter Bucher, David Haussler. 404-412
- Special Relations in Automated DeductionZohar Manna, Richard J. Waldinger. 413-423
- Dynamic Interpolation SearchKurt Mehlhorn, Athanasios K. Tsakalidis. 424-434
- Polynomial Levelability and Maximal Complexity CoresPekka Orponen, David A. Russo, Uwe Schöning. 435-444
- Finite Group Topology and p-Adic Topology for Free MonoidsJean-Eric Pin. 445-455
- On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract)Seppo Sippu, Eljas Soisalon-Soininen. 456-464
- The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract)A. Prasad Sistla, Moshe Y. Vardi, Pierre Wolper. 465-474
- A Complete Compositional Model Proof System for a Subset of CCSColin Stirling. 475-486
- On Matrix Multiplication Using Array ProcessorsPeter J. Varman, I. V. Ramakrishnan. 487-496
- Optimal Parallel Pattern Matching in Strings (Extended Summary)Uzi Vishkin. 497-508
- Compositionality and Concurrent Networks: Soundness and Completeness of a ProofsystemJob Zwiers, Willem P. de Roever, Peter van Emde Boas. 509-519