Journals in DBLP

SIAM J. Comput.
2004, volume: 33, number: 4

1. Boaz Barak, Yehuda Lindell
   Strict Polynomial-Time in Simulation and Extraction. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:738-818 [Journal]
   
2. Narayan Vikas
   Compaction, Retraction, and Constraint Satisfaction. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:761-782 [Journal]
   
3. Jesús A. De Loera, Shmuel Onn
   The Complexity of Three-Way Statistical Tables. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:819-836 [Journal]
   
4. Chandra Chekuri, Sanjeev Khanna
   On Multidimensional Packing Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:837-851 [Journal]
   
5. N. V. Vinodchandran
   Counting Complexity of Solvable Black-Box Group Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:852-869 [Journal]
   
6. Dariusz R. Kowalski, Andrzej Pelc
   Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:870-891 [Journal]
   
7. Jörg Flum, Martin Grohe
   The Parameterized Complexity of Counting Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:892-922 [Journal]
   
8. Luc Devroye, Pat Morin, Alfredo Viola
   On Worst-Case Robin Hood Hashing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:923-936 [Journal]
   
9. Prosenjit Bose, Pat Morin
   Online Routing in Triangulations. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2004, v:33, n:4, pp:937-951 [Journal]
   
10. Werner Schachinger
    Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:952-983 [Journal]
    
11. Jin-yi Cai, Osamu Watanabe
    On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:4, pp:984-1009 [Journal]