Partial fillup and search time in LC tries
From MaRDI portal
Publication:4962683
DOI10.1145/1290672.1290681zbMath1445.68070arXivcs/0510017MaRDI QIDQ4962683
Svante Janson, Wojciech Szpankowski
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms, 2006 Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0510017
probabilistic analysis; strings; trees; digital trees; Poissonization; level-compressed tries; partial fillup
68P05: Data structures