The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
On self-organizing sequential search heuristics
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
A compendium of key search references
ACM SIGIR Forum
Adaptive heuristics for binary search trees and constant linkage cost
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Randomized binary search trees
Journal of the ACM (JACM)
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Index maintenance for non-uniform record distributions
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Adaptive Structuring of Binary Search Trees Using Conditional Rotations
IEEE Transactions on Knowledge and Data Engineering
General Splay: A Basic Theory and Calculus
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On using conditional rotations and randomized heuristics for self-organizing ternary search tries
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying
Information Processing Letters
ACM Transactions on Software Engineering and Methodology (TOSEM)
On Using Adaptive Binary Search Trees to Enhance Self Organizing Maps
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Sphendamnœ: a proof that k-splay fails to achieve logk N behaviour
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
SIAM Journal on Computing
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Comparative performance evaluation of the AVL and red-black trees
Proceedings of the Fifth Balkan Conference in Informatics
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.01 |