Journals in DBLP

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

1. Scott Diehl, Dieter van Melkebeek
   Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:563-594 [Journal]
   
2. Richard Beigel, Lance Fortnow, Frank Stephan
   Infinitely-Often Autoreducible Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:595-608 [Journal]
   
3. Aravind Srinivasan
   An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:609-634 [Journal]
   
4. Guantao Chen, Zhicheng Gao, Xingxing Yu, Wenan Zang
   Approximating Longest Cycles in Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:635-656 [Journal]
   
5. Amit Kumar, Jon M. Kleinberg
   Fairness Measures for Resource Allocation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:657-680 [Journal]
   
6. Timothy M. Chan
   Dynamic Subgraph Connectivity with Geometric Applications. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:681-694 [Journal]
   
7. Micha Sharir, Emo Welzl
   On the Number of Crossing-Free Matchings, Cycles, and Partitions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:695-720 [Journal]
   
8. Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink
   Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:721-739 [Journal]
   
9. Dimitris Achlioptas, Cristopher Moore
   Random k-SAT: Two Moments Suffice to Cross a Sharp Threshold. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2006, v:36, n:3, pp:740-762 [Journal]
   
10. Wim van Dam, Sean Hallgren, Lawrence Ip
    Quantum Algorithms for Some Hidden Shift Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:763-778 [Journal]
    
11. Tali Kaufman, Dana Ron
    Testing Polynomials over General Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:779-802 [Journal]
    
12. Shmuel Safra
    Exponential Determinization for omega-Automata with a Strong Fairness Acceptance Condition. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:803-814 [Journal]
    
13. Pankaj K. Agarwal, Mark H. Overmars, Micha Sharir
    Computing Maximally Separated Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:815-834 [Journal]
    
14. Tomasz Luczak, Jaroslav Nesetril
    A Probabilistic Approach to the Dichotomy Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:835-843 [Journal]