Journals in DBLP

SIAM J. Comput.
1991, volume: 20, number: 1

1. Dominique Duval
   Absolute Factorization of Polynomials: A Geometric Approach. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:1-21 [Journal]
   
2. Uzi Vishkin
   Deterministic Sampling - A New Technique for Fast Pattern Matching. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:22-40 [Journal]
   
3. Qian-Ping Gu, Akira Maruoka
   Amplification of Bounded Depth Monotone Read-Once Boolean Formulae. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:41-55 [Journal]
   
4. Alejandro A. Schäffer, Mihalis Yannakakis
   Simple Local Search Problems That are Hard to Solve. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:56-87 [Journal]
   
5. Ian Parberry, Pei Yuan Yan
   Improved Upper and Lower Time Bounds for Parallel Random Access Machines Without Simultaneous Writes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:88-99 [Journal]
   
6. Jeffrey D. Ullman, Mihalis Yannakakis
   High-Probability Parallel Transitive-Closure Algorithms. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:100-125 [Journal]
   
7. Shih Ping Tung
   Complexity of Sentences Over Number Rings. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:126-143 [Journal]
   
8. Marek Chrobak, Lawrence L. Larmore
   An Optimal On-Line Algorithm for k-Servers on Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:144-148 [Journal]
   
9. Klaus Sutner, Appajosyula Satyanarayana, Charles L. Suffel
   The Complexity of the Residual Node Connectedness Reliability Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:1, pp:149-155 [Journal]
   
10. Edward M. Reingold, Xiaojun Shen
    More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:156-183 [Journal]
    
11. Edward M. Reingold, Xiaojun Shen
    More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:184-208 [Journal]