16. ICALP 1989: Stresa, Italy

@proceedings{DBLP:conf/icalp/1989,
  editor    = {Giorgio Ausiello and
               Mariangiola Dezani-Ciancaglini and
               Simona Ronchi Della Rocca},
  title     = {Automata, Languages and Programming, 16th International Colloquium,
               ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
  booktitle = {ICALP},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {372},
  year      = {1989},
  isbn      = {3-540-51371-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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