Journals in DBLP

J. ACM
1991, volume: 38, number: 1

1. Martin E. Dyer, Alan M. Frieze, Ravi Kannan
   A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. [Citation Graph (2, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:1-17 [Journal]
   
2. Joseph S. B. Mitchell, Christos H. Papadimitriou
   The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:18-73 [Journal]
   
3. Ketan Mulmuley
   A Fast Planar Partition Algorithm, II. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:74-103 [Journal]
   
4. Dan E. Willard
   Optimal Sample Cost Residues for Differential Database Batch Query Problems. [Citation Graph (4, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:104-119 [Journal]
   
5. Yehoshua Sagiv
   Evaluation of Queries in Independent Database Schemes. [Citation Graph (10, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:120-161 [Journal]
   
6. Greg N. Frederickson
   Planar Graph Decomposition and All Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:162-204 [Journal]
   
7. V. Chandru, John N. Hooker
   Extended Horn Sets In Propositional Logic. [Citation Graph (1, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:205-221 [Journal]
   
8. Gloria Kissin
   Upper and Lower Bounds on Switching Energy in VLSI. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1991, v:38, n:1, pp:222-254 [Journal]