Cite
HARVARD Citation
Hesselink, W. (2016). Correctness and concurrent complexity of the Black-White Bakery Algorithm. Formal aspects of computing. pp. 325-341. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Hesselink, W. (2016). Correctness and concurrent complexity of the Black-White Bakery Algorithm. Formal aspects of computing. pp. 325-341. [Online].