Journals in DBLP

Computational Complexity
2006, volume: 15, number: 2

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:2, pp:93- [Journal]
   
2. Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar
   On the Hardness of Approximating Multicut and Sparsest-Cut. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:2, pp:94-114 [Journal]
   
3. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
   Computationally Private Randomizing Polynomials and Their Applications. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:2, pp:115-162 [Journal]
   
4. Sophie Laplante, Troy Lee, Mario Szegedy
   The Quantum Adversary Method and Classical Formula Size Lower Bounds. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:2, pp:163-196 [Journal]