A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Algorithms for Noisy Broadcast with Erasures
2018
International Colloquium on Automata, Languages and Programming
The noisy broadcast model was first studied by [10] where an n-character input is distributed among n processors, so that each processor receives one input bit. Computation proceeds in rounds, where in each round each processor broadcasts a single character, and each reception is corrupted independently at random with some probability p. [10] gave an algorithm for all processors to learn the input in O(log log n) rounds with high probability. Later, a matching lower bound of Ω(log log n) was
doi:10.4230/lipics.icalp.2018.153
dblp:conf/icalp/GrossmanHM18
fatcat:r5v3mywrofa6nf7zq5gz5rgeui