@article{dmtcs:3536,
    title      = {The Height of List-tries and TST},
    author     = {N. Broutin and L. Devroye},
    url        = {https://dmtcs.episciences.org/3536},
    doi        = {10.46298/dmtcs.3536},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)},
    issuetitle = {Proceedings},
    eid        = 18,
    year       = {2007},
    month      = {Jan},
    keywords   = {Tries, branching process, height, de la Briandais, TST, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]},
    language   = {English},
}