The SCEAS System
Navigation Menu

Journals in DBLP

J. Algorithms
1981, volume: 2, number: 3

  1. Witold Lipski Jr., Christos H. Papadimitriou
    A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems. [Citation Graph (6, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:211-226 [Journal]
  2. Lloyd Allison
    Generating Coset Representatives for Permutation Groups. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:227-244 [Journal]
  3. Mark H. Overmars
    Dynamization of Order Decomposable Set Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:245-260 [Journal]
  4. Ephraim Feig
    On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:261-281 [Journal]
  5. Jan van Leeuwen, Derick Wood
    The Measure Problem for Rectangular Ranges in d-Space. [Citation Graph (3, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:282-300 [Journal]
  6. Victor Y. Pan
    A Unified Approach to the Analysis of Bilinear Algorithms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:301-310 [Journal]
  7. Shimon Even, Oded Goldreich
    The Minimum-Length Generator Sequence Problem is NP-Hard. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:311-313 [Journal]
  8. Leonidas J. Guibas
    Problems. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:314-315 [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