Pages that link to "Item:Q1826644"
From MaRDI portal
The following pages link to On the sequential access theorem and deque conjecture for splay trees (Q1826644):
Displaying 11 items.
- Sequential access in splay trees takes linear time (Q1072706) (← links)
- On the deque conjecture for the splay algorithm (Q1193537) (← 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)
- Greedy Is an Almost Optimal Deque (Q3449813) (← links)
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences (Q4507338) (← links)
- Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees (Q4818672) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
- (Q6062157) (← links)