B-treaps revised: write efficient randomized block search trees with high load (Q7312599)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8238464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | B-treaps revised: write efficient randomized block search trees with high load |
scientific article; zbMATH DE number 8238464 |
Statements
B-treaps revised: write efficient randomized block search trees with high load (English)
0 references
11 August 2026
0 references
