Journals in DBLP

SIAM J. Comput.
1983, volume: 12, number: 1

1. Volker Strassen
   The Computational Complexity of Continued Fractions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:1-27 [Journal]
   
2. David G. Kirkpatrick
   Optimal Search in Planar Subdivisions. [Citation Graph (3, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:28-35 [Journal]
   
3. Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis
   Tools for Template Dependencies. [Citation Graph (8, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:36-59 [Journal]
   
4. Donald K. Friesen, Michael A. Langston
   Bounds for Multifit Scheduling on Uniform Processors. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:60-70 [Journal]
   
5. John H. Reif
   Minimum s-t Cut of a Planar Undirected Network in O(n log²(n)) Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:71-81 [Journal]
   
6. Gerald E. Peterson
   A Technique for Establishing Completeness Results in Theorem Proving with Equality. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:82-100 [Journal]
   
7. Hans F. de Groote
   Characterization of Division Algebras of Minimal Rank and the Structure of Their Algorithm Varieties. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:101-117 [Journal]
   
8. Kenneth J. Supowit, Edward M. Reingold
   Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:118-143 [Journal]
   
9. Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted
   The Traveling Salesman Problem and Minimum Matching in the Unit Square. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1983, v:12, n:1, pp:144-156 [Journal]
   
10. Dan Gusfield
    Simple Construction for Multi-Terminal Network Flow Synthesis. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:157-165 [Journal]
    
11. Arthur C. Fleck, R. S. Limaye
    Formal Semantics and Abstract Properties of String Pattern Operations and Extended Formal Language Description Mechanisms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:166-188 [Journal]
    
12. John V. Guttag, Deepak Kapur, David R. Musser
    On Proving Uniform Termination and Restricted Termination of Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:189-214 [Journal]