The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Computational Complexity
2006, volume: 15, number: 4

  1. Anna Gál
    Special Issue "Conference on Computational Complexity 2005" Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:297- [Journal]
  2. Ronen Shaltiel, Christopher Umans
    Pseudorandomness for Approximate Counting and Sampling. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:298-341 [Journal]
  3. Neeraj Kayal, Nitin Saxena
    Complexity of Ring Morphism Problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:342-390 [Journal]
  4. Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson
    A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:391-432 [Journal]
  5. Ryan Williams
    Inductive Time-Space Lower Bounds for Sat and Related Problems. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2006, v:15, n:4, pp:433-470 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002