Parallel Prefix Circuits
Parallel Prefix Circuits is a computational circuit architecture designed to efficiently compute prefix operations in parallel by hierarchically combining input values through associative binary operators, distinguished from other circuit models by its optimized structure for minimizing delay in parallel prefix computation.
125
Publications
6.2K
Citations
255
Authors
111
Institutions
Publications per year
2017–2026
27
Parents
125
Richard E. Ladner, Michael J. Fischer · Journal of the ACM · 1980 · 1.3K citations · Full text
Fast area-efficient VLSI adders
Tack‐Don Han, David A. Carlson · 1987 · 315 citations
A reduced-area scheme for carry-select adders
Akhilesh Tyagi · IEEE Transactions on Computers · 1993 · 241 citations
Clyde P. Kruskal, Larry Rudolph, Marc Snir · IEEE Transactions on Computers · 1985 · 230 citations
1–5 of 125
255
8
h-index
7
h-index
7
h-index
6
h-index
5
h-index
1–5 of 255
111
University of Patras
Pátrai, Greece
10 h-index
22 publications
1.4K citations
Technological Educational Institute of Athens
Athens, Greece
7 h-index
7 publications
459 citations
Computer Technology Institute and Press “DIOPHANTUS”
Pátrai, Greece
6 h-index
13 publications
648 citations
National Taiwan University of Science and Technology
Taipei, Taiwan
5 h-index
10 publications
178 citations
The University of Texas at Austin
Austin, United States
5 h-index
9 publications
254 citations
Jaypee University of Information Technology
Solan, India
4 h-index
12 publications
291 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
5 publications
168 citations

Yokohama National University
Yokohama, Japan
3 h-index
6 publications
197 citations
1–8 of 111
14 publications · 1.3K citations
14
h-index
5 publications · 220 citations
5
h-index
4 publications · 76 citations
4
h-index
4 publications · 90 citations
4
h-index
Conference · 3 publications · 56 citations
3
h-index
1–5