The wake up and report problem is time-equivalent to the firing squad synchronization problem

ISSN： 0178-2770

Source： Distributed Computing, Vol.17, Iss.1, 2004-02, pp. : 21-31

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On time optimal solutions of the firing squad synchronization problem for two-dimensional paths

By Kobayashi

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 129-143

Elsevier

Access to resources Recommend Favorite

On optimal solutions to the firing squad synchronization problem

By Mazoyer J.

Theoretical Computer Science, Vol. 168, Iss. 2, 1996-11 ,pp. : 367-404

Elsevier

Access to resources Recommend Favorite

Firing squad synchronization problem in reversible cellular automata

By Imai K. Morita K.

Theoretical Computer Science, Vol. 165, Iss. 2, 1996-10 ,pp. : 475-482

Elsevier

Access to resources Recommend Favorite

The Freeze-Tag Problem: How to Wake Up a Swarm of Robots

By Arkin Esther M. Bender Michael A. Fekete Sandor P. Mitchell Joseph S. B. Skutella Martin

Algorithmica, Vol. 46, Iss. 2, 2006-10 ,pp. : 193-221

Springer Publishing Company

Access to resources Recommend Favorite

Smaller solutions for the firing squad

By Settle A. Simon J.

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 83-109

Elsevier

Access to resources Recommend Favorite