The SCEAS System
Navigation Menu

Journals in DBLP

SIAM J. Comput.
1999, volume: 28, number: 6

  1. Richard J. Anderson
    Tree Data Structures for N-Body Simulation. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:1923-1940 [Journal]
  2. John Case
    The Power of Vacillation in Language Learning. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:1941-1969 [Journal]
  3. Andries E. Brouwer
    An Associative Block Design ABD(8, 5). [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:1970-1971 [Journal]
  4. Ronitt Rubinfeld
    On the Robustness of Functional Equations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:1972-1997 [Journal]
  5. Barun Chandra, Howard J. Karloff, Craig A. Tovey
    New Results on the Old k-opt Algorithm for the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:1998-2029 [Journal]
  6. Mauro Leoncini, Giovanni Manzini, Luciano Margara
    Parallel Complexity of Numerically Accurate Linear System Solvers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2030-2058 [Journal]
  7. John H. Reif
    Approximate Complex Polynomial Evaluation in Near Constant Work Per Point. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2059-2089 [Journal]
  8. Yosi Ben-Asher, Eitan Farchi, Ilan Newman
    Optimal Search in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2090-2102 [Journal]
  9. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2103-2116 [Journal]
  10. Stephen Alstrup, Dov Harel, Peter W. Lauridsen, Mikkel Thorup
    Dominators in Linear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2117-2132 [Journal]
  11. Prasad Chalasani, Rajeev Motwani
    Approximating Capacitated Routing and Delivery Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2133-2149 [Journal]
  12. Xin He
    On Floor-Plan of Plane Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2150-2167 [Journal]
  13. Kazuhisa Makino, Ken-ichi Hatanaka, Toshihide Ibaraki
    Horn Extensions of a Partially Defined Boolean Function. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2168-2186 [Journal]
  14. Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
    Fast Approximate Graph Partitioning Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2187-2214 [Journal]
  15. John Hershberger, Subhash Suri
    An Optimal Algorithm for Euclidean Shortest Paths in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2215-2256 [Journal]
  16. Jeff Edmonds, Chung Keung Poon, Dimitris Achlioptas
    Tight Lower Bounds for st-Connectivity on the NNJAG Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2257-2284 [Journal]
  17. Warwick Harvey
    Computing Two-Dimensional Integer Hulls. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2285-2299 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002