Work-efficient Algorithms

Work-Efficient Algorithms is a class of parallel algorithms that belong to the broader category of scalable algorithmic designs, distinguished by their property of performing asymptotically no more total work than the best-known sequential algorithm for the same problem.

48

Publications

2.4K

Citations

119

Authors

67

Institutions

Publications per year

2017–2026

8

Authors

119

  1. KP
    Keshav Pingali

    The University of Texas at Austin, United States

    3 publications · 119 citations

    3

    h-index

  2. PB
    Phillip B. Gibbons

    Carnegie Mellon University, United States

    3 publications · 591 citations

    3

    h-index

  3. VP
    Viswanath Poosala

    Nokia (United States), United States

    2 publications · 536 citations

    2

    h-index

  4. MA
    Muhammad Amber Hassaan

    The University of Texas at Austin, United States

    2 publications · 91 citations

    2

    h-index

  5. GM
    Grzegorz Malewicz

    Google (United States), United States

    2 publications · 27 citations

    2

    h-index

1–5 of 119

Venues

  1. SIAM Journal on Computing

    3 publications · 98 citations

    3

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 3 publications · 47 citations

    3

    h-index

  3. Journal of the ACM

    JACM · 3 publications · 397 citations

    3

    h-index

  4. ACM SIGPLAN Notices

    1 publications · 34 citations

    1

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 28 citations

    1

    h-index

1–5