Abstract is missing.
- Communication Complexity of PRAMs (Preliminary Version)Alok Aggarwal, Ashok K. Chandra. 1-17
- Average Case Complexity Analysis of the Rete Multi-Pattern Match AlgorithmLuc Albert, François Fages. 18-37
- Problems Easy for Tree-Decomposable Graphs (Extended Abstract)Stefan Arnborg, Jens Lagergren, Detlef Seese. 38-51
- Serializability in Distributed Systems with HandshakingRalph-Johan Back, Reino Kurki-Suonio. 52-66
- Algorithms for Planar Geometric ModelsChandrajit L. Bajaj, Myung-Soo Kim. 67-81
- Nonuniform LearnabilityGyora M. Benedek, Alon Itai. 82-92
- Zeta Functions of Recognizable LanguagesJean Berstel, Christophe Reutenauer. 93-104
- Dynamic Programming on Graphs with Bounded TreewidthHans Leo Bodlaender. 105-118
- Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM s and Space-Bounded TM sJik H. Chang, Oscar H. Ibarra, Michael A. Palis. 119-132
- Optimal Slope SelectionRichard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi. 133-146
- Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed SystemRobert Cori, Yves Métivier. 147-161
- New Techniques for Proving the Decidability of Equivalence ProblemsKarel Culik II. 162-175
- Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative MonoidsVolker Diekert. 176-187
- The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output TapeMartin Dietzfelbinger, Wolfgang Maass. 188-200
- Geometric Structures in Computational GeometryHerbert Edelsbrunner. 201-213
- Arrangements of Curves in the Plane - Topology, Combinatorics, and AlgorithmsHerbert Edelsbrunner, Leonidas J. Guibas, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir. 214-229
- Reset Sequences for Finite Automata with Application to Design of Parts OrientersDavid Eppstein. 230-238
- Random Allocations and Probabilistic LanguagesPhilippe Flajolet, Danièle Gardy, Loÿs Thimonier. 239-253
- Systolic Architectures, Systems and ComputationsJozef Gruska. 254-270
- New Developments in Structural Complexity TheoryJuris Hartmanis. 271-286
- Operational Semantics of OBJ-3 (Extended Abstract)Claude Kirchner, Hélène Kirchner, José Meseguer. 287-301
- Do We Really Need to Balance Patricia Trees? (Extended Abstract)Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski. 302-316
- Contractions in Comparing Concurrent SemanticsJoost N. Kok, Jan J. M. M. Rutten. 317-332
- A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract)Clyde P. Kruskal, Larry Rudolph, Marc Snir. 333-346
- On the Learnability of DNF FormulaeLudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi. 347-361
- Efficient Algorithms on Context-Free Graph GrammarsClemens Lautemann. 362-378
- Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract)Thomas Lengauer, Egon Wanke. 379-393
- A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel GraphsAndrzej Lingas, Maciej M. Syslo. 394-409
- Constructive Hopf s Theorem: Or How to Untangle Closed Planar CurvesKurt Mehlhorn, Chee-Keng Yap. 410-423
- Maximal Dense Intervals of Grammar FormsValtteri Niemi. 424-438
- Computations, Residuals, and the POwer of IndeterminancyPrakash Panangaden, Eugene W. Stark. 439-454
- Nested Annealing: A Provable Improvement to Simulated AnnealingSanguthevar Rajasekaran, John H. Reif. 455-472
- Nonlinear Pattern Matching in TreesR. Ramesh, I. V. Ramakrishnan. 473-488
- Invertibility of Linear Finite Automata Over a RingRen-ji Tao. 489-501
- Moving Discs Between PolygonsHans Rohnert. 502-515
- Optimal Circuits and Transitive Automorphism GroupsSteven Rudich, Leonard Berman. 516-524
- A Kleene-Presburgerian Approach to Linear Production SystemsJürgen Schäfer. 525-534
- On Minimum Flow and Transitive ReductionKlaus Simon. 535-546
- La Reconnaissance des Facteurs d un Language Fini dans un Texte en Temps Lineaire (Resume)Jean-Claude Spehner. 547-560
- regular Languages Defined with Generalized QuantifiersHoward Straubing, Denis Thérien, Wolfgang Thomas. 561-575
- A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract)Roberto Tamassia. 576-590
- Separating Polynomial-Time Turing and Truth-Table Reductions by Tally SetsShouwen Tang, Ronald V. Book. 591-599
- Assertional Verification of a Timer Based ProtocolGerard Tel. 600-614
- Type Inference with Partial TypesSatish Thatte. 615-629
- Some Behavioural Aspects of Net TheoryP. S. Thiagarajan. 630-653
- The Equivalence of DGSM Replications on Q-Rational Languages is DecidablePaavo Turakainen. 654-666
- Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed GraphsVijay V. Vazirani, Mihalis Yannakakis. 667-681
- On Restricting the Access to an NP-OracleKlaus W. Wagner. 682-696
- On <=^P_{1-tt}-Sparseness and Nondeterministic Complexity Classes (Extended Abstract)Osamu Watanabe. 697-709
- Semantics for Logic Programs without Occur CheckW. P. Weijland. 710-726
- Outer Narrowing for Equational Theories Based on ConstructorsJia-Huai You. 727-741