The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Comput.
2001, volume: 168, number: 2

  1. Konstantin Skodinis
    The Complexity of the Kn, n-Problem for Node Replacement Graph Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:95-112 [Journal]
  2. Anna Bernasconi, Carsten Damm, Igor Shparlinski
    Circuit and Decision Tree Complexity of Some Number Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:113-124 [Journal]
  3. Henning Fernau, Ludwig Staiger
    Iterated Function Systems and Control Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:125-143 [Journal]
  4. Clelia de Felice
    On Some Schützenberger Conjectures. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:144-155 [Journal]
  5. Frank Neven, Martin Otto, Jerzy Tyszkiewicz, Jan Van den Bussche
    Adding For-Loops to First-Order Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:156-186 [Journal]
  6. Shigeki Iwata
    Lower Bounds for Merging Networks. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:168, n:2, pp:187-195 [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