Journals in DBLP

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

1. Oscar H. Ibarra, Brian S. Leininger
   Straight-Line Programs with One Input Variable. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:1-14 [Journal]
   
2. Oscar H. Ibarra, Brian S. Leininger
   The Complexity of the Equivalence Problem for Simple Loop-Free Programs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:15-27 [Journal]
   
3. J. H. Halton, Routo Terada
   A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:28-46 [Journal]
   
4. Arnon Rosenthal
   Dynamic Programming is Optimal for Nonserial Optimization Problems. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:47-59 [Journal]
   
5. Edward G. Coffman Jr., Micha Hofri
   On the Expected Performance of Scanning Disks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:60-70 [Journal]
   
6. Robert P. Burton, David R. Smith
   A Hidden-Line Algorithm for Hyperspace. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:71-80 [Journal]
   
7. John H. Reif, Robert Endre Tarjan
   Symbolic Program Analysis in Almost-Linear Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:81-93 [Journal]
   
8. Don Coppersmith, Douglas Stott Parker Jr., C. K. Wong
   Analysis of a General Mass Storage System. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:94-116 [Journal]
   
9. Harold N. Gabow, Oded Kariv
   Algorithms for Edge Coloring Bipartite Graphs and Multigraphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1982, v:11, n:1, pp:117-129 [Journal]
   
10. Martin Tompa
    Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:130-137 [Journal]
    
11. Lawrence T. Kou
    Minimum Variance Huffman Codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:138-148 [Journal]
    
12. Dan E. Willard
    Polygon Retrieval. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:149-165 [Journal]
    
13. Emily P. Friedman, Sheila A. Greibach
    A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:166-183 [Journal]
    
14. Per M. Jensen, Bernhard Korte
    Complexity of Matroid Property Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:184-190 [Journal]
    
15. Kellogg S. Booth, J. Howard Johnson
    Dominating Sets in Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:1, pp:191-199 [Journal]