Unique binary search tree representations and equality-testing of sets and sequences
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Adaptive heuristics for binary search trees and constant linkage cost
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Static optimality and dynamic search-optimality in lists and trees
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Right-arm rotation distance between binary trees
Information Processing Letters
O(log log n)-competitive dynamic binary search trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Rotational tree structures on binary trees and triangulations
Acta Cybernetica
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
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
The cost of offline binary search tree algorithms and the complexity of the request sequence
Theoretical Computer Science
The geometry of binary search trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Sphendamnœ: a proof that k-splay fails to achieve logk N behaviour
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Upper bounds for maximally greedy binary search trees
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
On the matter of dynamic optimality in an extended model for tree access operations
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
An O(log log n)-competitive binary search tree with optimal worst-case access times
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Poketree: a dynamically competitive data structure with good worst-case performance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |