The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1989, volume: 39, number: 1

  1. Moon-Jung Chung, Bala Ravikumar
    Strong Nondeterministic Turing Reduction - A Technique for Proving Intractability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:2-20 [Journal]
  2. Martín Abadi, Joan Feigenbaum, Joe Kilian
    On Hiding Information from an Oracle. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:21-50 [Journal]
  3. Daniel Leivant
    Descriptive Characterizations of Computational Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:51-83 [Journal]
  4. Uwe Schöning
    Probabilistic Complexity Classes and Lowness. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:84-100 [Journal]
  5. Eric Allender
    Some Consequences of the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:101-124 [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