Don Coppersmith, Andrew M. Odlzyko, et al.
Algorithmica
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.
Don Coppersmith, Andrew M. Odlzyko, et al.
Algorithmica
Inder S. Gopal, Don Coppersmith, et al.
IEEE TC
Don Coppersmith
Journal of Cryptology
Don Coppersmith, Michael Elkin
SIAM Journal on Discrete Mathematics