Richard Arratia, Béla Bollobás, et al.
Discrete Applied Mathematics
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.
Richard Arratia, Béla Bollobás, et al.
Discrete Applied Mathematics
Mihir Bellare, Don Coppersmith, et al.
IEEE Trans. Inf. Theory
Don Coppersmith, Gadiel Seroussi
IEEE Trans. Inf. Theory
Don Coppersmith, Michael Elkin
SIAM Journal on Discrete Mathematics