Journals in DBLP

SIAM J. Comput.
1988, volume: 17, number: 6

1. Thomas Lengauer, Egon Wanke
   Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1063-1080 [Journal]
   
2. Michael Ben-Or, Ephraim Feig, Dexter Kozen, Prasoon Tiwari
   A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1081-1092 [Journal]
   
3. Kurt Mehlhorn, Stefan Näher, Helmut Alt
   A Lower Bound on the Complexity of the Union-Split-Find Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1093-1102 [Journal]
   
4. Robert J. T. Morris, Wing Shing Wong
   A Short-Term Neural Network Memory. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1103-1118 [Journal]
   
5. Béla Bollobás, Graham Brightwell
   Transitive Orientations of Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1119-1133 [Journal]
   
6. Jan A. Bergstra, Jan Willem Klop, Ernst-Rüdiger Olderog
   Readies and Failures in the Algebra of Communicating Processes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1134-1177 [Journal]
   
7. Noga Alon, Yossi Azar
   The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1178-1192 [Journal]
   
8. Eric Allender, Roy S. Rubinstein
   P-Printable Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1193-1202 [Journal]
   
9. William J. Knight
   Search in an Ordered Array Having Variable Probe Cost. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1988, v:17, n:6, pp:1203-1214 [Journal]
   
10. T. Yung Kong, David M. Mount, A. W. Roscoe
    The Decomposition of a Rectangle into Rectangles of Minimal Perimeter. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1215-1231 [Journal]
    
11. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
    The Boolean Hierarchy I: Structural Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1232-1252 [Journal]
    
12. Baruch Schieber, Uzi Vishkin
    On Finding Lowest Common Ancestors: Simplification and Parallelization. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1253-1262 [Journal]
    
13. Jim Kadin
    The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1263-1282 [Journal]