Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees (Q4818672): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q124841674, #quickstatements; #temporary_batch_1711055989931 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jalgor.2003.09.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969274256 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q124841674 / rank | |||
Normal rank | |||
Latest revision as of 02:49, 22 March 2024
scientific article; zbMATH DE number 2104543
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees |
scientific article; zbMATH DE number 2104543 |
Statements
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees (English)
0 references
1 October 2004
0 references
dynamically self-adjusted trees
0 references
