Login / Signup
On a New Class of Optimal Parallel Prefix Circuits with (Size+Depth) = 2n-2 AND\lceil log n \rceil DEPTH(2 \lceil log n \rceil -3).
Sudarshan K. Dhall
S. Lakshmivarahan
Chi-Ming Yang
Published in:
ICPP (1987)
Keyphrases
</>
binary search trees
data structure
parallel algorithm
search tree
worst case
depth map
depth information
shared memory
lower bound
b tree
three dimensional
search space
high speed
parallel processing
parallel implementation
heavy hitters