On efficient unsuccessful search
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
Dynamic optimality for skip lists and B-trees
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Hi-index | 0.89 |