Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position

From MaRDI portal
Publication:1170036

DOI10.1016/0304-3975(82)90040-8zbMath0496.68037OpenAlexW2051579987MaRDI QIDQ1170036

Helge Szwerinski

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90040-8




Related Items (18)



Cites Work




This page was built for publication: Time-optimal solution of the firing-squad-synchronization-problem for n- dimensional rectangles with the general at an arbitrary position