An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times (Q3569877)
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: An O( n)-competitive binary search tree with optimal worst-case access times |
scientific article; zbMATH DE number 5724306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times |
scientific article; zbMATH DE number 5724306 |
Statements
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times (English)
0 references
22 June 2010
0 references
0.8452706336975098
0 references
0.844305694103241
0 references
0.8356476426124573
0 references
0.809967041015625
0 references
0.8021568655967712
0 references
