The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
1985, volume: 6, number: 4

  1. David P. Dobkin, J. Ian Munro
    Efficient Uses of the Past. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:455-465 [Journal]
  2. Béla Bollobás, István Simon
    Repeated Random Insertion into a Priority Queue. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:466-477 [Journal]
  3. William M. Kantor
    Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:478-514 [Journal]
  4. Herbert Edelsbrunner, Mark H. Overmars
    Batched Dynamic Solutions to Decomposable Searching Problems. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:515-542 [Journal]
  5. B. Domanski, M. Anshel
    The Complexity of Dehn's Algorithm for Word Problems in Groups. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:543-549 [Journal]
  6. A. Bagchi, Pradip K. Srimani
    Weighted Heuristic Search in Networks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:550-576 [Journal]
  7. Robert W. Irving
    An Efficient Algorithm for the "Stable Roommates" Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1985, v:6, n:4, pp:577-595 [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