Don Coppersmith, Prabhakar Raghavan, et al.
Information and Computation
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, Prabhakar Raghavan, et al.
Information and Computation
Don Coppersmith, Baruch Schieber
Journal of Complexity
Don Coppersmith, Moshe Lewenstein
SIAM Journal on Discrete Mathematics
Don Coppersmith
IBM J. Res. Dev