Optimal Message-Passing with Noisy Beeps

DOI10.1145/3583668.3594594arXiv2303.15346OpenAlexW4380874761MaRDI QIDQ6202266

Peter Davies

Publication date: 26 March 2024

Published in: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.15346

zbMATH Keywords

message passingsuperimposed codesbeeping model

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Almost cover-free codes and designs
• On the upper bound of the size of the \(r\)-cover-free families
• On \(r\)-cover-free families
• Optimal multi-broadcast with beeps using group testing
• Leader election in multi-hop radio networks
• Beeping a maximal independent set
• Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
• A Biological Solution to a Fundamental Distributed Computing Problem
• The Locality of Distributed Symmetry Breaking
• Fundamentals of Error-Correcting Codes
• Deploying Wireless Networks with Beeps
• A Simple Parallel Algorithm for the Maximal Independent Set Problem
• An Improved Distributed Algorithm for Maximal Independent Set
• Distributed Approximate Maximum Matching in the CONGEST Model.
• Some simple distributed algorithms for sparse networks
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Nonrandom binary superimposed codes
• Near Optimal Leader Election in Multi-Hop Radio Networks
• Can Uncoordinated Beeps tell Stories?
• Efficient randomized distributed coloring in CONGEST

This page was built for publication: Optimal Message-Passing with Noisy Beeps