Journals in DBLP

SIAM J. Comput.
1977, volume: 6, number: 1

1. Derek A. Zave
   Optimal Polyphase Sorting. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:1-39 [Journal]
   
2. Donald L. Adolphson
   Single Machine Job Sequencing with Precedence Constraints. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:40-54 [Journal]
   
3. Arnie Rosenthal, Anita Goldner
   Smallest Augmentations to Biconnect a Graph. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:55-66 [Journal]
   
4. Lawrence T. Kou
   Polynomial Complete Consecutive Information Retrieval Problems. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:67-75 [Journal]
   
5. Christos H. Papadimitriou, Kenneth Steiglitz
   On the Complexity of Local Search for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:76-83 [Journal]
   
6. Robert Solovay, Volker Strassen
   A Fast Monte-Carlo Test for Primality. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:84-85 [Journal]
   
7. K. Aoshima, Masao Iri
   Comments on F. Hadlock's Paper: ``Finding a Maximum Cut of a Planar Graph in Polynomial Time''. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:86-87 [Journal]
   
8. Peter B. Henderson, Yechezkel Zalcstein
   A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing Primitives. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:88-108 [Journal]
   
9. Thomas G. Szymanski, Jeffrey D. Ullman
   Evaluating Relational Expressions with Dense and Sparse Arguments. [Citation Graph (2, 0)][DBLP]
   SIAM J. Comput., 1977, v:6, n:1, pp:109-122 [Journal]
   
10. Seymour Ginsburg, Nancy A. Lynch
    Derivation Complexity in Context-Free Grammar Forms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:123-138 [Journal]
    
11. Harold N. Gabow
    Two Algorithms for Generating Weighted Spanning Trees in Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:139-150 [Journal]
    
12. Sukhamay Kundu, Jayadev Misra
    A Linear Tree Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:151-154 [Journal]
    
13. Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni
    Bounds for LPT Schedules on Uniform Processors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:155-166 [Journal]
    
14. Dennis G. Kafura, V. Y. Shen
    Task Scheduling on a Multiprocessor System with Independent Memories. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:167-187 [Journal]
    
15. David G. Kirkpatrick, Zvi M. Kedem
    Adequate Requirements for Rational Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:188-199 [Journal]
    
16. Edward A. Ashcroft, William W. Wadge
    Erratum: Lucid - A Formal System for Writing and Proving Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:200- [Journal]