The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
2000, volume: 34, number: 1

  1. S. Muthukrishnan
    Simple Optimal Parallel Multiple Pattern Matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:1-13 [Journal]
  2. Franz Höfting, Egon Wanke
    Polynomial-Time Analysis of Toroidal Periodic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:14-39 [Journal]
  3. Farhad Shahrokhi, Weiping Shi
    On Crossing Sets, Disjoint Sets, and Pagenumber. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:40-53 [Journal]
  4. Klaus Jansen
    Approximation Results for the Optimum Cost Chromatic Partition Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:54-89 [Journal]
  5. Biing-Feng Wang
    Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:90-108 [Journal]
  6. Hagit Attiya
    Efficient and Robust Sharing of Memory in Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:109-127 [Journal]
  7. Pascal Berthomé, Torben Hagerup, Ilan Newman, Assaf Schuster
    Self-Simulation for the Passive Optical Star. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:128-147 [Journal]
  8. Nicola Galli
    Average Costs of a Graph Exploration: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:148-176 [Journal]
  9. Ravindra K. Ahuja, James B. Orlin
    A Faster Algorithm for the Inverse Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:177-193 [Journal]
  10. Tao Jiang, Paul E. Kearney, Ming Li
    Some Open Problems in Computational Molecular Biology. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:1, pp:194-201 [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