Time and Energy Complexity of Function Computation Over Networks

DOI10.1109/TIT.2011.2168902MaRDI QIDQ5272192zbMATH OpenFDO

Authors Nikhil Karamchandani, Rathinakumar Appuswamy, Massimo Franceschetti

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2011.2168902

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Measures of information, entropy (94A17) Analytic circuit theory (94C05)

Recommendations

• Energy-optimal algorithms for computing aggregative functions in random networks
• The complexity of computations by networks
• scientific article; zbMATH DE number 3848612
• The communication complexity of computing differentiable functions in a multicomputer network
• Lower bounds for in-network computation of arbitrary functions
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits
• scientific article; zbMATH DE number 3958737

Cited in

(2)

• Lower bounds for in-network computation of arbitrary functions
• Time-space tradeoffs for computing functions, using connectivity properties of their circuits

This page was built for publication: Time and Energy Complexity of Function Computation Over Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272192)