%0 Journal Article %1 journals/jacm/AlistarhCS16 %A Alistarh, Dan %A Censor-Hillel, Keren %A Shavit, Nir %D 2016 %J J. ACM %K dblp %N 4 %P 31:1-31:20 %T Are Lock-Free Concurrent Algorithms Practically Wait-Free? %U http://dblp.uni-trier.de/db/journals/jacm/jacm63.html#AlistarhCS16 %V 63

@article{journals/jacm/AlistarhCS16, added-at = {2018-11-06T00:00:00.000+0100}, author = {Alistarh, Dan and Censor-Hillel, Keren and Shavit, Nir}, biburl = {https://www.bibsonomy.org/bibtex/2b6d7735c9ae486078061e6675d965b3e/dblp}, ee = {https://doi.org/10.1145/2903136}, interhash = {58e869c83fedbeea008baef615d5e6f4}, intrahash = {b6d7735c9ae486078061e6675d965b3e}, journal = {J. ACM}, keywords = {dblp}, number = 4, pages = {31:1-31:20}, timestamp = {2018-11-07T12:10:27.000+0100}, title = {Are Lock-Free Concurrent Algorithms Practically Wait-Free?}, url = {http://dblp.uni-trier.de/db/journals/jacm/jacm63.html#AlistarhCS16}, volume = 63, year = 2016 }