A Concurrency-Optimal Binary Search Tree

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi. A Concurrency-Optimal Binary Search Tree. In Francisco F. Rivera, Tomás F. Pena, José Carlos Cabaleiro, editors, Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28 - September 1, 2017, Proceedings. Volume 10417 of Lecture Notes in Computer Science, pages 580-593, Springer, 2017. [doi]

@inproceedings{AksenovGKMR17,
  title = {A Concurrency-Optimal Binary Search Tree},
  author = {Vitaly Aksenov and Vincent Gramoli and Petr Kuznetsov and Anna Malova and Srivatsan Ravi},
  year = {2017},
  doi = {10.1007/978-3-319-64203-1_42},
  url = {https://doi.org/10.1007/978-3-319-64203-1_42},
  researchr = {https://researchr.org/publication/AksenovGKMR17},
  cites = {0},
  citedby = {0},
  pages = {580-593},
  booktitle = {Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28 - September 1, 2017, Proceedings},
  editor = {Francisco F. Rivera and Tomás F. Pena and José Carlos Cabaleiro},
  volume = {10417},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-64203-1},
}