Theoretical Computer Science

DOI10.1007/11560586MaRDI QIDQ5395072zbMATH OpenOpenAlexFDO

Authors Giovanni Sburlati, Gianluca De Marco, Marco Pellegrini

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11560586

zbMATH Keywords

Algorithmsclockmultiple access channelsynchronywakeup problem

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Faster deterministic wakeup in multiple access channels
• The wakeup problem in synchronous broadcast systems
• Scalable wake-up of multi-channel single-hop radio networks
• The wakeup problem in synchronous broadcast systems (extended abstract)
• scientific article; zbMATH DE number 1979528

Cited in

(7)

• Global synchronization and consensus using beeps in a fault-prone multiple access channel
• The wakeup problem in synchronous broadcast systems
• The cost of synchronizing multiple-access channels
• Consensus and Mutual Exclusion in a Multiple Access Channel
• The wakeup problem in synchronous broadcast systems (extended abstract)
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• Faster deterministic wakeup in multiple access channels

This page was built for publication: Theoretical Computer Science

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