Journals in DBLP

SIAM J. Comput.
1980, volume: 9, number: 3

1. Hartmut Ehrig, Barry K. Rosen
   The Mathematics of Record Handling. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:441-469 [Journal]
   
2. Douglas Stott Parker Jr.
   Conditions for Optimality of the Huffman Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:470-489 [Journal]
   
3. Arnold Schönhage
   Storage Modification Machines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:490-508 [Journal]
   
4. Wojciech Rytter
   A Correct Preprocessing Algorithm for Boyer-Moore String-Searching. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:509-512 [Journal]
   
5. John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
   The Pebbling Problem is Complete in Polynomial Space. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:513-524 [Journal]
   
6. Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright
   Vector Iteration in Pointed Iterative Theories. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:525-540 [Journal]
   
7. Jeffrey M. Jaffe
   Bounds on the Scheduling of Typed Task Systems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:541-551 [Journal]
   
8. Bruce W. Weide
   Random Graphs and Graph Optimization Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:552-557 [Journal]
   
9. Eugene L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan
   Generating all Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:3, pp:558-565 [Journal]
   
10. Andrew Chi-Chih Yao
    Bounds on Selection Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:566-582 [Journal]
    
11. Alan George, Joseph W. H. Liu
    An Optimal Algorithm for Symbolic Factorization of Symmetric Matrices. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:583-593 [Journal]
    
12. Mark R. Brown, Robert Endre Tarjan
    Design and Analysis of a Data Structure for Representing Sorted Lists. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:594-614 [Journal]
    
13. Richard J. Lipton, Robert Endre Tarjan
    Applications of a Planar Separator Theorem. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:615-627 [Journal]
    
14. László Babai, Paul Erdös, Stanley M. Selkow
    Random Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:628-635 [Journal]
    
15. Stephen A. Cook, Charles Rackoff
    Space Lower Bounds for Maze Threadability on Restricted Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:636-652 [Journal]
    
16. Kuo-Chung Tai
    Predictors of Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:653-664 [Journal]