The SCEAS System
Navigation Menu

Journals in DBLP

ITA
1992, volume: 26, number:

  1. Walter J. Gutjahr, Georg Ch. Pflug
    The limiting common distribution of two leaf heights in a random brinary tree. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:1-18 [Journal]
  2. Elisabeth Pelz
    Normalization of place/transition-systems preserves net behaviour. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:19-44 [Journal]
  3. Bertrand Le Saëc, Igor Litovsky
    Rebootable and suffix-closed omega-power languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:45-58 [Journal]
  4. Chantal Berline
    Rétractions et interprétation interne du polymorphisme: problème de la rétraction universelle. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:59-92 [Journal]
  5. Jürgen Duske, Martin Middendorf, Rainer Parchmann
    Indexed counter languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:93-114 [Journal]
  6. Andrea Masini, Andrea Maggiolo-Schettini
    TTL: A formalism to describe local and global properties of distributed systems. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:115-162 [Journal]
  7. C. P. Rupert
    Crossability of cancellative Kleene semigroups. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:151-162 [Journal]
  8. U. Schmid
    On a tree collision resolution algorithm in presence of capture. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:163-198 [Journal]
  9. Filippo Mignosi, Giuseppe Pirillo
    Repetitions in the Fibonacci infinite word. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:199-204 [Journal]
  10. Mireille Bousquet-Mélou
    Une bijection entre les polyominos convexes dirigés et les mots de Dyck bilatères. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:205-220 [Journal]
  11. Georges Blanc, Noëlle Bleuzen-Guernalec
    Algèbres effectives dans la programmation logique avec constraintes. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:221-242 [Journal]
  12. Tero Harju, H. C. M. Kleijn, Michel Latteux
    Compositional representation of rational functions. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:243-256 [Journal]
  13. Bruno Courcelle
    The monadic second-order logic of graphs III: tree-decompositions, minor and complexity issues. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:257-286 [Journal]
  14. Juha Honkala, Arto Salomaa
    Characterization results about L codes. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:287-302 [Journal]
  15. Mireille Régnier
    Enumeration of bordered words. Le langage de la vache-qui-rit. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:303-318 [Journal]
  16. Zhi-Xiong Wen, Zhi-Ying Wen
    Mots infinis et produits de matrices à coefficents polynomiaux. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:319-344 [Journal]
  17. Matthias Krause, Christoph Meinel, Stephan Waack
    Separating complexity classes related to certain input oblivious logarithmic space-bounded turing machines. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:345-362 [Journal]
  18. Jeanne Devolder, E. Timmerman
    Finitary codes for biinfinite words. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:363-386 [Journal]
  19. Danièle Gardy, Dominique Gouyou-Beauchamps
    Enumerating Davenport-Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:387-402 [Journal]
  20. Bernhard Steffen, C. Barry Jay, Michael Mendler
    Compositional characterization of observable program properties. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:403-424 [Journal]
  21. Jean-Luc Lambert
    The local catenativity of DOL-sequences in free communitative monoids is decidable in the binary case. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:425-438 [Journal]
  22. Victor J. Rayward-Smith, D. Rebaine
    Open shop scheduling with delays. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:439-448 [Journal]
  23. M. Kabil, M. Pouzet
    Une extension d'un théorème de P. Jullien sur les âges de mots. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:449-484 [Journal]
  24. O. Simon
    Algorithme de multiplicativité des sommes des carrés. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:485-506 [Journal]
  25. Matthias Krause
    Separating +L from L, NL, co-NL, and AL=P for oblivious turing machines of linear access. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:507-540 [Journal]
  26. L. Lacaze
    Parties reconnaissables de monoïdes déinis par générateurs et relations. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:541-552 [Journal]
  27. Pierre Péladeau
    Sur le produit avec compteur modulo un nombre entier. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:553-564 [Journal]
  28. Do Long Van, Bertrand Le Saëc, Igor Litovsky
    On coding morphisms for zigzag codes. [Citation Graph (0, 0)][DBLP]
    ITA, 1992, v:26, n:, pp:565-0 [Journal]
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