Parallel Prefix Computation
Parallel Prefix Computation is a fundamental algorithmic operation in parallel computing that belongs to the class of collective communication patterns, distinguished by its computation of all partial prefix results of a given associative binary operation over an ordered sequence of input elements in parallel.
215
Publications
9.4K
Citations
416
Authors
196
Institutions
Publications per year
2017–2026
34
215
Richard E. Ladner, Michael J. Fischer · Journal of the ACM · 1980 · 1.3K citations · Full text
Parallel Prefix Sum (Scan) with CUDA
Mark Harris · 2011 · 542 citations
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
1–5 of 215
416
10
h-index
8
h-index
7
h-index
7
h-index
5
h-index
1–5 of 416
196
University of Patras
Pátrai, Greece
10 h-index
22 publications
1.4K citations
National Taiwan University of Science and Technology
Taipei, Taiwan
7 h-index
12 publications
210 citations
Technological Educational Institute of Athens
Athens, Greece
7 h-index
7 publications
459 citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
10 publications
920 citations
Computer Technology Institute and Press “DIOPHANTUS”
Pátrai, Greece
6 h-index
13 publications
648 citations
University of Maryland, College Park
College Park, United States
5 h-index
14 publications
346 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
5 h-index
11 publications
264 citations
University of California, Santa Barbara
Santa Barbara, United States
5 h-index
8 publications
219 citations
1–8 of 196
16 publications · 1.4K citations
16
h-index
10 publications · 297 citations
10
h-index
6 publications · 245 citations
6
h-index
TPDS · 6 publications · 210 citations
6
h-index
5 publications · 115 citations
5
h-index
1–5