The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009248926 / rank | |||
Normal rank | |||
Revision as of 19:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cost of offline binary search tree algorithms and the complexity of the request sequence |
scientific article |
Statements
The cost of offline binary search tree algorithms and the complexity of the request sequence (English)
0 references
15 April 2008
0 references
offline binary search tree algorithms
0 references
Kolmogorov complexity
0 references
splay trees
0 references
