@article{Xu2017InformationTheoreticLB, title={Information-Theoretic Lower Bounds for Distributed Function Computation}, author={Aolin Xu and Maxim Raginsky}, journal={IEEE Transactions on Information Theory}, year={2017}, volume={63}, pages={2314-2337} }

- Published 2017 in IEEE Transactions on Information Theory
DOI:10.1109/TIT.2017.2664813

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the network initially has a random observation and aims to compute a common function of all observations to a given accuracy with… CONTINUE READING

### Presentations referencing similar topics