Pages that link to "Item:Q4818672"
From MaRDI portal
The following pages link to Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees (Q4818672):
Displaying 6 items.
- Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying (Q963330) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Embedding height balanced trees and Fibonacci trees in hypercubes (Q1031992) (← links)
- On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences (Q4507338) (← links)
- Generalized Template Splay: A Basic Theory and Calculus (Q4828443) (← links)
- Experimental and Efficient Algorithms (Q5710058) (← links)