Are lock-free concurrent algorithms practically wait-free?
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Dan Alistarh, Keren Censor-Hillel, Nir Shavit
Are lock-free concurrent algorithms practically wait-free?
STOC, 2014.

STOC 2014
DBLP
Scholar
DOI
Full names Links ISxN
@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,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.