Journals in DBLP

SIAM J. Comput.
1981, volume: 10, number: 1

1. Michael L. Fredman
   Lower Bounds on the Complexity of Some Optimal Data Structures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:1-10 [Journal]
   
2. Anna Lubiw
   Some NP-Complete Problems Similar to Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:11-21 [Journal]
   
3. Oscar H. Ibarra, Brian S. Leininger
   Characterizations of Presburger Functions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:22-39 [Journal]
   
4. Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir
   On ET0L Systems with Finite Tree-Rank. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:40-58 [Journal]
   
5. John H. Rowland, Philip J. Davis
   On the Selection of Test Data for Recursive Mathematical Subroutines. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:59-72 [Journal]
   
6. D. T. Lee, Robert L. (Scot) Drysdale III
   Generalization of Voronoi Diagrams in the Plane. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:73-87 [Journal]
   
7. Martin H. Ellis, J. Michael Steele
   Fast Sorting of Weyl Sequences Using Comparisons. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:88-95 [Journal]
   
8. Charles H. Bennett, John Gill
   Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:96-113 [Journal]
   
9. Neil D. Jones, Sven Skyum
   A Note on the Complexity of General D0L Membership. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1981, v:10, n:1, pp:114-117 [Journal]
   
10. Ken-Chih Liu
    On String Pattern Matching: A New Model with a Polynomial Time Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:118-140 [Journal]
    
11. Frank Ruskey
    Listing and Counting Subtrees of a Tree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:141-150 [Journal]
    
12. Manfred Kunde
    Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:151-173 [Journal]
    
13. Stefano Crespi-Reghizzi, Giovanni Guida, Dino Mandrioli
    Operator Precedence Grammars and the Noncounting Property. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:174-191 [Journal]
    
14. M. I. Dessouky, Jitender S. Deogun
    Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:192-202 [Journal]
    
15. Charles J. Colbourn, Kellogg S. Booth
    Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:1, pp:203-225 [Journal]