Inder Gopal, Don Coppersmith, et al.
IEEE Transactions on Communications
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.
Inder Gopal, Don Coppersmith, et al.
IEEE Transactions on Communications
Don Coppersmith
Journal of Cryptology
Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
Don Coppersmith, Michael Elkin
SIAM Journal on Discrete Mathematics