Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying (Q963330)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying |
scientific article; zbMATH DE number 5694904
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying |
scientific article; zbMATH DE number 5694904 |
Statements
Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying (English)
0 references
19 April 2010
0 references
data structures
0 references
splay trees
0 references
competitive analysis
0 references
0 references
0 references
