Abstract
article Free AccessThe Area-Time Complexity of Binary Multiplication Authors: R. P. Brent The Australian National University, Canberra, ACT 2600, Australia The Australian National University, Canberra, ACT 2600, AustraliaView Profile , H. T. Kung Department of Computer Science, Schenley Park, Carnegie-Mellon University, Pittsburgh, Pennsylvania, PA Department of Computer Science, Schenley Park, Carnegie-Mellon University, Pittsburgh, Pennsylvania, PAView Profile Authors Info & Claims Journal of the ACMVolume 28Issue 3July 1981 pp 521–534https://doi.org/10.1145/322261.322269Published:01 July 1981Publication History 148citation928DownloadsMetricsTotal Citations148Total Downloads928Last 12 Months38Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Keywords
CitationLibrary scienceComputer scienceMultiplication (music)Operations researchMathematicsCombinatorics
Affiliated Institutions
Related Publications
Robust adaptive floating-point geometric predicates
Article Robust adaptive floating-point geometric predicates Share on Author: Johnathan Richard Shewchuk School of Computer Science, Carnegie Mellon University, Pittsburgh, Penns...
A performance comparison of multi-hop wireless ad hoc network routing protocols
Article Free Access Share on A performance comparison of multi-hop wireless ad hoc network routing protocols Authors: Josh Broch Computer Science Department, Carnegie Mellon Uni...
Accessing nearby copies of replicated objects in a distributed environment
Article Free Access Share on Accessing nearby copies of replicated objects in a distributed environment Authors: C. Greg Plaxton Department of Computer Science, University of Te...
Data Structures for Range Searching
article Free Access Share on Data Structures for Range Searching Authors: Jon Louis Bentley Departments of Computer Science and Mathematics, Carnegie-Mellon University, Pittsbur...
Distributional clustering of words for text classification
Article Free Access Share on Distributional clustering of words for text classification Authors: L. Douglas Baker School of Computer Science, Carnegie Mellon University, Pittsbu...
Publication Info
- Year
- 1981
- Type
- article
- Volume
- 28
- Issue
- 3
- Pages
- 521-534
- Citations
- 198
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
198
OpenAlex
Cite This
Richard P. Brent,
H. T. Kung
(1981).
The Area-Time Complexity of Binary Multiplication.
Journal of the ACM
, 28
(3)
, 521-534.
https://doi.org/10.1145/322261.322269
Identifiers
- DOI
- 10.1145/322261.322269