Cited By
View all- Bilardi GPreparata F(1987)Size-time complexity of Boolean networks for prefix computationsProceedings of the nineteenth annual ACM symposium on Theory of computing10.1145/28395.28442(436-442)Online publication date: 1-Jan-1987
Abstract
No abstract available.
Recommendations
A VLSI Modulo m Multiplier
A novel method to compute the exact digits of the modulo m product of integers is proposed, and a modulo m multiply structure is defined. Such a structure can be implemented by means of a few fast VLSI binary multipliers, and a response time of about ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 August 1986
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
Cited By
View all- Bilardi GPreparata F(1987)Size-time complexity of Boolean networks for prefix computationsProceedings of the nineteenth annual ACM symposium on Theory of computing10.1145/28395.28442(436-442)Online publication date: 1-Jan-1987
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in