The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
1984, volume: 31, number: 4

  1. S. G. Williamson
    Depth-First Search and Kuratowski Subgraphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:681-693 [Journal]
  2. Jonathan W. Greene, Abbas El Gamal
    Configuration of VLSI Arrays in the Presence of Defects. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:694-717 [Journal]
  3. Catriel Beeri, Moshe Y. Vardi
    A Proof Procedure for Data Dependencies. [Citation Graph (21, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:718-741 [Journal]
  4. Stavros S. Cosmadakis, Christos H. Papadimitriou
    Updates of Relational Views. [Citation Graph (24, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:742-760 [Journal]
  5. Tomasz Imielinski, Witold Lipski Jr.
    Incomplete Information in Relational Databases. [Citation Graph (73, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:761-791 [Journal]
  6. Adam W. Bojanczyk
    Optimal Asynchronous Newton Method for the Solution of Nonlinear Equations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:792-803 [Journal]
  7. Pierre-Jacques Courtois, Pierre Semal
    Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by Decomposition. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:804-825 [Journal]
  8. A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto
    Optimum Head Separation in a Disk System with Two Read/Write Heads. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:826-838 [Journal]
  9. Benjamin Melamed, Micha Yadin
    Numerical Computation of Sojourn-Time Distributions in Queuing Networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:839-854 [Journal]
  10. Debasis Mitra, Peter J. Weinberger
    Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics. [Citation Graph (4, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:855-878 [Journal]
  11. Peter A. Bloniarz, Harry B. Hunt III, Daniel J. Rosenkrantz
    Algebraic Structures with Hard Equivalence and Minimization Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:879-904 [Journal]
  12. Jan K. Pachl, Ephraim Korach, Doron Rotem
    Lower Bounds for Distributed Maximum-Finding Algorithms. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:4, pp:905-918 [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