The SCEAS System
Navigation Menu

Conferences in DBLP

Colloquium on Trees in Algebra and Programming (CAAP) (caap)
1990 (conf/caap/1990)

  1. Tirza Hirst, David Harel
    On the Power of Bounded Concurrency II: The Pushdown Automata Level. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:1-17 [Conf]
  2. Xavier Gérard Viennot
    Trees Everywhere. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:18-41 [Conf]
  3. Marco Bellia, Michele Bugliesi, M. Eugenia Occhiuto
    Combinatory Forms for Equational Programming: Instances, Unification and Narrowing. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:42-56 [Conf]
  4. Gérard Boudol, Kim Guldstrand Larsen
    Graphical versus Logical Specifications. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:57-71 [Conf]
  5. Jiazhen Cai, Robert Paige, Robert Endre Tarjan
    More Efficient Bottom-Up Tree Pattern Matching. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:72-86 [Conf]
  6. Didier Caucal
    On the Regular Structure of Prefix Rewriting. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:87-102 [Conf]
  7. Edmund M. Clarke, Anca Browne, Robert P. Kurshan
    A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:103-116 [Conf]
  8. Maxime Crochemore, Jean Neraud
    Unitary Monoid with Two Generators: An Algorithmic Point of View. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:117-131 [Conf]
  9. Pierre-Louis Curien, Giorgio Ghelli
    Coherence of Subsumption. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:132-146 [Conf]
  10. Uffe Engberg, Glynn Winskel
    Petri Nets as Models of Linear Logic. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:147-161 [Conf]
  11. Gian Luigi Ferrari, Ugo Montanari
    Towards the Unification of Models for Concurrency. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:162-176 [Conf]
  12. Dominique Geniet, René Schott, Loÿs Thimonier
    A Markovian Concurrency Measure. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:177-190 [Conf]
  13. Kristoffer Høgsbro Holm
    Graph Matching in Operational Semantics and Typing. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:191-205 [Conf]
  14. A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
    ML Typability is DEXTIME-Complete. [Citation Graph (1, 0)][DBLP]
    CAAP, 1990, pp:206-220 [Conf]
  15. Emmanuel Kounalis
    Testing for Inductive (Co)-Reducibility. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:221-238 [Conf]
  16. Guy Louchard, René Schott
    Probabilistic Analysis of Some Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:239-253 [Conf]
  17. Michael I. Schwartzbach
    Infinite Values in Hierarchical Imperative Types. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:254-268 [Conf]
  18. Helmut Seidl
    Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable. [Citation Graph (0, 0)][DBLP]
    CAAP, 1990, pp:269-284 [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