On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
From MaRDI portal
Publication:2910855
DOI10.1137/110821019zbMath1343.68027OpenAlexW1987003001MaRDI QIDQ2910855
Kojiro Kobayashi, Darin Goldstein
Publication date: 12 September 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/110821019
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network protocols (68M12)
Related Items (2)
Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization Problem ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares
This page was built for publication: On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
