Optimal Prefix Computation
Optimal Prefix Computation is a parallel algorithmic method that belongs to the class of prefix computation techniques and is distinguished by achieving the asymptotically minimal time and processor complexity required to compute all prefix sums in a sequence.
29
Publications
753
Citations
54
Authors
30
Institutions
Publications per year
2017–2026
0
Variants
Optimal Parallel Prefix Computation
Parents
29
Optimal Binary Search Trees with Restricted Maximal Depth
M. R. Garey · SIAM Journal on Computing · 1974 · 70 citations
Clyde P. Kruskal, Larry Rudolph, Marc Snir · 1985 · 42 citations
1–5 of 29
54
5
h-index
4
h-index
2
h-index
2
h-index
2
h-index
1–5 of 54
30
University of Florida
Gainesville, United States
4 h-index
8 publications
224 citations
National Taiwan University of Science and Technology
Taipei, Taiwan
3 h-index
6 publications
126 citations
University of California, Santa Barbara
Santa Barbara, United States
2 h-index
4 publications
106 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
1 h-index
1 publications
18 citations

TIBCO Software (United States)
Palo Alto, United States
1 h-index
1 publications
31 citations

Hiroshima University
Hiroshima, Japan
1 h-index
1 publications
15 citations

National Taipei University of Technology
Taipei, Taiwan
1 h-index
1 publications
12 citations
University of Copenhagen
Copenhagen, Denmark
1 h-index
1 publications
13 citations
1–8 of 30
3 publications · 81 citations
3
h-index
2 publications · 33 citations
2
h-index
2 publications · 58 citations
2
h-index
2 publications · 46 citations
2
h-index
1 publications · 23 citations
1
h-index
1–5