Priority Queues, Pairing, and Adaptive Sorting
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Adaptive Sorting and the Information Theoretic Lower Bound
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Proximate planar point location
Proceedings of the nineteenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
O(log log n)-competitive dynamic binary search trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
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
Bulk-Insertion Sort: Towards Composite Measures of Presortedness
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Rank-Sensitive Priority Queues
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
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
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Upper bounds for maximally greedy binary search trees
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 empirical study for inversions-sensitive sorting algorithms
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A unifying property for distribution-sensitive priority queues
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
A priority queue with the time-finger property
Journal of Discrete Algorithms
A self-adjusting data structure for multidimensional point sets
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
The following result is shown: On an n-node splay tree, the amortized cost of an access at distance d from the preceding access is O(log (d+1)). In addition, there is an O(n) initialization cost. The accesses include searches, insertions, and deletions.