Journals in DBLP

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

1. Elefterios A. Melissaratos, Diane L. Souvaine
   Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:601-638 [Journal]
   
2. Frank Thomson Leighton, Mark Newman, Abhiram G. Ranade, Eric J. Schwabe
   Dynamic Tree Embeddings in Butterflies and Hypercubes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:639-654 [Journal]
   
3. H. Venkateswaran
   Circuit Definitions of Nondeterministic Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:655-670 [Journal]
   
4. Bernard Chazelle
   An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:671-696 [Journal]
   
5. Ming Li, Luc Longpré, Paul M. B. Vitányi
   The Power of the Queue. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:697-712 [Journal]
   
6. David Aldous, Micha Hofri, Wojciech Szpankowski
   Maximum Size of a Dynamic Data Structure: Hashing with Lazy Deletion Revisited. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:713-732 [Journal]
   
7. K. Ganesan, Steven Homer
   Complete Problems and Strong Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:733-742 [Journal]
   
8. Richard Chang
   On the Structure of Bounded Queries to Arbitrary NP Sets. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:743-754 [Journal]
   
9. Samuel R. Buss, S. Cook, A. Gupta, V. Ramachandran
   An Optimal Parallel Algorithm for Formula Evaluation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1992, v:21, n:4, pp:755-780 [Journal]
   
10. Dario Bini, Luca Gemignani
    On the Complexity of Polynomial Zeros. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:4, pp:781-799 [Journal]