Journals in DBLP

SIAM J. Comput.
1984, volume: 13, number: 2

1. Pavol Duris, Zvi Galil
   Two Tapes are Better than One for Nondeterministic Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:219-227 [Journal]
   
2. T. C. Hu, M. T. Shing
   Computation of Matrix Chain Products. Part II. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:228-251 [Journal]
   
3. J. M. Robson
   N by N Checkers is Exptime Complete. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:252-267 [Journal]
   
4. Dario Bini
   Parallel Solution of Certain Toeplitz Linear Systems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:268-276 [Journal]
   
5. Greg N. Frederickson
   Self-Organizing Heuristics for Implicit Data Structures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:277-291 [Journal]
   
6. Micha Sharir, Amir Pnueli, Sergiu Hart
   Verification of Probabilistic Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:292-314 [Journal]
   
7. Sunita Agarwal, A. K. Mittal, P. Sharma
   Constrained Optimum Communication Trees and Sensitivity Analysis. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:315-328 [Journal]
   
8. Uwe Schöning, Ronald V. Book
   Immunity, Relativizations, and Nondeterminism. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:329-337 [Journal]
   
9. Dov Harel, Robert Endre Tarjan
   Fast Algorithms for Finding Nearest Common Ancestors. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1984, v:13, n:2, pp:338-355 [Journal]
   
10. Etienne Grandjean
    The Spectra of First-Order Sentences and Computational Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:356-373 [Journal]
    
11. Robert Cartwright
    Recursive Programs as Definitions in First Order Logic. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:374-408 [Journal]
    
12. Larry J. Stockmeyer, Uzi Vishkin
    Simulation of Parallel Random Access Machines by Circuits. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:409-422 [Journal]
    
13. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    Constant Depth Reducibility. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:423-439 [Journal]