The SCEAS System
Navigation Menu

Journals in DBLP

J. ACM
2001, volume: 48, number: 2

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002