Self-adjusting binary search trees
Journal of the ACM (JACM)
Sequential access in splay trees takes linear time
Combinatorica
Amortized complexity of data structures
Amortized complexity of data structures
Journal of Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A new representation for linear lists
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
On the Dynamic Finger Conjecture for Splay Trees Part II: The Proof
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
On the Dynamic Finger Conjecture for Splay Trees Part I: Splay Sorting log n-Block Sequences
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Efficient Tree Layout in a Multilevel Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
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
A locality-preserving cache-oblivious dynamic dictionary
Journal of Algorithms
A data structure for a sequence of string accesses in external memory
ACM Transactions on Algorithms (TALG)
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science
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
A Distribution-Sensitive Dictionary with Low Space Overhead
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
Reducing splaying by taking advantage of working sets
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A static optimality transformation with applications to planar point location
Proceedings of the twenty-seventh annual symposium on Computational geometry
Efficient adaptive data compression using fano binary search trees
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
De-amortizing binary search trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
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 |
Splay trees are a self adjusting form of search tree that supports access operations in &Ogr;(log n) amortized time. Splay trees also have several amazing distribution sensitive properties, the strongest two of which are the working set theorem and the dynamic finger theorem. However, these two theorems are shown to poorly bound the performance of splay trees on some simple access sequences. The unified conjecture is presented, which subsumes the working set theorem and dynamic finger theorem, and accurately bounds the performance of splay trees over some classes of sequences where the existing theorems' bounds are not tight. While the unified conjecture for splay trees is unproven, a new data structure, the unified structure, is presented where the unified conjecture does hold. This structure also has a worst case of &Ogr;(log n) per operation, in contrast to the &Ogr;(n) worst case runtime of splay trees. A second data structure, the working set structure, is introduced. The working set structure has the same performance attributed to splay trees through the working set theorem, except the runtime is worst case per operation rather than amortized.