Abstract is missing.
- Realizable and Unrealizable Specifications of Reactive SystemsMartín Abadi, Leslie Lamport, Pierre Wolper. 1-17
- Limitations of the Upward Separation Technique (Preliminary Version)Eric Allender. 18-30
- Lower Bounds for the Low Hierarchy (Extended Abstract)Eric Allender, Lane A. Hemachandra. 31-45
- Efficient Text Searching of Regular Expressions (Extended Abstract)Ricardo A. Baeza-Yates, Gaston H. Gonnet. 46-62
- Factors of WordsDanièle Beauquier, Jean-Eric Pin. 63-79
- Asymptotically Optimal Distributed Consensus (Extended Abstract)Piotr Berman, Juan A. Garay. 80-94
- Time Lower Bounds For CREW-PRAM Computation Of Monotone FunctionsGianfranco Bilardi, Abha Moitra. 95-107
- Subduing Self-ApplicationCorrado Böhm. 108-122
- Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of RoundsGilles Brassard, Claude Crépeau, Moti Yung. 123-136
- Polymorphic Rewriting Conserves Algebraic Strong Normalization and ConfluenceVal Tannen, Jean H. Gallier. 137-150
- Completion of Finite Codes with Finite Deciphering DelayVéronique Bruyère. 151-163
- Relational Semantics for Recursive Types and Bounded QuantificationFelice Cardone. 164-178
- A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its ApplicationsBernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir. 179-193
- About Primitive Recursive AlgorithmsLoïc Colson. 194-206
- The Definability of Equational Graphs in Monadic Second-Order LogicBruno Courcelle. 207-221
- Dominoes and the Regularity of DNS Splicing LanguagesKarel Culik II, Tero Harju. 222-233
- Causal TreesPhilippe Darondeau, Pierpaolo Degano. 234-248
- Infinite Normal Forms (Preliminary Version)Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted. 249-262
- On Recent Trends in Algebraic SpecificationHartmut Ehrig, Peter Pepper, Fernando Orejas. 263-288
- Automata with Storage on Infinite WordsJoost Engelfriet, Hendrik Jan Hoogeboom. 289-303
- Parallel Algorithmic Techniques for Combinatorial ComputationDavid Eppstein, Zvi Galil. 304-318
- On Dice and Coins: Models of Computation for Random GenerationDavid Feldman, Russell Impagliazzo, Moni Naor, Noam Nisan, Steven Rudich, Adi Shamir. 319-340
- An Optimal Probabilistic Algorithm For Synchronous Byzantine AgreementPaul Feldman, Silvio Micali. 341-378
- Finding Triconnected Components by Local ReplacementsDonald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella. 379-393
- An Improved Algorithm for Approximate String MatchingZvi Galil, Kunsoo Park. 394-404
- A Pointer-Free Data Structure for Merging Heaps and Min-Max HeapsGiorgio Gambosi, Enrico Nardelli, Maurizio Talamo. 405-422
- Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract)Jan Friso Groote, Frits W. Vaandrager. 423-438
- Parallel Retrieval of Scattered InformationTorben Hagerup, Manfred Nowak. 439-450
- Tensor Rank is NP-CompleteJohan Håstad. 451-460
- The Complexity of Nonlinear Separable OptimizationDorit S. Hochbaum, J. George Shanthikumar. 461-472
- General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract)Claire Kenyon-Mathieu, Jeffrey Scott Vitter. 473-487
- How to Share Concurrent Asynchronous Wait-Free Varaibles (Preliminary Version)Ming Li, Paul M. B. Vitányi. 488-505
- A New Approach to Formal Language Theory by Kolmogorov Complexity (Preliminary Version)Ming Li, Paul M. B. Vitányi. 506-520
- Dynamic Algorithms in D. E. Knuth s Model: A Probabilistic AnalysisGuy Louchard, B. Randrianarimanana, René Schott. 521-533
- Completing the Temporal PictureZohar Manna, Amir Pnueli. 534-558
- Lower Bounds for Computations with the Floor OperationYishay Mansour, Baruch Schieber, Prasoon Tiwari. 559-573
- Programming, Transforming, and Providing with Function Abstractions and MemoriesIan A. Mason, Carolyn L. Talcott. 574-588
- Automata Theory Meets Circuit ComplexityPierre McKenzie, Denis Thérien. 589-602
- Two Versus One Index Register and Modifiable Versus Non-modifiable ProgramsKurt Mehlhorn, Wolfgang J. Paul. 603-609
- Shortest Paths Without a MapChristos H. Papadimitriou, Mihalis Yannakakis. 610-620
- Modular System Design Applying Graph Grammars TechniquesFrancesco Parisi-Presicce. 621-636
- Partial CommutationsDominique Perrin. 637-651
- On the Synthesis of an Asynchronous Reactive ModuleAmir Pnueli, Roni Rosner. 652-671
- The Complexity of Controlled SelectionKirk Pruhs, Udi Manber. 672-686
- Memory Versus Randomization in On-line Algorithms (Extended Abstract)Prabhakar Raghavan, Marc Snir. 687-703
- Syntactic Control of Inference, Part 2John C. Reynolds. 704-722
- Characteristic FormulaeBernhard Steffen. 723-732
- A Combinatorial Technique for Separating Counting Complexity ClassesJacobo Torán. 733-744
- Horn Programs and Semicomputable Relations on Abstract StructuresJ. V. Tucker, Jeffery I. Zucker. 745-760
- A Note on Model Checking the Modal nu-CalculusGlynn Winskel. 761-772
- DI-Domains as Information Systems (Extended Abstract)Guo-Qiang Zhang. 773-788