Self-adjusting binary search trees
Journal of the ACM (JACM)
On the dynamic finger conjecture for splay trees
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Splaying a search tree in preorder takes linear time
ACM SIGACT News
On preorder splaying in binary search trees(abstract and references only)
CSC '91 Proceedings of the 19th annual conference on Computer Science
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
Randomized splay trees: theoretical and experimental results
Information Processing Letters
Improved Upper Bounds for Pairing Heaps
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On the sequential access theorem and deque conjecture for splay trees
Theoretical Computer Science
O(log log n)-competitive dynamic binary search trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
Dynamic optimality for skip lists and B-trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The geometry of binary search trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Upper bounds for maximally greedy binary search trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Poketree: a dynamically competitive data structure with good worst-case performance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A unifying property for distribution-sensitive priority queues
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
A priority queue with the time-finger property
Journal of Discrete Algorithms
A self-adjusting data structure for multidimensional point sets
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |