An ::::O::::(log log ::::n::::)-Competitive Binary Search Tree with Optimal Worst-Case Access Times

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]

Abstract

Abstract is missing.