Noisy Beeps

DOI10.1145/3382734.3404501MaRDI QIDQ5855266zbMATH OpenOpenAlexFDO

Authors Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena

Publication date 15 March 2021

Published in Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

zbMATH Keywords

beeping modelscommunication complexitydistributed systemserror-correcting codesinteractive codinglower bounds

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(4)

• Noisy beeping networks
• Information dissemination via broadcasts in the presence of adversarial noise
• Near-optimal fault tolerance for efficient batch matrix multiplication via an additive combinatorics lens
• Loud shot noise

This page was built for publication: Noisy Beeps

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