Don Coppersmith, Michael Elkin
SIAM Journal on Discrete Mathematics
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, Michael Elkin
SIAM Journal on Discrete Mathematics
Don Coppersmith
Journal of Cryptology
Don Coppersmith, Prabhakar Raghavan
Operations Research Letters
Don Coppersmith, Alan J. Hoffman
Linear Algebra and Its Applications