Distributed Function Computation

Distributed Function Computation is a theoretical framework in network information theory that characterizes the fundamental limits of computing functions of multiple distributed sources over communication networks, distinguished by the explicit consideration of the trade-offs between computation accuracy, communication rates, and network topology.

88

Publications

5.6K

Citations

166

Authors

98

Institutions

Publications per year

2017–2026

16

Authors

166

  1. NM
    Nan Ma

    Beijing University of Posts and Telecommunications, China

    6 publications · 267 citations

    6

    h-index

  2. PI
    Prakash Ishwar

    Boston University, United States

    6 publications · 267 citations

    6

    h-index

  3. SS
    Shreyas Sundaram

    Purdue University West Lafayette, United States

    4 publications · 635 citations

    4

    h-index

  4. AO
    Alex Olshevsky

    University of Illinois Urbana-Champaign, United States

    4 publications · 151 citations

    4

    h-index

  5. DM
    D. Manjunath

    Indian Institute of Technology Bombay, India

    4 publications · 67 citations

    4

    h-index

1–5 of 166

Venues

  1. IEEE Transactions on Information Theory

    11 publications · 647 citations

    11

    h-index

  2. arXiv (Cornell University)

    Repository · 7 publications · 404 citations

    7

    h-index

  3. 4

    h-index

  4. IEEE Transactions on Automatic Control

    3 publications · 584 citations

    3

    h-index

  5. ArXiv.org

    Repository · 2 publications · 41 citations

    2

    h-index

1–5