Don Coppersmith, Ephraim Feig, et al.
IEEE TSP
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, Ephraim Feig, et al.
IEEE TSP
Don Coppersmith
Journal of Complexity
Béla Bollobás, Don Coppersmith, et al.
SODA 1998
Alok Aggarwal, Don Coppersmith, et al.
Information Processing Letters