Digital search trees with \(m\) trees: level polynomials and insertion costs (Q5403000)
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: Digital search trees with m trees: level polynomials and insertion costs |
scientific article; zbMATH DE number 6273725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Digital search trees with \(m\) trees: level polynomials and insertion costs |
scientific article; zbMATH DE number 6273725 |
Statements
25 March 2014
0 references
digital search tree
0 references
level polynomial
0 references
Rice's method
0 references
cancellations
0 references
\(q\)-analysis
0 references
0.7940710783004761
0 references
0.782453179359436
0 references
0.7795697450637817
0 references
