Sparse Reduction

Sparse Reduction is a reduction operation that belongs to the class of computational methods optimized for sparsity, distinguished by its focus on efficiently aggregating non-zero elements in sparse data structures while minimizing redundant computations on zero-valued entries.

78

Publications

4.5K

Citations

220

Authors

116

Institutions

Publications per year

2017–2026

14

Authors

220

  1. YP
    Yudi Pawitan

    Karolinska Institutet, Sweden

    2 publications · 76 citations

    2

    h-index

  2. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    2 publications · 41 citations

    2

    h-index

  3. RG
    Ricard Gavaldà

    Universitat Politècnica de Catalunya, Spain

    2 publications · 27 citations

    2

    h-index

  4. YH
    Yuxiong He

    Microsoft (United States), United States

    2 publications · 133 citations

    2

    h-index

  5. WT
    W.F. Tinney

    Bonneville Power Administration, United States

    2 publications · 192 citations

    2

    h-index

1–5 of 220

Venues

  1. SIAM Journal on Computing

    4 publications · 171 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 475 citations

    3

    h-index

  3. IEEE Transactions on Power Systems

    2 publications · 100 citations

    2

    h-index

  4. IEEE Access

    2 publications · 31 citations

    2

    h-index

  5. Statistics and Computing

    2 publications · 43 citations

    2

    h-index

1–5