Beeping deterministic congest algorithms in graphs

DOI10.4230/LIPICS.ESA.2025.20MaRDI QIDQ7322408zbMATH OpenFDO

Authors P. Garncarek, Dariusz R. Kowalski, Shay Kutten, Miguel A. Mosteiro

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.20

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A biological solution to a fundamental distributed computing problem
• Asynchronous broadcasting with bivalent beeps
• Beeping a deterministic time-optimal leader election
• Beeping a maximal independent set
• Brief Announcement: Noisy Beeping Networks
• Deploying wireless networks with beeps
• Design patterns in beeping algorithms: examples, emulation, and analysis
• Distributed Computing: A Locality-Sensitive Approach
• Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
• Fundamentals of Computation Theory
• Global synchronization and consensus using beeps in a fault-prone multiple access channel
• scientific article; zbMATH DE number 7788511 (Why is no real title available?)
• Interactive coding over the noisy broadcast channel
• Naming a channel with beeps
• Near optimal leader election in multi-hop radio networks
• Optimal Message-Passing with Noisy Beeps
• Optimal multi-broadcast with beeps using group testing
• Optimal Two-Stage Algorithms for Group Testing Problems
• Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution
• The neuron as a direct data-driven controller

This page was built for publication: Beeping deterministic congest algorithms in graphs

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