Conference paper
The minimum latency problem
Avrim Blum, Prasad Chalasani, et al.
STOC 1994
Paper
Hadamard Transforms on Multiply/Add Architectures
Abstract
A new algorithm for computing Hadamard transforms is presented. If n is a power of four, then the new algorithm uses ⅞ n logn multiply/adds to compute a Hadamard transform of length n. © 1994 IEEE
Related
Don Coppersmith
Journal of Combinatorial Theory, Series A
Inder S. Gopal, Don Coppersmith, et al.
IEEE TC
Don Coppersmith, David Gamarnik, et al.
Random Structures and Algorithms