Conference paper
The minimum latency problem
Avrim Blum, Prasad Chalasani, et al.
STOC 1994
The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions. © 2005 Society for Industrial and Applied Mathematics.
Avrim Blum, Prasad Chalasani, et al.
STOC 1994
Don Coppersmith, David Gamarnik, et al.
SODA 1998
Don Coppersmith, S.E. June Hong, et al.
Data Mining and Knowledge Discovery
Don Coppersmith, David Gamarnik, et al.
SODA 2002