The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
1998, volume: 7, number: 1

  1. Vince Grolmusz
    Circuits and Multi-Party Protocols. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:1, pp:1-18 [Journal]
  2. Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt
    Complexity Theoretic Hardness Results for Query Learning. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:1, pp:19-53 [Journal]
  3. Etienne Grandjean, Frédéric Olive
    Monadic Logical Definability of Nondeterministic Linear Time. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:1, pp:54-97 [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