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