Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums (Q4210132)
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: Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums |
scientific article; zbMATH DE number 1200774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums |
scientific article; zbMATH DE number 1200774 |
Statements
Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums (English)
0 references
21 September 1998
0 references
data structures
0 references
partial sums
0 references
lower bounds
0 references
0.7628313302993774
0 references
0.7318843007087708
0 references
0.7271537780761719
0 references
0.7267909049987793
0 references
0.7189546823501587
0 references
