The SCEAS System
Navigation Menu

Journals in DBLP

Algorithmica
2002, volume: 32, number: 2

  1. Cynthia A. Phillips, Clifford Stein, Eric Torng, Joel Wein
    Optimal Time-Critical Scheduling via Resource Augmentation. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:163-200 [Journal]
  2. Ran Bachrach, Ran El-Yaniv, M. Reinstadtler
    On the Competitive Theory and Practice of Online List Accessing Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:201-245 [Journal]
  3. Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis
    Scheduling Independent Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:247-261 [Journal]
  4. Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida
    A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:262-276 [Journal]
  5. Matthew Andrews, Michael A. Bender, Lisa Zhang
    New Algorithms for Disk Scheduling. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:277-301 [Journal]
  6. Oded Goldreich, Dana Ron
    Property Testing in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:2, pp:302-343 [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