Journals in DBLP

SIAM J. Comput.
2005, volume: 35, number: 1

1. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
   Some 3CNF Properties Are Hard to Test. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:1-21 [Journal]
   
2. Michael Lindenbaum, Hanan Samet, Gísli R. Hjaltason
   A Probabilistic Analysis of Trie-Based Sorting of Large Collections of Line Segments in Spatial Databases. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:22-58 [Journal]
   
3. Dieter van Melkebeek, Rahul Santhanam
   Holographic Proofs and Derandmization. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:59-90 [Journal]
   
4. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
   Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal]
   
5. Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel
   Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:110-119 [Journal]
   
6. Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, David Peleg
   Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:120-131 [Journal]
   
7. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld
   The Complexity of Approximating the Entropy. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:132-150 [Journal]
   
8. Jie Gao, Li Zhang
   Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and Its Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:151-169 [Journal]
   
9. Greg Kuperberg
   A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2005, v:35, n:1, pp:170-188 [Journal]
   
10. Refael Hassin, Asaf Levin
    A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:189-200 [Journal]
    
11. Kazuyuki Amano, Akira Maruoka
    A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:201-216 [Journal]
    
12. Rosario Gennaro, Yael Gertner, Jonathan Katz, Luca Trevisan
    Bounds on the Efficiency of Generic Cryptographic Constructions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:217-246 [Journal]
    
13. Guy Kortsarz, Zeev Nutov
    Approximating k-node Connected Subgraphs via Critical Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:247-257 [Journal]