Computation Trade-offs

Computation Trade-Offs is a framework in the study of communication overhead that systematically characterizes the balance between computational complexity and communication cost in distributed systems, distinguishing itself by formalizing how increased computation can reduce message exchange while optimizing overall performance.

52

Publications

4.4K

Citations

134

Authors

66

Institutions

Publications per year

2017–2026

28

Authors

134

  1. AS
    A. Salman Avestimehr

    University of Southern California, United States

    5 publications · 764 citations

    5

    h-index

  2. MA
    Mohammad Ali Maddah-Ali

    University of Southern California, United States

    5 publications · 764 citations

    5

    h-index

  3. SL
    Songze Li

    University of Southern California, United States

    5 publications · 764 citations

    5

    h-index

  4. NW
    Nicholas Woolsey

    University of Utah, United States

    4 publications · 110 citations

    4

    h-index

  5. RC
    Rong‐Rong Chen

    University of Utah, United States

    4 publications · 110 citations

    4

    h-index

1–5 of 134

Venues

  1. arXiv (Cornell University)

    Repository · 10 publications · 252 citations

    10

    h-index

  2. IEEE Transactions on Communications

    3 publications · 70 citations

    3

    h-index

  3. Communications of the ACM

    2 publications · 89 citations

    2

    h-index

  4. SIAM Journal on Computing

    2 publications · 115 citations

    2

    h-index

  5. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 135 citations

    1

    h-index

1–5