Journals in DBLP

SIAM J. Comput.
2001, volume: 31, number: 3

1. Moses Charikar, Samir Khuller, Balaji Raghavachari
   Algorithms for Capacitated Vehicle Routing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:665-682 [Journal]
   
2. Conrado Martínez, Salvador Roura
   Optimal Sampling Strategies in Quicksort and Quickselect. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:683-705 [Journal]
   
3. Cyril Gavoille, David Peleg
   The Compactness of Interval Routing for Almost All Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:706-721 [Journal]
   
4. Amir M. Ben-Amram, Zvi Galil
   Topological Lower Bounds on Algebraic Random Access Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:722-761 [Journal]
   
5. J. Ian Munro, Venkatesh Raman
   Succinct Representation of Balanced Parentheses and Static Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:762-776 [Journal]
   
6. Denis Thérien, Thomas Wilke
   Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:777-798 [Journal]
   
7. Cristopher Moore, Martin Nilsson
   Parallel Quantum Computation and Quantum Codes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:799-815 [Journal]
   
8. Eli Gafni, Michael Mitzenmacher
   Analysis of Timing-Based Mutual Exclusion with Random Times. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:816-837 [Journal]
   
9. Joseph Y. Halpern, Yoram Moses, Orli Waarts
   A Characterization of Eventual Byzantine Agreement. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2001, v:31, n:3, pp:838-865 [Journal]
   
10. Amit Chakrabarti, Subhash Khot, Yaoyun Shi
    Evasiveness of Subgraph Containment and Related Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:866-875 [Journal]
    
11. Harry Buhrman, Luc Longpré
    Compressibility and Resource Bounded Measure. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:876-886 [Journal]
    
12. Harry Buhrman, Lance Fortnow, Sophie Laplante
    Resource-Bounded Kolmogorov Complexity Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:887-905 [Journal]
    
13. Aduri Pavan, Alan L. Selman
    Separation of NP-Completeness Notions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:906-918 [Journal]
    
14. Stavros G. Kolliopoulos, Clifford Stein
    Approximation Algorithms for Single-Source Unsplittable Flow. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:919-946 [Journal]
    
15. Michele Boreale, Rocco De Nicola, Rosario Pugliese
    Proof Techniques for Cryptographic Processes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:947-986 [Journal]
    
16. J. H. Rieger
    Corrigendum: Proximity in Arrangements of Algebraic Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:3, pp:987- [Journal]