On the Complexity of the “Most General” Firing Squad Synchronization Problem

DOI10.1007/11672142_57zbMath1136.68343OpenAlexW1891183588MaRDI QIDQ5449842

Kojiro Kobayashi, Darin Goldstein

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Network protocols (68M12)

This page was built for publication: On the Complexity of the “Most General” Firing Squad Synchronization Problem