Journals in DBLP

SIAM J. Comput.
1998, volume: 28, number: 2

1. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
   A Downward Collapse within the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:383-393 [Journal]
   
2. Yongge Wang
   Genericity, Randomness, and Polynomial-Time Approximations. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:394-408 [Journal]
   
3. Luc Devroye
   Universal Limit Laws for Depths in Random Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:409-432 [Journal]
   
4. William S. Evans, Nicholas Pippenger
   Average-Case Lower Bounds for Noisy Boolean Decision Trees. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:433-446 [Journal]
   
5. Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan
   Competitive Algorithms for Layered Graph Traversal. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:447-462 [Journal]
   
6. Ding-Zhu Du, Biao Gao, Frank K. Hwang, J. H. Kim
   On Multirate Rearrangeable Clos Networks. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:463-470 [Journal]
   
7. Francis Y. L. Chin, Cao An Wang
   Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:471-486 [Journal]
   
8. Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Madhu Sudan
   Reconstructing Algebraic Functions from Mixed Data. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:487-510 [Journal]
   
9. Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, David Peleg
   Optimal Broadcast with Partial Knowledge. [Citation Graph (0, 0)][DBLP]
   SIAM J. Comput., 1998, v:28, n:2, pp:511-524 [Journal]
   
10. Sridhar Rajagopalan, Vijay V. Vazirani
    Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:525-540 [Journal]
    
11. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    Optimal Construction of Edge-Disjoint Paths in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:541-573 [Journal]
    
12. Zoran Ivkovic, Errol L. Lloyd
    Fully Dynamic Algorithms for Bin Packing: Being (Mostly) Myopic Helps. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:574-611 [Journal]
    
13. Michael T. Goodrich, Roberto Tamassia
    Dynamic Trees and Dynamic Point Location. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:612-636 [Journal]
    
14. Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
    Query Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:637-651 [Journal]
    
15. David Eppstein
    Finding the k Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:652-673 [Journal]
    
16. Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldman, H. David Mathias
    Exact Learning of Discretized Geometric Concepts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:674-699 [Journal]
    
17. Yacov Yacobi
    Fast Exponentiation Using Data Compression. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:700-703 [Journal]
    
18. P. G. Walsh
    A Polynomial Time Complexity Bound for Computations on Curves. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:704-708 [Journal]
    
19. Prabhakar Raghavan, Eli Upfal
    Stochastic Contention Resolution With Short Delays. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:709-719 [Journal]
    
20. Lisa Higham, Teresa M. Przytycka
    Asymptotically Optimal Election on Weighted Rings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:720-732 [Journal]
    
21. Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran
    The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:2, pp:733-769 [Journal]