Faster linear-size \textsc{and}-\textsc{or} path and adder circuits

DOI10.1016/J.TCS.2026.116167MaRDI QIDQ7347254zbMATH OpenFDO

Authors Ulrich Brenner, Anna Silvanus

Publication date 14 September 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116167

Mathematics Subject Classification ID

Theory of computing (68Qxx) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• A Regular Layout for Parallel Adders
• Binary adder circuits of asymptotically minimum depth, linear size, and fan-out two
• Combinatorial Merging
• Constructing depth-optimum circuits for adders and \textsc{And}-\textsc{Or} paths
• Delay optimization of linear depth Boolean circuits with prescribed input arrival times
• Fast prefix adders for non-uniform input arrival times
• Faster carry bit computation for adder circuits with prescribed arrival times
• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• scientific article; zbMATH DE number 6004896 (Why is no real title available?)
• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3558968 (Why is no real title available?)
• scientific article; zbMATH DE number 3214539 (Why is no real title available?)
• scientific article; zbMATH DE number 3301887 (Why is no real title available?)
• On the Addition of Binary Numbers
• On the Time Required to Perform Addition
• Parallel Prefix Computation
• Sharpening an upper bound on the adder and comparator depths
• Size-depth tradeoff in monotone Boolean formulae
• The delay of circuits whose inputs have specified arrival times

This page was built for publication: Faster linear-size \textsc{and}-\textsc{or} path and adder circuits

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