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

From MaRDI portal
Revision as of 05:00, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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