Journals in DBLP

SIAM J. Comput.
1992, volume: 21, number: 3

1. Zvi Galil, Raffaele Giancarlo
   On the Exact Complexity of String Matching: Upper Bounds. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:407-437 [Journal]
   
2. B. K. Natarajan
   Probably Approximate Learning Over Classes of Distributions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:438-449 [Journal]
   
3. Christos H. Papadimitriou
   The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:450-465 [Journal]
   
4. John H. Reif, Sandeep Sen
   Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:466-485 [Journal]
   
5. Samir Khuller, Stephen G. Mitchell, Vijay V. Vazirani
   Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:486-506 [Journal]
   
6. R. W. Gatterdam
   Algorithms for Splicing Systems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:507-520 [Journal]
   
7. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
   Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:521-539 [Journal]
   
8. Pankaj K. Agarwal
   Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:540-570 [Journal]
   
9. Jarkko Kari
   The Nilpotency Problem of One-Dimensional Cellular Automata. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:3, pp:571-586 [Journal]
   
10. Qian-Ping Gu, Akira Maruoka
    Learning Monotone Boolean Functions by Uniformly Distributed Examples. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:587-599 [Journal]