Reconstructing a Three-Dimensional Model with Arbitrary Errors.
The Computational Complexity of Knot and Link Problems.
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.