A tight threshold bound for search trees with 2-way comparisons (Q6636072)
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 tight threshold bound for search trees with 2-way comparisons |
scientific article; zbMATH DE number 7941765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight threshold bound for search trees with 2-way comparisons |
scientific article; zbMATH DE number 7941765 |
Statements
A tight threshold bound for search trees with 2-way comparisons (English)
0 references
12 November 2024
0 references
