"Are lock-free concurrent algorithms practically wait-free?"

Dan Alistarh, Keren Censor-Hillel, Nir Shavit (2014)

> Home

Details and statistics

DOI: 10.1145/2591796.2591836

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/AlistarhCS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/AlistarhCS14
Dan Alistarh, Keren Censor-Hillel, Nir Shavit:
Are lock-free concurrent algorithms practically wait-free? STOC 2014: 714-723

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.