scientific article; zbMATH DE number 4085015
From MaRDI portal
Publication:3814804
[For the entire collection see Zbl 0638.00034.] The authors propose a bit-serial boolean circuit for computing the sum of n k-bit integers, the muliplication of two k-bit integers, the partial sums of n k-bit integers and sorting of n k-bit integers. The circuit for the second problem has \(\theta\) (k) time complexity and the circuits for the other problems have \(\theta\) (log n)\(+\theta (k)\) time complexity.
Recommendations
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)