scientific article; zbMATH DE number 4085015

MaRDI QIDQ3814804zbMATH OpenFDO

Authors Selim G. Akl, Henk Meijer

Publication date 1988

zbMATH Keywords

bit complexityboolean circuitparallel computations

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Bit serial addition trees and their applications
• Computing Powers in Parallel
• Parallel Prefix Computation
• scientific article; zbMATH DE number 4090816
• Bounds for parallel addition time of two numbers

Cited in

(11)

• Improving the average delay of sorting
• Bit serial addition trees and their applications
• Bit copying: the ultimate computational simplicity
• EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
• scientific article; zbMATH DE number 4170913 (Why is no real title available?)
• Trade-Offs between Depth and Width in Parallel Computation
• The Dynamic Parallel Complexity of Computational Circuits
• Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
• Complexity of Sub-Bus Mesh Computations
• On the problem of computational time and complexity of arithmetic functions
• Bounds for parallel addition time of two numbers

This page was built for publication:

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