Bounds for parallel addition time of two numbers

DOI10.1007/BF01130356zbMATH Open1200.68126MaRDI QIDQ610001FDOQ610001

Authors: I. K. Rystsov 

Publication date: 1 December 2010

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Sharpening an upper bound on the adder and comparator depths
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel addition time for several numbers
• Tight bounds on expected time to add correctly and add mostly correctly
• Title not available (Why is that?)
• 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)