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(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times |
scientific article |
Statements
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times (English)
0 references
22 June 2010
0 references
