Wait-freedom is harder than lock-freedom under strong linearizability

DOI10.1007/978-3-662-48653-5_5zbMath1394.68432OpenAlexW2235750182MaRDI QIDQ1664128

Philipp Woelfel, Oksana Denysyuk

Publication date: 24 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-662-48653-5_5

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (1)

Randomized consensus with regular registers

This page was built for publication: Wait-freedom is harder than lock-freedom under strong linearizability