Journals in DBLP

SIAM J. Comput.
2002, volume: 31, number: 5

1. Vasek Chvátal, Jean Fonlupt, L. Sun, A. Zemirline
   Recognizing Dart-Free Perfect Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1315-1338 [Journal]
   
2. Yunhong Zhou, Subhash Suri
   Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1339-1357 [Journal]
   
3. Rocco A. Servedio
   Perceptron, Winnow, and PAC Learning. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1358-1369 [Journal]
   
4. Baruch Awerbuch, Yossi Azar, Stefano Leonardi, Oded Regev
   Minimizing the Flow Time Without Migration. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1370-1382 [Journal]
   
5. Moni Naor, Omer Reingold, Alon Rosen
   Pseudorandom Functions and Factoring. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1383-1404 [Journal]
   
6. Ralf Hiptmair, Jörg Ostrowski
   Generators of $H_1(\Gamma_{h}, \mathbbZ)$ for Triangulated Surfaces: Construction and Classification. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1405-1423 [Journal]
   
7. Anna Gál, Adi Rosén
   A Theorem on Sensitivity and Applications in Private Computation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1424-1437 [Journal]
   
8. Francesco M. Malvestuto, Mauro Mezzini
   A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1438-1455 [Journal]
   
9. Alex Brodsky, Nicholas Pippenger
   Characterizations of 1-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:5, pp:1456-1478 [Journal]
   
10. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
    Fast Greedy Algorithms for Constructing Sparse Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1479-1500 [Journal]
    
11. Adam Klivans, Dieter van Melkebeek
    Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1501-1526 [Journal]
    
12. Martin E. Dyer, Alan M. Frieze, Mark Jerrum
    On Counting Independent Sets in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1527-1541 [Journal]
    
13. Dieter Spreen
    Safe Weak Minimization Revisited. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1542-1556 [Journal]
    
14. Ilan Newman
    Testing Membership in Languages that Have Small Width Branching Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1557-1570 [Journal]
    
15. Alain J. Mayer, Rafail Ostrovsky, Yoram Ofek, Moti Yung
    Self-Stabilizing Symmetry Breaking in Constant Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1571-1595 [Journal]
    
16. Tomás Feder, Rajeev Motwani, Carlos S. Subi
    Approximating the Longest Cycle Problem in Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1596-1607 [Journal]
    
17. Eran Halperin
    Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1608-1623 [Journal]
    
18. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
    Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:5, pp:1624-1643 [Journal]