The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1980, volume: 21, number: 2

  1. Ashok K. Chandra, David Harel
    Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
  2. Richard E. Ladner
    The Complexity of Problems in Systems of Communicating Sequential Processes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:179-194 [Journal]
  3. Michael Sipser
    Lower Bounds on the Size of Sweeping Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:195-202 [Journal]
  4. Zvi Galil, Amnon Naamad
    An O(EVlog²V) Algorithm for the Maximal Flow Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:203-217 [Journal]
  5. Walter L. Ruzzo
    Tree-Size Bounded Alternation. [Citation Graph (3, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:218-235 [Journal]
  6. J. Ian Munro, Hendra Suwanda
    Implicit Data Structures for Fast Search and Update. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:236-250 [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