Don Coppersmith
IEEE Trans. Inf. Theory
Given two k element subsets S, T ⊆ Zn, we give a quasi-linear algorithm to either find λ ∈ Zn* such that S = λ T or prove that no such λ exists. This question is closely related to isomorphism testing of circulant graphs and has recently been studied in the literature. © 2005 Elsevier B.V. All rights reserved.
Don Coppersmith
IEEE Trans. Inf. Theory
Maria-Florina Balcan, Nikhil Bansal, et al.
Machine Learning
Don Coppersmith, Ravi Kumar
SODA 2004
Don Coppersmith, Jon Lee
Discrete Optimization