A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME (Q4886313)
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: A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME |
scientific article; zbMATH DE number 911952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME |
scientific article; zbMATH DE number 911952 |
Statements
A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME (English)
0 references
11 December 1996
0 references
balanced search tree
0 references
optimal query time
0 references
bucketing
0 references
preventive splitting
0 references
0.9192332029342652
0 references
0.8272727131843567
0 references
0.8177568316459656
0 references
0.8171279430389404
0 references
