Panagiota Fatourou, Elias Papavasileiou, and Eric Ruppert. 2019. Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '19). Association for Computing Machinery, New York, NY, USA, 275–286. https://doi.org/10.1145/3323165.3323197
 
 

@inproceedings{10.1145/3323165.3323197,

author = {Fatourou, Panagiota and Papavasileiou, Elias and Ruppert, Eric},

title = {Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries},

year = {2019},

isbn = {9781450361842},

publisher = {Association for Computing Machinery},

address = {New York, NY, USA},

url = {https://doi.org/10.1145/3323165.3323197},

doi = {10.1145/3323165.3323197},

booktitle = {The 31st ACM Symposium on Parallelism in Algorithms and Architectures},

pages = {275–286},

numpages = {12},

keywords = {wait-free, shared-memory, persistence, binary search tree, range query, asynchronous, linearizable},

location = {Phoenix, AZ, USA},

series = {SPAA '19}

}