Abstract is missing.
- Probability and Plurality for Aggregations of Learning MachinesLeonard Pitt, Carl H. Smith. 1-10
- Logic Programming with IonsM. A. Nait Abdallah. 11-20
- Inverse Image AnalysisPeter Dybjer. 21-30
- A Unification Algorithms for Confluent TheoriesSteffen Hölldobler. 31-41
- On the Knuth-Bendix Completion for Concurrent ProcessesVolker Diekert. 42-53
- On Word Problems in Equational TheoriesJieh Hsiang, Michaël Rusinowitch. 54-71
- Semantics for Nondeterministic Asynchronous Broadcast NetworksR. K. Shyamasundar, K. T. Narayana, Toniann Pitassi. 72-83
- Another Look at Abstraction in Process Algebra (Extended Abstract)Jos C. M. Baeten, Rob J. van Glabbeek. 84-94
- A Timed Failures Model for Extended Communicating ProcessesRob Gerth, Andy Boucher. 95-114
- Readiness Semantics for Regular Processes with Silent ActionsSusanne Graf, Joseph Sifakis. 115-125
- Verifying a Protocol Using Relativized BisimulationKim Guldstrand Larsen, Robin Milner. 126-135
- On Recent Trends in Formal Language TheoryJuhani Karhumäki. 136-162
- Non-Uniform Automata Over GroupsDavid A. Mix Barrington, Denis Thérien. 163-173
- Minimal Automaton of a Rational CoverDanièle Beauquier. 174-189
- A Star-Height Problem in Free Monoids with Partial CommunicationsChristian Choffrut, Christine Duboc. 190-201
- Single-Valued Finite TransductionJ. Howard Johnson. 202-211
- The Kleene and the Parikh Theorem in Complete SemiringsWerner Kuich. 212-225
- An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation GraphsYves Métivier. 226-236
- On the Language Accepted by Finite Reversible AutomataJean-Eric Pin. 237-249
- Decision Problems for Regular Trace LanguagesIJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom. 250-259
- Panic Mode without PanicMichal Chytil, Jirí Demner. 260-268
- Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary TreeThilo Hafer, Wolfgang Thomas. 269-279
- Modelchecking of CTL Formulae under Liveness AssumptionsBernhard Josko. 280-289
- A Modal Logic for a Subclass of Event StructuresKamal Lodaya, P. S. Thiagarajan. 290-303
- Parallel 5-Colouring of Planar GraphsTorben Hagerup, Marek Chrobak, Krzysztof Diks. 304-313
- Parallel Construction of a Suffix Tree (Extended Abstract)Gad M. Landau, Baruch Schieber, Uzi Vishkin. 314-325
- The Probabilistic and Deterministic Parallel Complexity of Symmetric FunctionsMing Li, Yaacov Yesha. 326-335
- Term Matching on Parallel ComputersR. Ramesh, Rakesh M. Verma, Krishnaprasad Thirunarayan, I. V. Ramakrishnan. 336-346
- Guessing Games and Distributed Computations in Synchronous NetworksJan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks. 347-356
- On the Bivariate Function Minimization Problem And Its Applications to Motion PlanningJacob T. Schwartz, Micha Sharir. 357-363
- Testing the Necklace Condition for Shortest Tours and Optimal Factors in the PlaneHerbert Edelsbrunner, Günter Rote, Emo Welzl. 364-375
- Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract)Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack. 376-385
- Approximating Integer Lattices by Lattices with Cyclic Factor GroupsAzaria Paz, Claus-Peter Schnorr. 386-393
- On the Complexity of Graph Critical UncolorabilityJin-yi Cai, Gabriele E. Meyer. 394-403
- Posets, Boolean Representations and Quick Path SearchingGiorgio Gambosi, Jaroslav Nesetril, Maurizio Talamo. 404-424
- The Lexicographically First Maximal Subgraph Problems: P-Completeness and NC AlgorithmsSatoru Miyano. 425-434
- Uniform Computational Complexity of Taylor SeriesNorbert Th. Müller. 435-444
- Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract)Alberto Marchetti-Spaccamela, Carlo Vercellis. 445-456
- Lower Bounds for Sorting of SumsMartin Dietzfelbinger. 457-466
- The I/O Complexity of Sorting and Related Problems (Extended Abstract)Alok Aggarwal, Jeffrey Scott Vitter. 467-478
- A Lower Bound for the Complexity of the Union-Split-Find ProblemKurt Mehlhorn, Stefan Näher, Helmut Alt. 479-488
- The Nearest Common Ancestor in a Dynamic TreeAthanasios K. Tsakalidis. 489-498
- A Generalization of the Procedure of Karp and Miller to Well Structured Transition SystemsAlain Finkel. 499-508
- Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement SystemsRodney R. Howell, Louis E. Rosier. 509-520
- Partial Algebras Flow From Algebraic SpecificationsHans-Jörg Kreowski. 521-530
- The Logarithmic Alternation Hierarchiy Collapses: A Sigma^C_2 = A Pi^C_2Klaus-Jörn Lange, Birgit Jenner, Bernd Kirsig. 531-541
- Testing Membership in Commutative Transformation SemigroupsMartin Beaudry. 542-549
- On the Computing Power of One-Way Cellular ArraysOscar H. Ibarra, Tao Jiang. 550-562
- Recent Developments in the Theory of Learning (Abstract)Leslie G. Valiant. 563