Giorgio Ausiello, Mariangiola Dezani-Ciancaglini, Simona Ronchi Della Rocca
Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ICALP, 1989.
@proceedings{ICALP-1989,
address = "Stresa, Italy",
editor = "Giorgio Ausiello and Mariangiola Dezani-Ciancaglini and Simona Ronchi Della Rocca",
isbn = "3-540-51371-X",
publisher = "{Springer-Verlag}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the 16th International Colloquium on Automata, Languages and Programming}",
volume = 372,
year = 1989,
}
Contents (51 items)
- ICALP-1989-AbadiLW #specification
- Realizable and Unrealizable Specifications of Reactive Systems (MA, LL, PW), pp. 1–17.
- ICALP-1989-Allender
- Limitations of the Upward Separation Technique (EA), pp. 18–30.
- ICALP-1989-AllenderH #bound
- Lower Bounds for the Low Hierarchy (EA, LAH), pp. 31–45.
- ICALP-1989-Baeza-YatesG #performance #regular expression
- Efficient Text Searching of Regular Expressions (RABY, GHG), pp. 46–62.
- ICALP-1989-BeauquierP #word
- Factors of Words (DB, JÉP), pp. 63–79.
- ICALP-1989-BermanG #distributed
- Asymptotically Optimal Distributed Consensus (PB, JAG), pp. 80–94.
- ICALP-1989-BilardiM #bound
- Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions (GB, AM), pp. 95–107.
- ICALP-1989-Bohm #self
- Subduing Self-Application (CB), pp. 108–122.
- ICALP-1989-BrassardC #bound
- Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (GB, CC, MY), pp. 123–136.
- ICALP-1989-TannenG #algebra #confluence #normalisation #polymorphism
- Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence (VT, JHG), pp. 137–150.
- ICALP-1989-Bruyere #finite
- Completion of Finite Codes with Finite Deciphering Delay (VB), pp. 151–163.
- ICALP-1989-Cardone #bound #quantifier #recursion #relational #semantics
- Relational Semantics for Recursive Types and Bounded Quantification (FC), pp. 164–178.
- ICALP-1989-ChazelleEGS #algebra
- A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications (BC, HE, LJG, MS), pp. 179–193.
- ICALP-1989-Colson #algorithm #recursion
- About Primitive Recursive Algorithms (LC), pp. 194–206.
- ICALP-1989-Courcelle #equation #graph #higher-order #logic #monad
- The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
- ICALP-1989-CulikH
- Dominoes and the Regularity of DNS Splicing Languages (KCI, TH), pp. 222–233.
- ICALP-1989-DarondeauD
- Causal Trees (PD, PD), pp. 234–248.
- ICALP-1989-DershowitzKP #infinity #normalisation
- Infinite Normal Forms (ND, SK, DAP), pp. 249–262.
- ICALP-1989-EhrigPO #algebra #on the #roadmap #specification
- On Recent Trends in Algebraic Specification (HE, PP, FO), pp. 263–288.
- ICALP-1989-EngelfrietH #automaton #infinity #word
- Automata with Storage on Infinite Words (JE, HJH), pp. 289–303.
- ICALP-1989-EppsteinG #algorithm #combinator #parallel
- Parallel Algorithmic Techniques for Combinatorial Computation (DE, ZG), pp. 304–318.
- ICALP-1989-FeldmanINNRS #generative #modelling #on the #random
- On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
- ICALP-1989-FeldmanM #algorithm #probability
- An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement (PF, SM), pp. 341–378.
- ICALP-1989-FussellRT #component
- Finding Triconnected Components by Local Replacements (DSF, VR, RT), pp. 379–393.
- ICALP-1989-GalilP #algorithm #approximate #string
- An Improved Algorithm for Approximate String Matching (ZG, KP), pp. 394–404.
- ICALP-1989-GambosiNT #data type
- A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps (GG, EN, MT), pp. 405–422.
- ICALP-1989-GrooteV #bisimulation #congruence #semantics
- Structural Operational Semantics and Bisimulation as a Congruence (JFG, FWV), pp. 423–438.
- ICALP-1989-HagerupN #parallel #retrieval
- Parallel Retrieval of Scattered Information (TH, MN), pp. 439–450.
- ICALP-1989-Hastad #rank
- Tensor Rank is NP-Complete (JH), pp. 451–460.
- ICALP-1989-HochbaumS #complexity #optimisation
- The Complexity of Nonlinear Separable Optimization (DSH, JGS), pp. 461–472.
- ICALP-1989-Kenyon-MathieuV #analysis #data type
- General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (CKM, JSV), pp. 473–487.
- ICALP-1989-LiV #concurrent #how
- How to Share Concurrent Asynchronous Wait-Free Variables (ML, PMBV), pp. 488–505.
- ICALP-1989-LiV89a #approach #complexity #formal method
- A New Approach to Formal Language Theory by Kolmogorov Complexity (ML, PMBV), pp. 506–520.
- ICALP-1989-LouchardRS #algorithm #analysis #probability
- Dynamic Algorithms in D. E. Knuth’s Model: A Probabilistic Analysis (GL, BR, RS), pp. 521–533.
- ICALP-1989-MannaP
- Completing the Temporal Picture (ZM, AP), pp. 534–558.
- ICALP-1989-MansourST #bound
- Lower Bounds for Computations with the Floor Operation (YM, BS, PT), pp. 559–573.
- ICALP-1989-MasonT #abstraction #programming
- Programming, Transforming, and Providing with Function Abstractions and Memories (IAM, CLT), pp. 574–588.
- ICALP-1989-McKenzieT #automaton #complexity
- Automata Theory Meets Circuit Complexity (PM, DT), pp. 589–602.
- ICALP-1989-MehlhornP #source code
- Two Versus One Index Register and Modifiable Versus Non-modifiable Programs (KM, WJP), pp. 603–609.
- ICALP-1989-PapadimitriouY
- Shortest Paths Without a Map (CHP, MY), pp. 610–620.
- ICALP-1989-Parisi-Presicce #composition #design #graph grammar
- Modular System Design Applying Graph Grammars Techniques (FPP), pp. 621–636.
- ICALP-1989-Perrin
- Partial Commutations (DP), pp. 637–651.
- ICALP-1989-PnueliR #on the #synthesis
- On the Synthesis of an Asynchronous Reactive Module (AP, RR), pp. 652–671.
- ICALP-1989-PruhsM #complexity
- The Complexity of Controlled Selection (KP, UM), pp. 672–686.
- ICALP-1989-RaghavanS #algorithm #memory management #online
- Memory Versus Randomization in On-line Algorithms (PR, MS), pp. 687–703.
- ICALP-1989-Reynolds
- Syntactic Control of Inference, Part 2 (JCR), pp. 704–722.
- ICALP-1989-Steffen
- Characteristic Formulae (BS), pp. 723–732.
- ICALP-1989-Toran #combinator #complexity
- A Combinatorial Technique for Separating Counting Complexity Classes (JT), pp. 733–744.
- ICALP-1989-TuckerZ #source code
- Horn Programs and Semicomputable Relations on Abstract Structures (JVT, JIZ), pp. 745–760.
- ICALP-1989-Winskel #calculus #model checking
- A Note on Model Checking the Modal nu-Calculus (GW), pp. 761–772.
- ICALP-1989-Zhang #information management
- DI-Domains as Information Systems (GQZ), pp. 773–788.
6 ×#algorithm
5 ×#bound
5 ×#complexity
3 ×#algebra
3 ×#on the
2 ×#analysis
2 ×#automaton
2 ×#combinator
2 ×#data type
2 ×#infinity
5 ×#bound
5 ×#complexity
3 ×#algebra
3 ×#on the
2 ×#analysis
2 ×#automaton
2 ×#combinator
2 ×#data type
2 ×#infinity