Bounding the firing synchronization problem on a ring
From MaRDI portal
Publication:596090
DOI10.1016/j.tcs.2004.01.036zbMath1068.68085OpenAlexW2024190852MaRDI QIDQ596090
Janos Simon, Todd Bittner, André Berthiaume, Amber Settle, Ljubomir Perković
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://works.bepress.com/asettle/56
Related Items (3)
An Adaptive Algorithm for P System Synchronization ⋮ The minimum firing time of the generalized firing squad synchronization problem for squares ⋮ A new class of the smallest FSSP partial solutions for 1D rings of length \(n=2^k-1\)
Cites Work
- Unnamed Item
- A six-state minimal time solution to the Firing squad synchronization problem
- Variations of the firing squad problem and applications
- The firing squad synchronization problem for graphs
- Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position
- The firing squad synchronization problem for a class of polyautomata networks
- Smaller solutions for the firing squad
- An 8-state minimal time solution to the firing squad synchronization problem
- An optimum solution to the firing squad synchronization problem
- Computing with Snakes in Directed Networks of Automata
- Faster computation on directed networks of automata
- A generalized firing squad problem
This page was built for publication: Bounding the firing synchronization problem on a ring
