Journals in DBLP

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

1. Alan C. Tucker
   An Efficient Test for Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:1-24 [Journal]
   
2. Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright
   Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:25-45 [Journal]
   
3. Chandra M. R. Kintala, Patrick C. Fischer
   Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:46-53 [Journal]
   
4. Richard P. Brent, J. F. Traub
   On the Complexity of Composition and Generalized Composition of Power Series. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:54-66 [Journal]
   
5. Matthew Hennessy
   The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:67-84 [Journal]
   
6. Paul K. Stockmeyer, F. Frances Yao
   On the Optimality of Linear Merge. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:85-90 [Journal]
   
7. Yookun Cho, Sartaj Sahni
   Bounds for List Schedules on Uniform Processors. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:91-103 [Journal]
   
8. Richard Statman
   Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:104-110 [Journal]
   
9. C. K. Wong, Malcolm C. Easton
   An Efficient Method for Weighted Sampling Without Replacement. [Citation Graph (5, 0)][DBLP]
   SIAM J. Comput., 1980, v:9, n:1, pp:111-113 [Journal]
   
10. Juris Hartmanis
    On the Succinctness of Different Representations of Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:114-120 [Journal]
    
11. David P. Dobkin, Richard J. Lipton
    Addition Chain Methods for the Evaluation of Specific Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:121-125 [Journal]
    
12. Daniel S. Hirschberg
    On the Complexity of Searching a Set of Vectors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:126-129 [Journal]
    
13. J. T. Joichi, Dennis E. White, S. G. Williamson
    Combinatorial Gray codes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:130-141 [Journal]
    
14. Philippe Flajolet, Lyle Ramshaw
    A Note on Gray Code and Odd-Even Merge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:142-158 [Journal]
    
15. Barry K. Rosen
    Monoids for Rapid Data Flow Analysis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:159-196 [Journal]
    
16. Zvi Galil
    Finding the Vertex Connectivity of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:197-199 [Journal]
    
17. D. T. Lee, C. K. Wong
    Voronoi Diagrams in L_1 (L_infty) Metrics with 2-Dimensional Storage Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:200-211 [Journal]
    
18. László Babai
    On the Complexity of Canonical Labeling of Strongly Regular Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:212-216 [Journal]
    
19. Eric C. R. Hehner, R. Nigel Horspool
    Corrigendum: A New Representation of the Rational Numbers for Fast Easy Arithmetic. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:217- [Journal]