Are Lock-Free Concurrent Algorithms Practically Wait-Free?
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/jacm/AlistarhCS16
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/jacm/AlistarhCS16
>
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%2F2903136
>
foaf:
homepage
<
https://doi.org/10.1145/2903136
>
dc:
identifier
DBLP journals/jacm/AlistarhCS16
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F2903136
(xsd:string)
dcterms:
issued
2016
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/jacm
>
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:
number
4
(xsd:string)
swrc:
pages
31:1-31:20
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/jacm/AlistarhCS16/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/jacm/AlistarhCS16
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/jacm/jacm63.html#AlistarhCS16
>
rdfs:
seeAlso
<
https://doi.org/10.1145/2903136
>
dc:
title
Are Lock-Free Concurrent Algorithms Practically Wait-Free?
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
63
(xsd:string)