Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
151
Voted
SWAT
2010
Springer
270
views
Algorithms
»
more
SWAT 2010
»
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
15 years 8 months ago
Download
cgm.cs.mcgill.ca
We present the zipper tree, the first O(log log n)-competitive online binary search tree that performs each access in O(log n) worst-case time. This shows that for binary search ...
Prosenjit Bose, Karim Douïeb, Vida Dujmovic, ...
claim paper
Read More »