Abstract is missing.
- Characterizations on PUNC and Precomputation (Extended Abstract)Eric Allender. 1-10
- Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial ApproachDidier Arquès, Jean Françon, M. T. Guichet, P. Guichet. 11-20
- A New Duality Result Concerning Voronoi DiagramsFranz Aurenhammer. 21-30
- Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a PolynomialAmir Averbuch, Shmuel Winograd, Zvi Galil. 31-39
- On Exponential LownessRonald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe. 40-49
- A Tradeoff Between Search and Update Time for the Implicit Dictionary ProblemAllan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson. 50-59
- Intersections of Some Families of LanguagesFranz-Josef Brandenburg. 60-68
- Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary)Janusz A. Brzozowski, Carl-Johan H. Seger. 69-78
- Counting with Rational FunctionsChristian Choffrut, Marcel Paul Schützenberger. 79-88
- Finite Biprefix Sets of Path in a GraphClelia de Felice. 89-94
- Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract)Patrick W. Dymond, Walter L. Ruzzo. 95-104
- A Strong Restriction of the Inductive Completion ProcedureLaurent Fribourg. 105-115
- On Discerning Words by AutomataPavel Goralcik, Václav Koubek. 116-122
- Complexity Classes Without Machines: On Complete Languages for UPJuris Hartmanis, Lane A. Hemachandra. 123-135
- Containment, Separation, Complete Sets, and Immunity of Complexity ClassesJuris Hartmanis, Ming Li, Yaacov Yesha. 136-145
- On Nontermination of Knuth-Bendix AlgorithmMiki Hermann, Igor Prívara. 146-156
- Tradeoffs for Language Recognition on Parallel Computing ModelsJuraj Hromkovic. 157-166
- Rational Equivalence RelationsJ. Howard Johnson. 167-176
- Some Further Results on Digital Search TreesPeter Kirschenhofer, Helmut Prodinger. 177-185
- Knowledge, Belief and TimeSarit Kraus, Daniel J. Lehmann. 186-195
- A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract)Ten-Hwang Lai. 196-205
- Decompositions of Nondeterministic Reductions (Extended Abstract)Klaus-Jörn Lange. 206-214
- Hierarchical Planary Testing AlgorithmsThomas Lengauer. 215-225
- Synthesis and Equivalence of Concurrent SystemsBjörn Lisper. 226-235
- The Set Union Problem with BacktrackingHeikki Mannila, Esko Ukkonen. 236-243
- Torsion Matrix Semigroups and Recognizable TransductionsJean-Paul Mascle. 244-253
- On Recognizable Subsets of Free Partially Commutative MonoidsYves Métivier. 254-264
- Min Cut is NP-Complete for Edge Weigthed TreesBurkhard Monien, Ivan Hal Sudborough. 265-274
- Alternating Automata. The Weak Monadic Theory of the Tree, and its ComplexityDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. 275-283
- Subpolynomial Complexity Classes of Real Functions and Real NumbersNorbert Th. Müller. 284-293
- Etude Syntaxique des Parties Reconnaissables de Mots InfinisJean-Pierre Pécuchet. 294-303
- Refusal TestingIain Phillips. 304-313
- A Timed Model for Communicating Sequential ProcessesGeorge M. Reed, A. W. Roscoe. 314-323
- A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. SelmanKenneth W. Regan. 324-333
- On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State ProgramsLouis E. Rosier, Hsu-Chun Yen. 334-343
- A New Approach to Detection of Locally Indicative StabilityNir Shavit, Nissim Francez. 344-358
- A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract)Claus-Peter Schnorr. 359-369
- Lower Bounds by Recursion Theoretic Arguments (Extended Abstract)Uwe Schöning. 370-375
- An Improved Algorithm for Transitive Closure on Acyclic DigraphsKlaus Simon. 376-386
- Un Algorithme Determinant les Melanges de Deux MotsJean-Claude Spehner. 387-396
- A Very Fast, Practical Algorithm for Finding a Negative Cycle in a DigraphPaul G. Spirakis, Athanasios K. Tsakalidis. 397-406
- A Compositional Reformulation of Owicki-Gries s Partial Correctness Logic for a Concurrent While LanguageColin Stirling. 407-415
- Semigroups and Languages of Dot-Depth 2Howard Straubing. 416-423
- A Parallel Vertex Insertion Algorithm For Minimum Spanning TreesPeter J. Varman, Kshitij Doshi. 424-433
- More Complicated Questions About Maxima and Minima, and Some Closures of NPKlaus W. Wagner. 434-443
- Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract)Dan E. Willard. 444-453
- E-Unification Algorithms for a Class of Confluent Term Rewriting SystemsJia-Huai You, P. A. Subrahmanyam. 454-463
- On Fixed-Point Clones (Extended Abstract)Damian Niwinski. 464-473