How to Add Fast--on Average

DOI10.2307/2974642MaRDI QIDQ4870034zbMATH OpenOpenAlexFDO

Authors Geza Schay

Publication date 15 June 1997

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2974642

zbMATH Keywords

iterative algorithmaddition of binary numbers

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis
• Tight bounds on expected time to add correctly and add mostly correctly
• On the number of iterations required by von Neumann addition
• Parallel Addition

Cited in

(3)

• Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis
• On the number of iterations required by von Neumann addition
• Average-case analysis via incompressibility

This page was built for publication: How to Add Fast--on Average

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4870034)