On the Addition of Binary Numbers

DOI10.1109/T-C.1970.223027MaRDI QIDQ5597996zbMATH OpenOpenAlexFDO

Authors

Publication date 1970

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/t-c.1970.223027

zbMATH Keywords

computer science and automata

Cited in

(8)

• Shallow circuits and concise formulae for multiple addition and multiplication
• Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
• Probabilistic parallel prefix computation
• The delay of circuits whose inputs have specified arrival times
• On the meaning of works by V. M. Khrapchenko
• Faster linear-size \textsc{and}-\textsc{or} path and adder circuits
• Recurrence relations for rational cubic methods. II: The Chebyshev method
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times

This page was built for publication: On the Addition of Binary Numbers

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