Partial fillup and search time in LC tries (Q4962683)
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: Partial fillup and search time in LC tries |
scientific article; zbMATH DE number 7105368
- Partial Fillup and Search Time in LC Tries
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial fillup and search time in LC tries |
scientific article; zbMATH DE number 7105368 |
|
Statements
Partial fillup and search time in LC tries (English)
0 references
Partial Fillup and Search Time in LC Tries (English)
0 references
5 November 2018
0 references
16 September 2019
0 references
digital trees
0 references
Poissonization
0 references
level-compressed tries
0 references
partial fillup
0 references
probabilistic analysis
0 references
strings
0 references
trees
0 references
