On the Complexity of the Most General Firing Squad Synchronization Problem

Darin Goldstein, Kojiro Kobayashi. On the Complexity of the Most General Firing Squad Synchronization Problem. In Bruno Durand, Wolfgang Thomas, editors, STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings. Volume 3884 of Lecture Notes in Computer Science, pages 696-711, Springer, 2006. [doi]

@inproceedings{GoldsteinK06,
  title = {On the Complexity of the  Most General  Firing Squad Synchronization Problem},
  author = {Darin Goldstein and Kojiro Kobayashi},
  year = {2006},
  doi = {10.1007/11672142_57},
  url = {http://dx.doi.org/10.1007/11672142_57},
  tags = {synchronization},
  researchr = {https://researchr.org/publication/GoldsteinK06},
  cites = {0},
  citedby = {0},
  pages = {696-711},
  booktitle = {STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings},
  editor = {Bruno Durand and Wolfgang Thomas},
  volume = {3884},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-32301-5},
}