Computation Over the Noisy Broadcast Channel with Malicious Parties

[1]  Klim Efremenko,et al.  Interactive coding over the noisy broadcast channel , 2018, Electron. Colloquium Comput. Complex..

[2]  Leonard J. Schulman,et al.  A coding theorem for distributed computation , 1994, STOC '94.

[3]  Uriel Feige,et al.  Finding OR in a noisy broadcast network , 2000, Inf. Process. Lett..

[4]  Ilan Newman,et al.  Computing in fault tolerance broadcast networks , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[5]  Leonard J. Schulman,et al.  Deterministic coding for interactive communication , 1993, STOC.

[6]  Alexandr Andoni,et al.  Approximate Nearest Neighbor Search in High Dimensions , 2018, Proceedings of the International Congress of Mathematicians (ICM 2018).

[7]  Noga Alon,et al.  Reliable communication over highly connected noisy networks , 2016, Distributed Computing.

[8]  Leonard J. Schulman.  Coding for interactive communication , 1996, IEEE Trans. Inf. Theory.

[9]  Mark Braverman,et al.  Constant-Rate Coding for Multiparty Interactive Communication Is Impossible , 2017, J. ACM.

[10]  Thomas M. Cover,et al.  Open Problems in Communication and Computation , 2011, Springer New York.

[11]  Leonard J. Schulman,et al.  Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[12]  Andrzej Pelc,et al.  Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel , 2020, Theor. Comput. Sci..

[13]  Alexandr Andoni,et al.  Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[14]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[15]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[16]  Guy Kindler,et al.  Lower Bounds for the Noisy Broadcast Problem , 2008, SIAM J. Comput..

[17]  Robert G. Gallager,et al.  Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.