Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
The pairing heap: a new form of self-adjusting heap
Algorithmica
Sequential access in splay trees takes linear time
Combinatorica
Lower bounds for accessing binary search trees with rotations
SIAM Journal on Computing
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
Postorder disjoint set union is linear
SIAM Journal on Computing
Generalized Davenport-Schinzel sequences with linear upper bound
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
SIAM Journal on Computing
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing
On the efficiency of pairing heaps and related data structures
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
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
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences
SIAM Journal on Computing
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing
On the sequential access theorem and deque conjecture for splay trees
Theoretical Computer Science
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Towards a Final Analysis of Pairing Heaps
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
O(log log n)-competitive dynamic binary search trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
How to splay for loglogn-competitiveness
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The geometry of binary search trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
Journal of the ACM (JACM)
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
Generalized Davenport-Schinzel sequences and their 0-1 matrix counterparts
Journal of Combinatorial Theory Series A
On the structure and composition of forbidden sequences, with geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Origins of Nonlinearity in Davenport-Schinzel Sequences
SIAM Journal on Discrete Mathematics
Heap slicing using type systems
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
A self-adjusting data structure for multidimensional point sets
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Sharp bounds on Davenport-Schinzel sequences of every order
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree as a Davenport-Schinzel sequence, none of whose subsequences are isomorphic to a fixed forbidden subsequence. We direct this technique towards Tarjan's deque conjecture and prove that n deque operations take only O(nα*(n)) time, where α* (n) is the minimum number of applications of the inverse-Ackermann function mapping n to a constant. We are optimistic that this approach could be directed towards other open conjectures on splay trees such as the traversal and split conjectures.