Alternatives to splay trees with \(O(\log n)\) worst-case access times (Q2768341)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1699267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Alternatives to splay trees with \(O(\log n)\) worst-case access times |
scientific article; zbMATH DE number 1699267 |
Statements
30 January 2002
0 references
splay trees
0 references
search tree
0 references
Alternatives to splay trees with \(O(\log n)\) worst-case access times (English)
0 references
0.8175099492073059
0 references
0.8093261122703552
0 references
0.8015727400779724
0 references
0.7998557090759277
0 references
0.7961046695709229
0 references
