Abstract is missing.
- The Theory of Data Dependencies - An OverviewRonald Fagin, Moshe Y. Vardi. 1-22
- The VLSI Revolution in Theoretical CirclesArnold L. Rosenberg. 23-40
- Tuple Sequences and IndexesSerge Abiteboul, Seymour Ginsburg. 41-50
- The Complexity of Cubical Graphs (Extended Abstract)Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou. 51-57
- P-Generic SetsKlaus Ambos-Spies. 58-68
- Functional Dependencies and Disjunctive Existence Constraints in Database Relations with Null ValuesPaolo Atzeni, Nicola M. Morfuni. 69-81
- The Algebra of Recursively Defined Processes and the Algebra of Regular ProcessesJan A. Bergstra, Jan Willem Klop. 82-94
- Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and EquationsMichel Bidoit. 95-108
- Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear TimeAnselm Blumer, J. Blumer, Andrzej Ehrenfeucht, David Haussler, Ross M. McConnell. 109-118
- The Complexity and Decidability of SeparationBernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood. 119-127
- Concurrent Transmissions in Broadcast NetworksCharles J. Colbourn, Andrzej Proskurowski. 128-136
- Linear Searching for a Squre in a Word (Abstract)Maxime Crochemore. 137
- Domain AlgebrasPeter Dybjer. 138-150
- Principality Results About Some Matrix Languages FamiliesDidier Ferment. 151-161
- Oriented Equational Clauses as a Programming LanguageLaurent Fribourg. 162-173
- Relational Algebra Operations and Sizes of RelationsDanièle Gardy, Claude Puech. 174-186
- Some Results About Finite and Infinite Behaviours of a Pushdown AutomatonDanièle Beauquier. 187-195
- On the Relationship of CCS and Petri NetsUrsula Goltz, Alan Mycroft. 196-208
- Communicating Finite State Machines with Priority ChannnelsMohamed G. Gouda, Louis E. Rosier. 209-221
- A Modal Characterization of Observational Congruence on Finite Terms of CCSSusanne Graf, Joseph Sifakis. 222-234
- Communication ComplexityJuraj Hromkovic. 235-246
- Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAsOscar H. Ibarra, Sam M. Kim, Louis E. Rosier. 247-259
- A Complete Axiom System for Algebra of Closed-Regular ExpressionHiroyuki Izumi, Yasuyoshi Inagaki, Namio Honda. 260-269
- The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract)Mark Jerrum. 270-280
- On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract)Hermann Jung. 281-291
- On Three-Element CodesJuhani Karhumäki. 292-302
- Recursion Depth Analysis for Specail Tree Traversal AlgorithmsPeter Kirschenhofer, Helmut Prodinger. 303-311
- Performance Analysis of Shamir s Attack on the Basic Merkle-Hellman Knapsack CryptosystemJ. C. Lagarias. 312-323
- Measures of Presortedness and Optimal Sorting Algorithms (Extended Abstract)Heikki Mannila. 324-336
- Languages and Inverse SemigroupsStuart W. Margolis, Jean-Eric Pin. 337-346
- Area-Time Optimal VLSI Integer Multiplier with Minimum Computation TimeKurt Mehlhorn, Franco P. Preparata. 347-357
- On the Interpretation of Infinite Computations in Logic ProgrammingM. A. Nait Abdallah. 358-370
- A Linear Time Algorithm to Solve the Single Function Coarsest Partition ProblemRobert Paige, Robert Endre Tarjan. 371-379
- Complexité des Facteurs des Mots Infinis Engendrés par Morphimes ItérésJean-Jacques Pansiot. 380-389
- Automates Boustrophendon, Semi-Groupe de Birget et Monoide Inversiv Libre (Abstract/ Résumé)Jean-Pierre Pécuchet. 390
- Probabilistic Bidding Gives Optimal Distributed Resource AllocationJohn H. Reif, Paul G. Spirakis. 391-402
- Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on FairnessWolfgang Reisig. 403-413
- Cancellation, Pumping and Permutation in Formal LanguagesAntonio Restivo, Christophe Reutenauer. 414-422
- A Hardware Implementation of the CSP Primitives and its VerificationDorit Ron, Flavia Rosemberg, Amir Pnueli. 423-435
- Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction AlgorithmArnold Schönhage. 436-447
- Robust Algorithms: A Different Approach to OraclesUwe Schöning. 448-453
- Node Weighted MatchingThomas H. Spencer, Ernst W. Mayr. 454-464
- The Propositional Mu-Calculus is ElementaryRobert S. Streett, E. Allen Emerson. 465-472
- AVL-Trees for Localized SearchAthanasios K. Tsakalidis. 473-485
- The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version)Paul M. B. Vitányi. 486-489
- Computational Complexity of an Optical Disk Interface (Extended Abstract)Jeffrey Scott Vitter. 490-502
- Encoding Graphs by Derivations and Implications for the Theory of Graph GrammarsEmo Welzl. 503-513
- Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract)Dan E. Willard. 514-526