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
Parents
88
Computing on an anonymous ring
Hagit Attiya, Marc Snir, Manfred K. Warmuth · Journal of the ACM · 1988 · 219 citations · Full text
1–5 of 88
166
6
h-index
6
h-index
4
h-index
4
h-index
4
h-index
1–5 of 166
98
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
22 publications
2.3K citations
Massachusetts Institute of Technology
Cambridge, United States
7 h-index
12 publications
723 citations
Boston University
Boston, United States
6 h-index
11 publications
537 citations

Indian Institute of Technology Bombay
Mumbai, India
5 h-index
8 publications
143 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
8 publications
573 citations
University of California, Berkeley
Berkeley, United States
3 h-index
3 publications
175 citations
University of Chicago
Chicago, United States
3 h-index
15 publications
1.6K citations
Stanford University
Stanford, United States
3 h-index
3 publications
428 citations
1–8 of 98
11 publications · 647 citations
11
h-index
Repository · 7 publications · 404 citations
7
h-index
4 publications · 432 citations
4
h-index
3 publications · 584 citations
3
h-index
Repository · 2 publications · 41 citations
2
h-index
1–5