Distributed Reduction Algorithms

Distributed Reduction Algorithms is a computational method that systematically aggregates data values across multiple processing nodes in a parallel computing environment, distinguished by its orchestration of localized reductions followed by global consolidation to produce a final collective result.

52

Publications

2.6K

Citations

150

Authors

76

Institutions

Publications per year

2017–2026

16

Authors

150

  1. PH
    Paul Hudak

    Yale University, United States

    2 publications · 39 citations

    2

    h-index

  2. MA
    Mohammad Ali Maddah-Ali

    University of Southern California, United States

    2 publications · 503 citations

    2

    h-index

  3. SO
    Simona Orzan

    Centrum Wiskunde & Informatica, Netherlands

    2 publications · 78 citations

    2

    h-index

  4. SL
    Songze Li

    University of Southern California, United States

    2 publications · 503 citations

    2

    h-index

  5. QY
    Qian Yu

    University of Southern California, United States

    2 publications · 503 citations

    2

    h-index

1–5 of 150

Venues

  1. arXiv (Cornell University)

    Repository · 4 publications · 358 citations

    4

    h-index

  2. Electronic Notes in Theoretical Computer Science

    ENTCS · 2 publications · 43 citations

    2

    h-index

  3. Future Generation Computer Systems

    FGCS · 2 publications · 28 citations

    2

    h-index

  4. Neurocomputing

    2 publications · 266 citations

    2

    h-index

  5. IEEE Transactions on Signal Processing

    2 publications · 100 citations

    2

    h-index

1–5