The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1980, volume: 20, number: 1

  1. Takumi Kasai, Akeo Adachi
    A Characterization of Time Complexity by Simple Loop Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:1-17 [Journal]
  2. William J. Masek, Mike Paterson
    A Faster Algorithm Computing String Edit Distances. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:18-31 [Journal]
  3. Janusz A. Brzozowski, Faith E. Fich
    Languages of R-Trivial Monoids. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:32-49 [Journal]
  4. John Gallant, David Maier, James A. Storer
    On Finding Minimal Length Superstrings. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:50-58 [Journal]
  5. Satoru Miyano
    One-Way Weak-Stack-Counter Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:59-76 [Journal]
  6. Teofilo F. Gonzalez, Joseph JáJá
    On the Complexity of Computing Bilinear Forms with {0, 1} Constants. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:77-95 [Journal]
  7. Matthew Hennessy
    A Proof System for the First-Order Relational Calculus. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:96-110 [Journal]
  8. Paul F. Dietz, S. Rao Kosaraju
    Recognition of Topological Equivalence of Patterns by Array Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:111-116 [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