Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit

DOI10.1023/A:1022084814175zbMath1039.68096OpenAlexW1553034866MaRDI QIDQ1402306

Chun-Keng Liu, Yen-Chun Lin, Yao-Hsien Hsu

Publication date: 20 August 2003

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022084814175

zbMATH Keywords

parallel algorithmsdepthdepth-size optimalfan-outsize optimalprefix circuits

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Functional and dynamic programming in the design of parallel prefix networks

This page was built for publication: Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit