Journals in DBLP

SIAM J. Comput.
1991, volume: 20, number: 5

1. Claire Kenyon-Mathieu, Jeffrey Scott Vitter
   The Maximum Size of Dynamic Data Structures. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:807-823 [Journal]
   
2. Miroslaw Kutylowski
   Time Complexity of Boolean Functions on CREW PRAMs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:824-833 [Journal]
   
3. Mee Yee Chan
   Embedding of Grids into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:834-864 [Journal]
   
4. Seinosuke Toda
   PP is as Hard as the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:865-877 [Journal]
   
5. Nicholas Pippenger
   Selection Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:878-887 [Journal]
   
6. Subir Kumar Ghosh, David M. Mount
   An Output-Sensitive Algorithm for Computing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:888-910 [Journal]
   
7. Ming Li, Paul M. B. Vitányi
   Learning Simple Concept Under Simple Distributions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:911-935 [Journal]
   
8. Zhi-Quan Luo, John N. Tsitsiklis
   On the Communication Complexity of Solving a Polynomial Equation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:936-950 [Journal]
   
9. Joel Friedman
   The Spectra of Infinite Hypertrees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:5, pp:951-961 [Journal]
   
10. Ker-I Ko
    On the Complexity of Learning Minimum Time-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:962-986 [Journal]
    
11. Jan-Ming Ho, D. T. Lee, Chia-Hsiang Chang, C. K. Wong
    Minimum Diameter Spanning Trees and Related Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:987-997 [Journal]
    
12. Susan Landau
    Erratum: Factoring Polynomials Over Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:5, pp:998- [Journal]