Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
General Splay: A Basic Theory and Calculus
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
Sphendamnœ: a proof that k-splay fails to achieve logk N behaviour
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient 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 |