Journals in DBLP

SIAM J. Comput.
1982, volume: 11, number: 2

1. Michael R. Levy, T. S. E. Maibaum
   Continuous Data Types. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:201-216 [Journal]
   
2. Douglas Comer, Michael J. O'Donnell
   Geometric Problems with Application to Hashing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:217-226 [Journal]
   
3. Jia-Wei Hong, Arnold L. Rosenberg
   Graphs that are Almost Binary Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:227-242 [Journal]
   
4. James R. Bitner
   An Asymptotically Optimal Algorithm for the Dutch National Flag Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:243-262 [Journal]
   
5. Francesco Romani
   Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:263-267 [Journal]
   
6. John Keohane, John C. Cherniavsky, Peter B. Henderson
   On Transforming Control Structures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:268-286 [Journal]
   
7. Allan Borodin, Stephen A. Cook
   A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:287-297 [Journal]
   
8. Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
   The Recognition of Series Parallel Digraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:298-313 [Journal]
   
9. Joseph JáJá, Janos Simon
   Parallel Algorithms in Graph Theory: Planarity Testing. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:2, pp:314-328 [Journal]
   
10. David Lichtenstein
    Planar Formulae and Their Uses. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:329-343 [Journal]
    
11. Shlomo Moran
    On the Accepting Density Hierarchy in NP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:344-349 [Journal]
    
12. Leslie G. Valiant
    A Scheme for Fast Parallel Communication. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:350-361 [Journal]
    
13. T. C. Hu, M. T. Shing
    Computation of Matrix Chain Products. Part I. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:362-373 [Journal]
    
14. Daniel J. Lehmann
    On Primality Tests. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:374-375 [Journal]
    
15. Robert Sedgewick, Thomas G. Szymanski, Andrew Chi-Chih Yao
    The Complexity of Finding Cycles in Periodic Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:376-390 [Journal]
    
16. Mihalis Yannakakis
    Freedom from Deadlock of Safe Locking Policies. [Citation Graph (6, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:391-408 [Journal]