Parallel Prefix Trees
Parallel Prefix Trees is a computational framework that organizes parallel prefix operations into a hierarchical tree structure, enabling efficient, logarithmic-time execution of prefix computations on parallel architectures.
60
Publications
3.4K
Citations
133
Authors
80
Institutions
Publications per year
2017–2026
7
Parents
60
Richard E. Ladner, Michael J. Fischer · Journal of the ACM · 1980 · 1.3K citations · Full text
Clyde P. Kruskal, Larry Rudolph, Marc Snir · IEEE Transactions on Computers · 1985 · 230 citations
Parallel construction of a suffix tree with applications
Alberto Apostolico, Costa S. Iliopoulos, Gad M. Landau et al. · Algorithmica · 1988 · 170 citations
A. Beaumont-Smith, Cheng‐Chew Lim · 2002 · 103 citations
Depth-size trade-offs for parallel prefix computation
Marc Snir · Journal of Algorithms · 1986 · 98 citations
1–5 of 60
133
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 133
80
Carnegie Mellon University
Pittsburgh, United States
4 h-index
5 publications
405 citations
Nagoya University
Nagoya, Japan
2 h-index
2 publications
69 citations
Syracuse University
Syracuse, United States
2 h-index
3 publications
110 citations
New York University
New York, United States
2 h-index
2 publications
229 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
328 citations
University of California, Santa Barbara
Santa Barbara, United States
2 h-index
2 publications
69 citations

Yokohama National University
Yokohama, Japan
2 h-index
2 publications
69 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
2 h-index
2 publications
27 citations
1–8 of 80
4 publications · 169 citations
4
h-index
3 publications · 152 citations
3
h-index
2 publications · 33 citations
2
h-index
Conference · 2 publications · 37 citations
2
h-index
2 publications · 287 citations
2
h-index
1–5