%0 Conference Paper %1 conf/swat/BoseDDF10 %A Bose, Prosenjit %A Douïeb, Karim %A Dujmovic, Vida %A Fagerberg, Rolf %B SWAT %D 2010 %E Kaplan, Haim %I Springer %K dblp %P 38-49 %T An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. %U http://dblp.uni-trier.de/db/conf/swat/swat2010.html#BoseDDF10 %V 6139 %@ 978-3-642-13730-3

@inproceedings{conf/swat/BoseDDF10, added-at = {2018-11-02T00:00:00.000+0100}, author = {Bose, Prosenjit and Douïeb, Karim and Dujmovic, Vida and Fagerberg, Rolf}, biburl = {https://www.bibsonomy.org/bibtex/235b18bf06963b8bf688ce3549e0f36bf/dblp}, booktitle = {SWAT}, crossref = {conf/swat/2010}, editor = {Kaplan, Haim}, ee = {https://doi.org/10.1007/978-3-642-13731-0_5}, interhash = {fa3849cbf1d34cd6787c6acd361a7315}, intrahash = {35b18bf06963b8bf688ce3549e0f36bf}, isbn = {978-3-642-13730-3}, keywords = {dblp}, pages = {38-49}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T19:45:46.000+0200}, title = {An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.}, url = {http://dblp.uni-trier.de/db/conf/swat/swat2010.html#BoseDDF10}, volume = 6139, year = 2010 }