Journals in DBLP

SIAM J. Comput.
2006, volume: 36, number: 4

1. Oded Goldreich, Madhu Sudan
   Special Issue on Randomness and Complexity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:- [Journal]
   
2. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
   Cryptography in NC⁰. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:845-888 [Journal]
   
3. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
   Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal]
   
4. Irit Dinur, Omer Reingold
   Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:975-1024 [Journal]
   
5. Subhash Khot
   Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:1025-1071 [Journal]
   
6. Ariel Gabizon, Ran Raz, Ronen Shaltiel
   Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:1072-1094 [Journal]
   
7. Boaz Barak, Russell Impagliazzo, Avi Wigderson
   Extracting Randomness Using Few Independent Sources. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:1095-1118 [Journal]
   
8. Andrej Bogdanov, Luca Trevisan
   On Worst-Case to Average-Case Reductions for NP Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:1119-1159 [Journal]
   
9. Salil P. Vadhan
   An Unconditional Study of Computational Zero Knowledge. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:4, pp:1160-1214 [Journal]
   
10. Amir Shpilka, Avi Wigderson
    Derandomizing Homomorphism Testing in General Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:1215-1230 [Journal]