The cost of fault tolerance in multi-party communication complexity

DOI10.1145/2332432.2332442MaRDI QIDQ2933776zbMATH OpenOpenAlexFDO

Authors Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gibbons

Publication date 5 December 2014

Published in Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2332432.2332442

zbMATH Keywords

aggregation functionsfault tolerancewireless networkscommunication complexitypromise problems

Mathematics Subject Classification ID

Applications of game theory (91A80) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• The cost of fault tolerance in multi-party communication complexity
• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
• Communication complexity of fault-tolerant information diffusion
• The price of low communication in secure multi-party computation

Cited in

(3)

• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions
• The cost of the missing bit: Communication complexity with help
• The cost of fault tolerance in multi-party communication complexity

This page was built for publication: The cost of fault tolerance in multi-party communication complexity

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