Self-adjusting binary search trees
Journal of the ACM (JACM)
Alternatives to splay trees with O(log n) worst-case access times
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Distribution-sensitive data structures
Distribution-sensitive data structures
Lower bounds for accessing binary search trees with rotations
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, key-independent optimality, is motivated by applications that assign key values randomly. It is shown that any data structure that is key-independently optimal is expected to execute any access sequence where the key values are assigned arbitrarily to unordered data as fast as any offline binary search tree algorithm, within a multiplicative constant. Asymptotically tight upper and lower bounds are presented for key-independent optimality. Splay trees are shown to be key-independently optimal.