Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg. An ::::O::::(log log ::::n::::)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. In Haim Kaplan, editor, Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings. Volume 6139 of Lecture Notes in Computer Science, pages 38-49, Springer, 2010. [doi]
@inproceedings{BoseDDF10,
title = {An ::::O::::(log log ::::n::::)-Competitive Binary Search Tree with Optimal Worst-Case Access Times},
author = {Prosenjit Bose and Karim Douïeb and Vida Dujmovic and Rolf Fagerberg},
year = {2010},
doi = {10.1007/978-3-642-13731-0_5},
url = {http://dx.doi.org/10.1007/978-3-642-13731-0_5},
tags = {search},
researchr = {https://researchr.org/publication/BoseDDF10},
cites = {0},
citedby = {0},
pages = {38-49},
booktitle = {Algorithm Theory - SWAT 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
editor = {Haim Kaplan},
volume = {6139},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-13730-3},
}