The wake up and report problem is time-equivalent to the firing squad synchronization problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Smaller solutions for the firing squad
Theoretical Computer Science
Determination of the Topology of a Directed Network
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Traversing Directed Eulerian Mazes
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case
Programming and Computing Software
Determination of the topology of a directed network
Information Processing Letters
Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
Bounding the firing synchronization problem on a ring
Theoretical Computer Science
On the complexity of the “most general” firing squad synchronization problem
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On formulations of firing squad synchronization problems
UC'05 Proceedings of the 4th international conference on Unconventional Computation
On the complexity of network synchronization
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
| Hi-index | 0.00 |