Pages that link to "Item:Q1193537"
From MaRDI portal
The following pages link to On the deque conjecture for the splay algorithm (Q1193537):
Displaying 13 items.
- Right-arm rotation distance between binary trees (Q1014416) (← links)
- On the sequential access theorem and deque conjecture for splay trees (Q1826644) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- A unified access bound on comparison-based dynamic dictionaries (Q2381520) (← links)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- A study on splay trees (Q2419117) (← links)
- A relationship between generalized Davenport-Schinzel sequences and interval chains (Q2517665) (← links)
- Greedy Is an Almost Optimal Deque (Q3449813) (← links)
- Three Generalizations of Davenport--Schinzel Sequences (Q3452162) (← links)
- Effective splaying with restricted rotations (Q3506250) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
- An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
- (Q6062157) (← links)
