@InProceedings{shafiei:LIPIcs.OPODIS.2015.35,
  author =	{Shafiei, Niloufar},
  title =	{{Non-Blocking Doubly-Linked Lists with Good Amortized Complexity}},
  booktitle =	{19th International Conference on Principles of Distributed Systems (OPODIS 2015)},
  pages =	{35:1--35:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-98-9},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{46},
  editor =	{Anceaume, Emmanuelle and Cachin, Christian and Potop-Butucaru, Maria},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2015.35},
  URN =		{urn:nbn:de:0030-drops-66787},
  doi =		{10.4230/LIPIcs.OPODIS.2015.35},
  annote =	{Keywords: non-blocking data structure, doubly-linked list, shared memory, amortized complexity, cursor}
}