Parallel Prefix Networks

Parallel Prefix Networks is a computational architecture that belongs to the class of parallel algorithms designed for efficient prefix computation, distinguished by its use of a fixed interconnection topology enabling logarithmic-time execution through concurrent propagation of partial results across processing elements.

101

Publications

4.9K

Citations

194

Authors

97

Institutions

Publications per year

2017–2026

11

Authors

194

  1. CE
    C. Efstathiou

    National and Kapodistrian University of Athens, Greece

    6 publications · 314 citations

    6

    h-index

  2. HV
    H.T. Vergos

    University of Patras, Greece

    6 publications · 314 citations

    6

    h-index

  3. DN
    D. Nikolos

    University of Patras, Greece

    6 publications · 320 citations

    5

    h-index

  4. YL
    Yen‐Chun Lin

    Chiayi Chang Gung Memorial Hospital, Taiwan

    5 publications · 99 citations

    5

    h-index

  5. CC
    Chung‐Kuan Cheng

    University of California San Diego, United States

    3 publications · 64 citations

    3

    h-index

1–5 of 194

Venues

  1. IEEE Transactions on Computers

    10 publications · 754 citations

    10

    h-index

  2. Journal of Parallel and Distributed Computing

    6 publications · 170 citations

    6

    h-index

  3. Information Processing Letters

    4 publications · 58 citations

    4

    h-index

  4. 4

    h-index

  5. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 156 citations

    4

    h-index

1–5