The wake up and report problem is time-equivalent to the firing squad synchronization problem
type: Item
instance of: scholarly article
title: The wake up and report problem is time-equivalent to the firing squad synchronization problem
zbMATH Open document ID: 1448.68102
author: Darin Goldstein
author: Nick Meyer
published in: Distributed Computing
publication date: 2020-12-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/cs/0310003
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 7282011
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3136821704
arXiv ID: cs/0310003
cites work: Distributed Algorithms For Unidirectional Networks
cites work: Memory-efficient and self-stabilizing network RESET (extended abstract)
cites work: Computing with Snakes in Directed Networks of Automata
cites work: The firing squad synchronization problem for graphs
cites work: The firing squad synchronization problem for a class of polyautomata networks
cites work: Self-Stabilizing Symmetry Breaking in Constant Space
cites work: Q3753491
cites work: Q5590814
cites work: Q5525259
cites work: Faster computation on directed networks of automata
cites work: Distributed network protocols
DOI: 10.1007/S00446-003-0095-7
description: scientific article; zbMATH DE number 7282011