Conference paper
The minimum latency problem
Avrim Blum, Prasad Chalasani, et al.
STOC 1994
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.
Avrim Blum, Prasad Chalasani, et al.
STOC 1994
Don Coppersmith
IBM J. Res. Dev
Don Coppersmith
Mathematics of Computation
Don Coppersmith, Baruch Schieber
Journal of Complexity