An overview of the firing squad synchronization problem
Proceedings on LITP spring school on Theoretical Computer Science on Automata networks
Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Election and traversal in unidirectional networks
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing unidirectional network algorithms by power-supply
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
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
Determination of the topology of a directed network
Information Processing Letters
Bounding the firing synchronization problem on a ring
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
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
| Hi-index | 0.00 |