Journals in DBLP

J. ACM
1988, volume: 35, number: 1

1. Christoph Walther
   Many-sorted unification. [Citation Graph (2, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:1-17 [Journal]
   
2. Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou
   The complexity of searching a graph. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:18-44 [Journal]
   
3. Yann-Hang Lee, Kang G. Shin
   Optimal design and use of retry in fault-tolerant computer systems. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:45-69 [Journal]
   
4. Serge Abiteboul, Victor Vianu
   Equivalence and optimization of relational transactions. [Citation Graph (16, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:70-120 [Journal]
   
5. Vassos Hadzilacos
   A theory of reliability in database systems. [Citation Graph (22, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:121-145 [Journal]
   
6. Anthony C. Klug
   On conjunctive queries containing inequalities. [Citation Graph (34, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:146-160 [Journal]
   
7. Gaston H. Gonnet, Per-Åke Larson
   External hashing with limited internal storage. [Citation Graph (4, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:161-184 [Journal]
   
8. Timothy J. Hickey, Jacques Cohen
   Automating program analysis. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:185-220 [Journal]
   
9. Satish K. Tripathi, C. Murray Woodside
   A vertex-allocation theorem for resources in queuing networks. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1988, v:35, n:1, pp:221-230 [Journal]
   
10. Erich Kaltofen
    Greatest common divisors of polynomials given by straight-line programs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:1, pp:231-264 [Journal]