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

Authors

133

  1. RH
    Ramesh Hariharan

    Indian Institute of Science Bangalore, India

    4 publications · 108 citations

    4

    h-index

  2. GE
    Guy E. Blelloch

    Carnegie Mellon University, United States

    3 publications · 127 citations

    3

    h-index

  3. JS
    Julian Shun

    Carnegie Mellon University, United States

    3 publications · 127 citations

    3

    h-index

  4. DB
    Dany Breslauer

    Danish National Research Foundation, Denmark

    2 publications · 27 citations

    2

    h-index

  5. CP
    Clyde P. Kruskal

    University of Maryland, College Park, United States

    2 publications · 255 citations

    2

    h-index

1–5 of 133

Venues

  1. Journal of Parallel and Distributed Computing

    4 publications · 169 citations

    4

    h-index

  2. 3

    h-index

  3. Information Processing Letters

    2 publications · 33 citations

    2

    h-index

  4. Proceedings of the International Conference on Parallel Processing

    Conference · 2 publications · 37 citations

    2

    h-index

  5. IEEE Transactions on Computers

    2 publications · 287 citations

    2

    h-index

1–5