Journal of the ACM Bibliography
R.
P. Brent and H. T. Kung.
The area-time complexity of binary multiplication. Journal of the
ACM, 28(3):521-534, July 1981.
[BibTeX entry]
Selected papers that cite this one
- R. P. Brent and H. T. Kung. Corrigendum: ``The area-time
complexity of binary multiplication''. Journal of the
ACM, 29(3):904, July 1982.
- J. I. Chu and G. Schnitger. Communication complexity of
matrix computation over finite fields. Mathematical Systems
Theory, 28(3):215-228, May/June 1995.
- Bruno Codenotti and Franco Flandoli. A Monte Carlo
method for the parallel solution of linear systems. Journal of
Complexity, 5(1):107-117, March 1989.
- Gloria Kissin. Upper and
lower bounds on switching energy in VLSI. Journal of the
ACM, 38(1):222-254, January 1991.
- Kurt Mehlhorn and Franco P. Preparata. Area-time optimal VLSI integer
multiplier with minimum computation time. Information and
Control, 58(1-3):137-156, July/August/September 1983.
Shortcuts: