The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
1989 (conf/icalp/1989)

  1. 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]
  2. Eric Allender
    Limitations of the Upward Separation Technique (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:18-30 [Conf]
  3. Eric Allender, Lane A. Hemachandra
    Lower Bounds for the Low Hierarchy (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:31-45 [Conf]
  4. 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]
  5. Danièle Beauquier, Jean-Eric Pin
    Factors of Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:63-79 [Conf]
  6. Piotr Berman, Juan A. Garay
    Asymptotically Optimal Distributed Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:80-94 [Conf]
  7. 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]
  8. Corrado Böhm
    Subduing Self-Application. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:108-122 [Conf]
  9. 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]
  10. Val Tannen, Jean H. Gallier
    Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:137-150 [Conf]
  11. Véronique Bruyère
    Completion of Finite Codes with Finite Deciphering Delay. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:151-163 [Conf]
  12. Felice Cardone
    Relational Semantics for Recursive Types and Bounded Quantification. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:164-178 [Conf]
  13. 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]
  14. Loïc Colson
    About Primitive Recursive Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:194-206 [Conf]
  15. Bruno Courcelle
    The Definability of Equational Graphs in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:207-221 [Conf]
  16. Karel Culik II, Tero Harju
    Dominoes and the Regularity of DNS Splicing Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:222-233 [Conf]
  17. Philippe Darondeau, Pierpaolo Degano
    Causal Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:234-248 [Conf]
  18. Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted
    Infinite Normal Forms (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:249-262 [Conf]
  19. Hartmut Ehrig, Peter Pepper, Fernando Orejas
    On Recent Trends in Algebraic Specification. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:263-288 [Conf]
  20. Joost Engelfriet, Hendrik Jan Hoogeboom
    Automata with Storage on Infinite Words. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:289-303 [Conf]
  21. David Eppstein, Zvi Galil
    Parallel Algorithmic Techniques for Combinatorial Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:304-318 [Conf]
  22. 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]
  23. Paul Feldman, Silvio Micali
    An Optimal Probabilistic Algorithm For Synchronous Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:341-378 [Conf]
  24. Donald S. Fussell, Vijaya Ramachandran, Ramakrishna Thurimella
    Finding Triconnected Components by Local Replacements. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:379-393 [Conf]
  25. Zvi Galil, Kunsoo Park
    An Improved Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:394-404 [Conf]
  26. 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]
  27. 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]
  28. Torben Hagerup, Manfred Nowak
    Parallel Retrieval of Scattered Information. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:439-450 [Conf]
  29. Johan Håstad
    Tensor Rank is NP-Complete. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:451-460 [Conf]
  30. Dorit S. Hochbaum, J. George Shanthikumar
    The Complexity of Nonlinear Separable Optimization. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:461-472 [Conf]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. Zohar Manna, Amir Pnueli
    Completing the Temporal Picture. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:534-558 [Conf]
  36. 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]
  37. 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]
  38. Pierre McKenzie, Denis Thérien
    Automata Theory Meets Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:589-602 [Conf]
  39. 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]
  40. Christos H. Papadimitriou, Mihalis Yannakakis
    Shortest Paths Without a Map. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:610-620 [Conf]
  41. Francesco Parisi-Presicce
    Modular System Design Applying Graph Grammars Techniques. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:621-636 [Conf]
  42. Dominique Perrin
    Partial Commutations. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:637-651 [Conf]
  43. Amir Pnueli, Roni Rosner
    On the Synthesis of an Asynchronous Reactive Module. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:652-671 [Conf]
  44. Kirk Pruhs, Udi Manber
    The Complexity of Controlled Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:672-686 [Conf]
  45. Prabhakar Raghavan, Marc Snir
    Memory Versus Randomization in On-line Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:687-703 [Conf]
  46. John C. Reynolds
    Syntactic Control of Inference, Part 2. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:704-722 [Conf]
  47. Bernhard Steffen
    Characteristic Formulae. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:723-732 [Conf]
  48. Jacobo Torán
    A Combinatorial Technique for Separating Counting Complexity Classes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:733-744 [Conf]
  49. 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]
  50. Glynn Winskel
    A Note on Model Checking the Modal nu-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:761-772 [Conf]
  51. Guo-Qiang Zhang
    DI-Domains as Information Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:773-788 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002