Partial fillup and search time in LC tries (Q4962683)

From MaRDI portal
Revision as of 10:21, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q5233149)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
  • Partial Fillup and Search Time in LC Tries

Statements

Partial fillup and search time in LC tries (English)
0 references
Partial Fillup and Search Time in LC Tries (English)
0 references
0 references
0 references
0 references
0 references
5 November 2018
0 references
16 September 2019
0 references
0 references
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
0 references
0 references
0 references