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

Authors

54

  1. YL
    Yen‐Chun Lin

    Chiayi Chang Gung Memorial Hospital, Taiwan

    5 publications · 95 citations

    5

    h-index

  2. SS
    Sartaj Sahni

    University of Florida, United States

    4 publications · 112 citations

    4

    h-index

  3. KS
    Kun Suk Kim

    University of Ulsan, South Korea

    2 publications · 70 citations

    2

    h-index

  4. TM
    Tania Mishra

    University of Florida, United States

    2 publications · 42 citations

    2

    h-index

  5. HW
    Haigeng Wang

    Massachusetts Institute of Technology, United States

    2 publications · 52 citations

    2

    h-index

1–5 of 54

Venues

  1. Journal of Parallel and Distributed Computing

    3 publications · 81 citations

    3

    h-index

  2. Information Processing Letters

    2 publications · 33 citations

    2

    h-index

  3. IEEE Transactions on Computers

    2 publications · 58 citations

    2

    h-index

  4. IEEE Transactions on Information Theory

    2 publications · 46 citations

    2

    h-index

  5. International Journal of Parallel Programming

    1 publications · 23 citations

    1

    h-index

1–5