Smaller solutions for the firing squad

Author： Settle A.   Simon J.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Abstract

Related content

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

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

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 wake up and report problem is time-equivalent to the firing squad synchronization problem

By Goldstein Darin   Meyer Nick  

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

Springer Publishing Company

Access to resources Recommend Favorite

Universality of the chip-firing game

By Goles E.   Margenstern M.  

Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. : 121-134

Elsevier

Access to resources Recommend Favorite