Journals in DBLP

J. ACM
1999, volume: 46, number: 6

1. Frank Thomson Leighton, Satish Rao
   Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1999, v:46, n:6, pp:787-832 [Journal]
   
2. Yunhong Zhou, Subhash Suri
   Analysis of a bounding box heuristic for object intersection. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1999, v:46, n:6, pp:833-857 [Journal]
   
3. Maurice Herlihy, Nir Shavit
   The topological structure of asynchronous computability. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1999, v:46, n:6, pp:858-923 [Journal]
   
4. Rolf H. Möhring, Andreas S. Schulz, Marc Uetz
   Approximation in stochastic scheduling: the power of LP-based priority policies. [Citation Graph (0, 0)][DBLP]
   J. ACM, 1999, v:46, n:6, pp:924-942 [Journal]