A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME (Q4886313): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0129054196000117 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006131099 / rank | |||
Normal rank | |||
Latest revision as of 09:30, 30 July 2024
scientific article; zbMATH DE number 911952
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
