Journals in DBLP

SIAM J. Comput.
2007, volume: 36, number: 5

1. Jesse Kamp, David Zuckerman
   Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1231-1247 [Journal]
   
2. Mikhail Alekhnovich, Eli Ben-Sasson
   Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1248-1263 [Journal]
   
3. Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, Klaus W. Wagner
   The Complexity of Computing the Size of an Interval. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1264-1300 [Journal]
   
4. Dan Boneh, Ran Canetti, Shai Halevi, Jonathan Katz
   Chosen-Ciphertext Security from Identity-Based Encryption. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1301-1328 [Journal]
   
5. Yoko Kamidoi, Noriyoshi Yoshida, Hiroshi Nagamochi
   A Deterministic Algorithm for Finding All Minimum k-Way Cuts. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1329-1341 [Journal]
   
6. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
   Online Conflict-Free Coloring for Intervals. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
   
7. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg
   Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1360-1375 [Journal]
   
8. Julia Chuzhoy, Joseph Naor
   The Hardness of Metric Labeling. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1376-1386 [Journal]
   
9. Emanuele Viola
   Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2007, v:36, n:5, pp:1387-1403 [Journal]
   
10. Zeev Dvir, Amir Shpilka
    Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1404-1434 [Journal]
    
11. Alan Frieze, Gregory B. Sorkin
    The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1435-1452 [Journal]
    
12. Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski
    The Wake-Up Problem in MultiHop Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1453-1471 [Journal]
    
13. Hartmut Klauck, Robert Spalek, Ronald de Wolf
    Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1472-1493 [Journal]
    
14. Eran Halperin, Guy Kortsarz, Robert Krauthgamer, Aravind Srinivasan, Nan Wang
    Integrality Ratio for Group Steiner Trees and Directed Steiner Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1494-1511 [Journal]