Author image not provided
 Alexander Izsak

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article0.00
Citation Count0
Publication count1
Publication years2011-2011
Available for download1
Average downloads per article153.00
Downloads (cumulative)153
Downloads (12 Months)6
Downloads (6 Weeks)0
Arrow RightAuthor only

See all colleagues of this author


1 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 1 of 1
Sort by:

1 published by ACM
September 2011 ACM Transactions on Algorithms (TALG): Volume 7 Issue 4, September 2011
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 6,   Downloads (Overall): 153

Full text available: PDFPDF
Suppose that a random n -bit number V is multiplied by an odd constant M ≥ 3, by adding shifted versions of the number V corresponding to the 1s in the binary representation of the constant M . Suppose further that the additions are performed by carry-save adders until the ...
Keywords: Addition, multiplication, carry propagation

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us