|
Journals in DBLP
J. ACM 1999, volume: 46, number: 2
- Joel Hass, J. C. Lagarias, Nicholas Pippenger
The Computational Complexity of Knot and Link Problems. [Citation Graph (0, 0)][DBLP] J. ACM, 1999, v:46, n:2, pp:185-211 [Journal]
- Bonnie Berger, Jon M. Kleinberg, Frank Thomson Leighton
Reconstructing a Three-Dimensional Model with Arbitrary Errors. [Citation Graph (0, 0)][DBLP] J. ACM, 1999, v:46, n:2, pp:212-235 [Journal]
- Paolo Ferragina, Roberto Grossi
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications. [Citation Graph (1, 0)][DBLP] J. ACM, 1999, v:46, n:2, pp:236-280 [Journal]
- Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. [Citation Graph (0, 0)][DBLP] J. ACM, 1999, v:46, n:2, pp:281-321 [Journal]
|