Skip to main content
Conference Proceedings

Random tries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2518 635
DOI: 10.1007/3-540-36136-7_55
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We look at the properties of random tries, random Patricia tries, and random level compacted tries and show by means of Talagrand-style concentration inequalities that most parameters, such as the height and the profile of these tries, are stable (i.e., close to their expected value) in a universal manner.

Cite

CITATION STYLE

APA

Devroye, L. (2002). Random tries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2518, p. 635). Springer Verlag. https://doi.org/10.1007/3-540-36136-7_55

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free