An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
From MaRDI portal
Publication:3569877
DOI10.1007/978-3-642-13731-0_5zbMath1285.68041OpenAlexW3122708175MaRDI QIDQ3569877
Rolf Fagerberg, Karim Douïeb, Prosenjit Bose, Vida Dujmović
Publication date: 22 June 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_5
Related Items (3)
Better analysis of binary search tree on decomposable sequences ⋮ Unnamed Item ⋮ A History of Distribution-Sensitive Data Structures
This page was built for publication: An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
