The following pages link to (Q2753950):
Displaying 13 items.
- Optimal strategies for the list update problem under the MRM alternative cost model (Q437676) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- A study on splay trees (Q2419117) (← links)
- Better analysis of binary search tree on decomposable sequences (Q2419118) (← links)
- The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Greedy Is an Almost Optimal Deque (Q3449813) (← links)
- Self-Adjusting Binary Search Trees: What Makes Them Tick? (Q3452794) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Smooth Heaps and a Dual View of Self-Adjusting Data Structures (Q5130842) (← links)
- List Update with Locality of Reference (Q5458546) (← links)
- (Q5874496) (← links)
- (Q5874540) (← links)
