Dan Alistarh, Keren Censor-Hillel, Nir Shavit
Are lock-free concurrent algorithms practically wait-free?
STOC, 2014.
@inproceedings{STOC-2014-AlistarhCS, author = "Dan Alistarh and Keren Censor-Hillel and Nir Shavit", booktitle = "{Proceedings of the 46th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/2591796.2591836", isbn = "978-1-4503-2710-7", pages = "714--723", publisher = "{ACM}", title = "{Are lock-free concurrent algorithms practically wait-free?}", year = 2014, }