Abstract
In this paper we examine noisy radio (broadcast) networks in which every bit transmitted has a certain probability to be flipped. Each processor has some initial input bit, and the goal is to compute a function of the initial inputs. In this model we show a protocol to compute any threshold function using only a linear number of transmissions.
| Original language | English |
|---|---|
| Pages | 236-243 |
| Number of pages | 8 |
| State | Published - 1998 |
| Externally published | Yes |
| Event | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: 25 Jan 1998 → 27 Jan 1998 |
Conference
| Conference | Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms |
|---|---|
| City | San Francisco, CA, USA |
| Period | 25/01/98 → 27/01/98 |