ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: Are lock-free concurrent algorithms practically wait-free?
Article URLs:
Alternative Article URLs:
Authors: Dan Alistarh
  • MSR Cambridge
Keren Censor-Hillel
  • Technion
Nir Shavit
  • MIT
  • 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/stoc/AlistarhCS14
Author Comments:

Discuss this paper and its artifacts below