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
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
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
| Hi-index | 0.00 |