Mihir Bellare, Don Coppersmith, et al.
IEEE Trans. Inf. Theory
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.
Mihir Bellare, Don Coppersmith, et al.
IEEE Trans. Inf. Theory
Don Coppersmith, Lisa Fleischer, et al.
SODA 2006
Don Coppersmith, Baruch Schieber
Journal of Complexity
Don Coppersmith, Prabhakar Raghavan
Operations Research Letters