Bounds for parallel addition time of two numbers

DOI10.1007/BF01130356MaRDI QIDQ610001zbMATH OpenFDO

Authors I. K. Rystsov

Publication date 1 December 2010

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Publication:3033322
• Parallel Addition
• Depth-size trade-offs for parallel prefix computation
• scientific article; zbMATH DE number 4085015
• Some notes on threshold circuits, and multiplication in depth 4

Cites work

• On the Parallel Evaluation of Polynomials
• Size-depth tradeoff in monotone Boolean formulae
• The complexity of computations by networks

Cited in

(9)

• Sharpening an upper bound on the adder and comparator depths
• scientific article; zbMATH DE number 4131661 (Why is no real title available?)
• scientific article; zbMATH DE number 4085015 (Why is no real title available?)
• Parallel addition time for several numbers
• Tight bounds on expected time to add correctly and add mostly correctly
• scientific article; zbMATH DE number 3939261 (Why is no real title available?)
• On the problem of computational time and complexity of arithmetic functions
• Vertical processing of integer group-data streams. III: Application to binary arithmetic operations
• Vertical processing of integer group-data streams. II: Application to binary arithmetic operations

This page was built for publication: Bounds for parallel addition time of two numbers

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