Reconstructing Strings from Substrings,
(with Gopalkrishnan Sundaram),
Journal of Computational Biology 2 (1995) 333-353.
Also, Workshop on Data Structures and Algorithms (WADS '93),
Springer-Verlag Lecture Notes in Computer Science, v. 709, 565-576.
Frequencies of Large Distances in Integer Lattices (with Venugopal Reddy).
Proc. Seventh International Conference on
Graph Theory, Combinatorics, Algorithms, and Applications,
Kalamazoo MI, in
Graph Theory, Combinatorics, and Applications,
ed. Y. Alavi and A. Schwenk,
John Wiley and Sons, New York, v. 2, 981-989.
Reconstructing Sets from Interpoint Distances,
(with Warren Smith and Paul Lemke).
in Sixth ACM Symposium on Computational Geometry, June 1990, 332-339.
Note: The long-standing problem of finding a strongly polynomial-time algorithm
for the turnpike/partial digest problem remains