Pages that link to "Item:Q1072706"
From MaRDI portal
The following pages link to Sequential access in splay trees takes linear time (Q1072706):
Displaying 14 items.
- Self-adjusting multi-way search trees (Q1178210) (← links)
- On the deque conjecture for the splay algorithm (Q1193537) (← links)
- Randomized splay trees: Theoretical and experimental results. (Q1603506) (← links)
- On the sequential access theorem and deque conjecture for splay trees (Q1826644) (← links)
- A priority queue with the time-finger property (Q1932364) (← links)
- A unified access bound on comparison-based dynamic dictionaries (Q2381520) (← links)
- On the hierarchy of distribution-sensitive properties for data structures (Q2391860) (← links)
- A study on splay trees (Q2419117) (← links)
- A History of Distribution-Sensitive Data Structures (Q2848972) (← links)
- Greedy Is an Almost Optimal Deque (Q3449813) (← links)
- Self-Adjusting Binary Search Trees: What Makes Them Tick? (Q3452794) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
- Belga B-trees (Q5918357) (← links)
- (Q6062157) (← links)
