Journals in DBLP

SIAM J. Comput.
2002, volume: 31, number: 6

1. Alexander Russell, Michael E. Saks, David Zuckerman
   Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1645-1662 [Journal]
   
2. Venkatesan Guruswami, Johan Håstad, Madhu Sudan
   Hardness of Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1663-1686 [Journal]
   
3. Hsien-Kuei Hwang, Ralph Neininger
   Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1687-1722 [Journal]
   
4. Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh
   Are Bitvectors Optimal? [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1723-1744 [Journal]
   
5. János Pach, Gábor Tardos
   On the Boundary Complexity of the Union of Fat Triangles. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1745-1760 [Journal]
   
6. Richard Cole, Ramesh Hariharan
   Approximate String Matching: A Simpler Faster Algorithm. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1761-1782 [Journal]
   
7. Jochen Könemann, R. Ravi
   A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1783-1793 [Journal]
   
8. Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev Motwani
   Maintaining Stream Statistics over Sliding Windows. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1794-1813 [Journal]
   
9. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
   Curvature-Constrained Shortest Paths in a Convex Polygon. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2002, v:31, n:6, pp:1814-1851 [Journal]
   
10. Yijie Han, Xiaojun Shen
    Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1852-1878 [Journal]
    
11. Seth Pettie, Vijaya Ramachandran
    A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1879-1895 [Journal]
    
12. Martin Kutz
    Lower Bounds for Lucas Chains. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1896-1908 [Journal]
    
13. Nader H. Bshouty, Yishay Mansour
    Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1909-1925 [Journal]
    
14. Hanno Lefmann, Niels Schmitt
    A Deterministic Polynomial-Time Algorithm for Heilbronn's Problem in Three Dimensions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1926-1947 [Journal]
    
15. Edith Hemaspaandra, Gerd Wechsung
    The Minimization Problem for Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:6, pp:1948-1958 [Journal]