Journals in DBLP
J. ACM 2001, volume: 48, number: 2
Eli Ben-Sasson , Avi Wigderson Short proofs are narrow - resolution made simple. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:149-169 [Journal ] Salvador Roura Improved master theorems for divide-and-conquer recurrences. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:170-205 [Journal ] Martin Skutella Convex quadratic and semidefinite programming relaxations in scheduling. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:206-242 [Journal ] Daniel R. Dooly , Sally A. Goldman , Stephen D. Scott On-line analysis of the TCP acknowledgment delay problem. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:243-273 [Journal ] Kamal Jain , Vijay V. Vazirani Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:274-296 [Journal ] Ka Wong Chong , Yijie Han , Tak Wah Lam Concurrent threads and optimal parallel minimum spanning trees algorithm. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:297-323 [Journal ] Andrei Z. Broder , Alan M. Frieze , Eli Upfal A general approach to dynamic packet routing with bounded buffers. [Citation Graph (0, 0)][DBLP ] J. ACM, 2001, v:48, n:2, pp:324-349 [Journal ]