The wake up and report problem is time-equivalent to the firing squad synchronization problem

DOI10.1007/s00446-003-0095-7zbMath1448.68102arXivcs/0310003OpenAlexW3136821704MaRDI QIDQ5138501

Nick Meyer, Darin Goldstein

Publication date: 4 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Data structures (68P05) Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The firing squad synchronization problem for graphs
• The firing squad synchronization problem for a class of polyautomata networks
• Self-Stabilizing Symmetry Breaking in Constant Space
• Distributed network protocols
• Distributed Algorithms For Unidirectional Networks
• Computing with Snakes in Directed Networks of Automata
• Memory-efficient and self-stabilizing network RESET (extended abstract)
• Faster computation on directed networks of automata

This page was built for publication: The wake up and report problem is time-equivalent to the firing squad synchronization problem