On the Complexity of Network Synchronization

DOI10.1137/S0097539705447086zbMath1095.68042OpenAlexW2037373921MaRDI QIDQ5470703

Kojiro Kobayashi, Darin Goldstein

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539705447086

zbMATH Keywords

firing squad synchronization problemnetwork synchronizationdistributed computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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 the Complexity of Network Synchronization