The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1990, volume: 37, number: 3

  1. Bernard Chazelle
    Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model [Citation Graph (2, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:439-463 [Journal]
  2. Lawrence L. Larmore, Daniel S. Hirschberg
    A Fast Algorithm for Optimal Length-Limited Huffman Codes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:464-473 [Journal]
  3. Marc H. Graham, Ke Wang
    On the Equivalence of an Egd to a Set of Fd's [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:474-490 [Journal]
  4. In Kyung Ryu, Alexander Thomasian
    Analysis of Database Performance with Dynamic Locking [Citation Graph (11, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:491-523 [Journal]
  5. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk
    Renaming in an Asynchronous Environment [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:524-548 [Journal]
  6. Joseph Y. Halpern, Yoram Moses
    Knowledge and Common Knowledge in a Distributed Environment [Citation Graph (1, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:549-587 [Journal]
  7. Aydin Üresin, Michel Dubois
    Parallel Asynchronous Algorithms for Discrete Data [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:588-606 [Journal]
  8. Ariel Orda, Raphael Rom
    Shortest-Path and Minimum-Delay Algorithms in Networks with Time-Dependent Edge-Length [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:607-625 [Journal]
  9. Yijie Han, Robert A. Wagner
    An Efficient and Fast Parallel-Connected Component Algorithm [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:626-642 [Journal]
  10. Krishna R. Pattipati, Michael M. Kostreva, John L. Teele
    Approximate Mean Value Analysis Algorithms for Queuing Networks: Existence, Uniqueness, and Convergence Results [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:643-673 [Journal]
  11. Yuri Gurevich, Saharon Shelah
    Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space [Citation Graph (0, 0)][DBLP]
    J. ACM, 1990, v:37, n:3, pp:674-687 [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