Faith Ellen, Panagiota Fatourou, Joanna Helga, and Eric Ruppert. 2014. The amortized complexity of non-blocking binary search trees. In Proceedings of the 2014 ACM symposium on Principles of distributed computing (PODC '14). Association for Computing Machinery, New York, NY, USA, 332–340. https://doi.org/10.1145/2611462.2611486
 
 
 

@inproceedings{10.1145/2611462.2611486,
author = {Ellen, Faith and Fatourou, Panagiota and Helga, Joanna and Ruppert, Eric},
title = {The Amortized Complexity of Non-Blocking Binary Search Trees},
year = {2014},
isbn = {9781450329446},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2611462.2611486},
doi = {10.1145/2611462.2611486},
booktitle = {Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing},
pages = {332–340},
numpages = {9},
keywords = {compare-and-swap, amortized analysis, concurrent, asynchronous, lock-free, binary search tree, non-blocking},
location = {Paris, France},
series = {PODC '14}
}