Journals in DBLP

SIAM J. Comput.
1992, volume: 21, number: 6

1. Ding-Zhu Du, Frank K. Hwang
   Reducing the Steiner Problem in a Normed Space. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1001-1007 [Journal]
   
2. James Renegar
   On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae. [Citation Graph (1, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1008-1025 [Journal]
   
3. Wei Kuan Shih, T. C. Chern, Wen-Lian Hsu
   An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1026-1046 [Journal]
   
4. Zvi Galil, Giuseppe F. Italiano
   Fully Dynamic Algorithms for 2-Edge Connectivity. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1047-1069 [Journal]
   
5. Charles U. Martel, Arvin Park, Ramesh Subramonian
   Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1070-1099 [Journal]
   
6. Jie Wang
   Polynomial Time Productivity, Approximations, and Levelability. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1100-1111 [Journal]
   
7. Wolfgang W. Bein, Jerzy Kamburowski, Matthias F. M. Stallmann
   Optimal Reductions of Two-Terminal Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1112-1129 [Journal]
   
8. Greg N. Frederickson, D. J. Guan
   Preemptive Ensemble Motion Planning on a Tree. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1130-1152 [Journal]
   
9. Martin Tompa
   Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:6, pp:1153-1160 [Journal]
   
10. Stephen Bellantoni, Toniann Pitassi, Alasdair Urquhart
    Approximation and Small-Depth Frege Proofs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1161-1179 [Journal]
    
11. Helmut Prodinger
    External Internal Nodes in Digital Search Trees via Mellin Transforms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1180-1183 [Journal]
    
12. Brandon Dixon, Monika Rauch, Robert Endre Tarjan
    Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1184-1192 [Journal]
    
13. Mohammad Amin Shokrollahi
    Optimal Algorithms for Multiplication in Certain Finite Fields Using Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:6, pp:1193-1198 [Journal]