Journals in DBLP

SIAM J. Comput.
2000, volume: 29, number: 5

1. Jean-Daniel Boissonnat, Franco P. Preparata
   Robust Plane Sweep for Intersecting Segments. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1401-1421 [Journal]
   
2. Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
   Binary Space Partitions for Fat Rectangles. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1422-1448 [Journal]
   
3. Michael E. Saks, Fotios Zaharoglou
   Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1449-1483 [Journal]
   
4. Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross
   An Optimal Algorithm for Monte Carlo Estimation. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1484-1496 [Journal]
   
5. Harry Buhrman, Lance Fortnow, Dieter van Melkebeek, Leen Torenvliet
   Separating Complexity Classes Using Autoreducibility. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1497-1520 [Journal]
   
6. Johannes A. La Poutré
   Maintenance of 2- and 3-Edge-Connected Components of Graphs II. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1521-1549 [Journal]
   
7. Millist W. Vincent, Mark Levene
   Restructuring Partitioned Normal Form Relations without Information Loss. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1550-1567 [Journal]
   
8. Ming-Yang Kao, Jie Wang
   Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1568-1576 [Journal]
   
9. Jürgen Sellen, Joonsoo Choi, Chee-Keng Yap
   Precision-Sensitive Euclidean Shortest Path in 3-Space. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 2000, v:29, n:5, pp:1577-1595 [Journal]
   
10. Oren Etzioni, Steve Hanks, Tao Jiang, Omid Madani
    Optimal Information Gathering on the Internet with Time and Cost Constraints. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1596-1620 [Journal]
    
11. Ladislav Stacho, Imrich Vrto
    Virtual Path Layouts in ATM Networks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1621-1629 [Journal]
    
12. Funda Ergün, Ravi Kumar, D. Sivakumar
    Self-Testing without the Generator Bottleneck. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1630-1651 [Journal]
    
13. Michael Benedikt, Leonid Libkin
    Safe Constraint Queries. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1652-1682 [Journal]
    
14. Sanjeev Khanna, Vincenzo Liberatore
    On Broadcast Disk Paging. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1683-1702 [Journal]
    
15. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Contention Resolution in Hashing Based Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1703-1739 [Journal]
    
16. Dorit Dor, Shay Halperin, Uri Zwick
    All-Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1740-1759 [Journal]