Journals in DBLP

J. ACM
2000, volume: 47, number: 6

1. Susanne Albers, Naveen Garg, Stefano Leonardi
   Minimizing stall time in single and parallel disk systems. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2000, v:47, n:6, pp:969-986 [Journal]
   
2. Martin Farach-Colton, Paolo Ferragina, S. Muthukrishnan
   On the sorting-complexity of suffix tree construction. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2000, v:47, n:6, pp:987-1011 [Journal]
   
3. Bernard Chazelle
   The soft heap: an approximate priority queue with optimal error rate. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2000, v:47, n:6, pp:1012-1027 [Journal]
   
4. Bernard Chazelle
   A minimum spanning tree algorithm with Inverse-Ackermann type complexity. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2000, v:47, n:6, pp:1028-1047 [Journal]
   
5. Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan
   Contention resolution with constant expected delay. [Citation Graph (0, 0)][DBLP]
   J. ACM, 2000, v:47, n:6, pp:1048-1096 [Journal]