Combining Binary Search Trees
Name
Demaine_Combining binary.pdf
Size
329.06 KB
Format
Adobe PDF
Checksum (MD5)
f14c44a1a0a87b2278e68efcec0d2843
Author(s)
Demaine, Erik D.
Iacono, John
Langerman, Stefan
Ozkan, Ozgur
Date Issued
July 2013
Journal
Automata, Languages, and Programming
Publisher
Springer-Verlag
Citation
Demaine, Erik D., John Iacono, Stefan Langerman, and Ozgur Ozkan. “Combining Binary Search Trees.” Lecture Notes in Computer Science (2013): 388–399.
Version
Author's final manuscript
Abstract
We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “well-behaved” bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its bound satisfies a weak sense of closure under subsequences.) In particular, we obtain a BST data structure that is O(loglogn) competitive, satisfies the working set bound (and thus satisfies the static finger bound and the static optimality bound), satisfies the dynamic finger bound, satisfies the unified bound with an additive O(loglogn) factor, and performs each access in worst-case O(logn) time.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-642-39206-1_33
