Efficient Information Exchange in the Random Phone-Call Model
From MaRDI portal
Publication:3587433
DOI10.1007/978-3-642-14162-1_11zbMATH Open1288.68008OpenAlexW1666717679MaRDI QIDQ3587433FDOQ3587433
Authors: Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gąsieniec 
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_11
Recommendations
- Asymptotically optimal communication in simple mechanisms
- Information Transmission under Random Emission Constraints
- Optimal multiple message broadcasting in telephone-like communication systems
- Optimal algorithms for dissemination of information in generalized communication modes
- scientific article; zbMATH DE number 762962
- Information transmission in stationary stochastic systems
- Efficient communication procedure for resource allocation under uncertainty
- Maximal information propagation via lotteries
- Constrained information transmission on Erdős-Rényi graphs
- scientific article; zbMATH DE number 4062584
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
Cited In (8)
- Randomised broadcasting: memory vs. randomness
- Self-stabilizing repeated balls-into-bins
- Network Creation Games with Local Information and Edge Swaps
- Gossip in a smartphone peer-to-peer network
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Almost Safe Gossiping in Bounded Degree Networks
- Who started this rumor? Quantifying the natural differential privacy of gossip protocols
- Distributed computation in dynamic networks via random walks
This page was built for publication: Efficient Information Exchange in the Random Phone-Call Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3587433)
