@InProceedings{bedin_et_al:LIPIcs.DISC.2021.11,
  author =	{B\'{e}din, Denis and L\'{e}pine, Fran\c{c}ois and Most\'{e}faoui, Achour and Perez, Damien and Perrin, Matthieu},
  title =	{{Wait-Free CAS-Based Algorithms: The Burden of the Past}},
  booktitle =	{35th International Symposium on Distributed Computing (DISC 2021)},
  pages =	{11:1--11:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-210-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{209},
  editor =	{Gilbert, Seth},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.11},
  URN =		{urn:nbn:de:0030-drops-148131},
  doi =		{10.4230/LIPIcs.DISC.2021.11},
  annote =	{Keywords: Compare-And-Swap, Concurrent Object, Infinite arrival model, Linearizability, Memory complexity, Multi-Threaded Systems, Shared-Memory, Universality, Wait-freedom}
}