Optimal multi-broadcast with beeps using group testing

DOI10.1007/978-3-030-24922-9_5MaRDI QIDQ2303283zbMATH OpenOpenAlexFDO

Authors J. Beauquier, J. Burman, P. Davies, Fabien Dufoulon

Publication date 3 March 2020

Full work available at URL https://doi.org/10.1007/978-3-030-24922-9_5

zbMATH Keywords

beeping modelgroup testingmulti-broadcast

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Communicating with beeps
• Beeping a deterministic time-optimal leader election
• Brief Announcement
• Asynchronous broadcasting with bivalent beeps
• Design patterns in beeping algorithms

Cited in

(3)

• Optimal Message-Passing with Noisy Beeps
• Optimal message-passing with noisy beeps
• Beeping deterministic congest algorithms in graphs

This page was built for publication: Optimal multi-broadcast with beeps using group testing

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