The SCEAS System
Navigation Menu

Journals in DBLP

Computational Complexity
2005, volume: 14, number: 3

  1. Eric Allender
    Special issue, final part "Conference on Computational Complexity 2004 " Guest Editor's foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:185- [Journal]
  2. Luca Trevisan, Salil P. Vadhan, David Zuckerman
    Compression of Samplable Sources. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:186-227 [Journal]
  3. Harry Buhrman, Troy Lee, Dieter van Melkebeek
    Language compression and pseudorandom generators. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:228-255 [Journal]
  4. Peter Bro Miltersen, N. V. Vinodchandran
    Derandomizing Arthur-Merlin Games using Hitting Sets. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:256-279 [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