Partial fillup and search time in LC tries

DOI10.1145/1290672.1290681zbMath1445.68070arXivcs/0510017OpenAlexW2101596348MaRDI QIDQ4962683

Wojciech Szpankowski, Svante Janson

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

zbMATH Keywords

probabilistic analysisstringstreesdigital treesPoissonizationlevel-compressed triespartial fillup

Mathematics Subject Classification ID

Data structures (68P05)

This page was built for publication: Partial fillup and search time in LC tries