@InProceedings{winblad:OASIcs.ICCSW.2017.7,
  author =	{Winblad, Kjell},
  title =	{{Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data}},
  booktitle =	{2017 Imperial College Computing Student Workshop (ICCSW 2017)},
  pages =	{7:1--7:13},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-059-0},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{60},
  editor =	{Leahy, Fergus and Franco, Juliana},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICCSW.2017.7},
  URN =		{urn:nbn:de:0030-drops-84492},
  doi =		{10.4230/OASIcs.ICCSW.2017.7},
  annote =	{Keywords: linearizability, concurrent data structures, treap}
}