Journals in DBLP

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

1. Egon Balas, Jue Xue
   Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:209-221 [Journal]
   
2. Jirí Matousek
   Approximate Levels in Line Arrangements. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:222-227 [Journal]
   
3. Joseph JáJá, Shing-Chong Chang
   Parallel Algorithms for Channel Routing in the Knock-Knee Model. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:228-245 [Journal]
   
4. Ronald V. Book
   Some Observations on Separating Complexity Classes. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:246-258 [Journal]
   
5. Herbert Edelsbrunner, Weiping Shi
   An O(n log² h) Time Algorithm for the Three-Dimensional Convex Hull Problem. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:259-269 [Journal]
   
6. Paul Beame
   A General Sequential Time-Space Tradeoff for Finding Unique Elements. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:270-277 [Journal]
   
7. Oscar H. Ibarra, Tao Jiang
   The Power of Alternating One-Reversal Counters and Stacks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:278-290 [Journal]
   
8. Ron M. Roth, Gyora M. Benedek
   Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2). [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:291-314 [Journal]
   
9. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
   Lower Bounds for Computations with the Floor Operation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1991, v:20, n:2, pp:315-327 [Journal]
   
10. B. K. Natarajan
    Probably Approximate Learning of Sets and Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:328-351 [Journal]
    
11. Samir Khuller, Baruch Schieber
    Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:352-375 [Journal]
    
12. Yehuda Afek, Eli Gafni
    Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:376-394 [Journal]
    
13. Peter Gritzmann, Laurent Habsieger, Victor Klee
    Good and Bad Radii of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:395-403 [Journal]
    
14. Jim Kadin
    Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:404- [Journal]