Journals in DBLP

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

1. Yoram Moses, Sergio Rajsbaum
   A Layered Analysis of Consensus. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:989-1021 [Journal]
   
2. Eduardo Sany Laber, Ruy Luiz Milidiú, Artur Alves Pessoa
   On Binary Searching with Nonuniform Costs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1022-1047 [Journal]
   
3. Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
   The Efficiency of Resolution and Davis--Putnam Procedures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1048-1075 [Journal]
   
4. Christoph Dürr, Miklos Santha
   A Decision Procedure for Unitary Linear Quantum Cellular Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1076-1089 [Journal]
   
5. Uriel Feige, Robert Krauthgamer
   A Polylogarithmic Approximation of the Minimum Bisection. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1090-1118 [Journal]
   
6. Wolfgang Merkle
   Lattice Embeddings for Abstract Bounded Reducibilities. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1119-1155 [Journal]
   
7. Alfons Geser
   Decidability of Termination of Grid String Rewriting Rules. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1156-1168 [Journal]
   
8. Rodney G. Downey, Denis R. Hirschfeldt, André Nies
   Randomness, Computability, and Density. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1169-1183 [Journal]
   
9. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
   Space Complexity in Propositional Calculus. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:4, pp:1184-1211 [Journal]
   
10. Thorsten Theobald
    An Enumerative Geometry Framework for Algorithmic Line Problems in $\mathbb R^3$. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1212-1228 [Journal]
    
11. Leslie G. Valiant
    Quantum Circuits That Can Be Simulated Classically in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1229-1254 [Journal]
    
12. Zhi-Zhong Chen, Xin He, Chun-Hsi Huang
    Finding Double Euler Trails of Planar Graphs in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1255-1285 [Journal]
    
13. Hagit Attiya, Sergio Rajsbaum
    The Combinatorial Structure of Wait-Free Solvable Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1286-1313 [Journal]