ACM Principles of Distributed Computing, PODC 2014


Article Details
Title: Brief announcement: are lock-free concurrent algorithms practically wait-free?
Article URLs:
Alternative Article URLs:
Authors: Dan Alistarh
  • Microsoft Research
Keren Censor-Hillel
  • Technion - Israel Institute of Technology
Nir Shavit
  • Massachusetts Institute of Technology
  • Tel Aviv University
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1217921, 1301926
DBLP Key: conf/podc/AlistarhCS14
Author Comments:

Discuss this paper and its artifacts below