@InProceedings{he_et_al:LIPIcs.OPODIS.2016.34,
author = {He, Meng and Li, Mengdu},
title = {{Deletion without Rebalancing in Non-Blocking Binary Search Trees}},
booktitle = {20th International Conference on Principles of Distributed Systems (OPODIS 2016)},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-031-6},
ISSN = {1868-8969},
year = {2017},
volume = {70},
editor = {Fatourou, Panagiota and Jim\'{e}nez, Ernesto and Pedone, Fernando},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2016.34},
URN = {urn:nbn:de:0030-drops-71032},
doi = {10.4230/LIPIcs.OPODIS.2016.34},
annote = {Keywords: concurrent data structures, non-blocking data structures, lock-free data structures, self-balancing binary search trees, relaxed AVL trees}
}