The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
2001, volume: 39, number: 2

  1. Reuven Bar-Yehuda
    Using Homogeneous Weights for Approximating the Partial Cover Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:137-144 [Journal]
  2. Kazuo Iwama, Eiji Miyano
    A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:145-161 [Journal]
  3. Gunnar Andersson, Lars Engebretsen, Johan Håstad
    A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:162-204 [Journal]
  4. J. Ian Munro, Venkatesh Raman, S. Srinivasa Rao
    Space Efficient Suffix Trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:205-222 [Journal]
  5. Barun Chandra, Magnús M. Halldórsson
    Greedy Local Improvement and Weighted Set Packing Approximation. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:223-240 [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