Journals in DBLP

SIAM J. Comput.
1997, volume: 26, number: 1

1. Laurent Alonso, Edward M. Reingold, René Schott
   The Average-Case Complexity of Determining the Majority. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:1-14 [Journal]
   
2. Moshe Dubiner, Uri Zwick
   Amplification by Read-Once Formulas. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:15-38 [Journal]
   
3. Maurice Nivat, Andreas Podelski
   Minimal Ascending and Descending Tree Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:39-58 [Journal]
   
4. Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
   Threshold Computation and Cryptographic Security. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:59-78 [Journal]
   
5. Zhengyu Ge, S. Louis Hakimi
   Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:79-92 [Journal]
   
6. Endre Boros, Peter L. Hammer, Toshihide Ibaraki, Kazuhiko Kawakami
   Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:93-109 [Journal]
   
7. Avrim Blum, Prabhakar Raghavan, Baruch Schieber
   Navigating in Unfamiliar Geometric Terrain. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:110-137 [Journal]
   
8. Martin Beaudry, Pierre McKenzie, Pierre Péladeau, Denis Thérien
   Finite Moniods: From Word to Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:138-152 [Journal]
   
9. Louis Mak
   Parallelism Always Helps. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1997, v:26, n:1, pp:153-172 [Journal]
   
10. Zhen Liu, Eric Sanlaville
    Stochastic Scheduling with Variable Profile and Precedence Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:173-187 [Journal]
    
11. Richard Chang, William I. Gasarch, Carsten Lund
    On Bounded Queries and Approximation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:188-209 [Journal]
    
12. Martin Farach, Mikkel Thorup
    Sparse Dynamic Programming for Evolutionary-Tree Comparison. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:210-230 [Journal]
    
13. Ming-Yang Kao
    Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:231-242 [Journal]
    
14. Felipe Cucker, Dima Grigoriev
    On the Power of Real Turing Machines Over Binary Inputs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:243-254 [Journal]
    
15. David R. Karger, Rajeev Motwani
    An NC Algorithm for Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:255-272 [Journal]
    
16. Shlomi Dolev, Amos Israeli, Shlomo Moran
    Resource Bounds for Self-Stabilizing Message-Driven Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:273-290 [Journal]