Are lock-free concurrent algorithms practically wait-free?
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/stoc/AlistarhCS14
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlistarhCS14
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Dan_Alistarh
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Keren_Censor-Hillel
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nir_Shavit
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F2591796.2591836
>
foaf:
homepage
<
https://doi.org/10.1145/2591796.2591836
>
dc:
identifier
DBLP conf/stoc/AlistarhCS14
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F2591796.2591836
(xsd:string)
dcterms:
issued
2014
(xsd:gYear)
rdfs:
label
Are lock-free concurrent algorithms practically wait-free?
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Dan_Alistarh
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Keren_Censor-Hillel
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nir_Shavit
>
swrc:
pages
714-723
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/stoc/2014
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/stoc/AlistarhCS14/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/stoc/AlistarhCS14
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/stoc/stoc2014.html#AlistarhCS14
>
rdfs:
seeAlso
<
https://doi.org/10.1145/2591796.2591836
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/stoc
>
dc:
title
Are lock-free concurrent algorithms practically wait-free?
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document