---
res:
  bibo_abstract:
  - Although a wide variety of handcrafted concurrent data structures have been proposed,
    there is considerable interest in universal approaches (Universal Constructions
    or UCs) for building concurrent data structures. UCs (semi-)automatically convert
    a sequential data structure into a concurrent one. The simplest approach uses
    locks [3, 6] that protect a sequential data structure and allow only one process
    to access it at a time. However, the resulting data structure is blocking. Most
    work on UCs instead focuses on obtaining non-blocking progress guarantees such
    as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have
    appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware
    UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et
    al.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vitaly
      foaf_name: Aksenov, Vitaly
      foaf_surname: Aksenov
  - foaf_Person:
      foaf_givenName: Trevor A
      foaf_name: Brown, Trevor A
      foaf_surname: Brown
      foaf_workInfoHomepage: http://www.librecat.org/personId=3569F0A0-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Alexander
      foaf_name: Fedorov, Alexander
      foaf_surname: Fedorov
      foaf_workInfoHomepage: http://www.librecat.org/personId=2e711909-896a-11ed-bdf8-eb0f5a2984c6
  - foaf_Person:
      foaf_givenName: Ilya
      foaf_name: Kokorin, Ilya
      foaf_surname: Kokorin
  bibo_doi: 10.1145/3572848.3577512
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/9798400700156
  dct_language: eng
  dct_publisher: Association for Computing Machinery@
  dct_title: Unexpected scaling in path copying trees@
...