Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms
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, David Gamarnik, et al.
Random Structures and Algorithms
Don Coppersmith, Ravi Kumar
SODA 2004
Don Coppersmith, Uriel Feige, et al.
SIAM Journal on Discrete Mathematics
C.K. Wong, Don Coppersmith
Journal of the ACM