Faster computation on directed networks of automata
From MaRDI portal
Publication:5361433
DOI10.1145/224964.224969zbMath1373.68222OpenAlexW1992093845MaRDI QIDQ5361433
Daniel Shawcross Wilkerson, Rafail Ostrovsky
Publication date: 29 September 2017
Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/224964.224969
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Bounding the firing synchronization problem on a ring ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ On the Microscopic View of Time and Messages ⋮ Determination of the topology of a directed network ⋮ Smaller solutions for the firing squad
This page was built for publication: Faster computation on directed networks of automata