A Note on the Probabilistic Analysis of Patricia Trees

We consider random PATRICIA trees constructed from n i.i.d. sequences of independent equiprobable bits. We study the height Hn (the maximal distance between the root and a leaf), and the minimal fill‐up level Fn (the minimum distance between the root and a leaf). We give probabilistic proofs of **image** and **image**. © 1992 Wiley Periodicals, Inc.

[1]  D. Aldous,et al.  A diffusion limit for a class of randomly-growing binary trees , 1988 .

[2]  B. Pittel.  Paths in a random digital tree: limiting distributions , 1986, Advances in Applied Probability.

[3]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[4]  Kazuoki Azuma.  WEIGHTED SUMS OF CERTAIN DEPENDENT RANDOM VARIABLES , 1967 .

[5]  K. Joag-dev,et al.  Negative Association of Random Variables with Applications , 1983 .

[6]  Wojciech Szpankowski,et al.  Some Results on V-ary Asymmetric Tries , 1988, J. Algorithms.

[7]  Helmut Prodinger,et al.  On the Balance Property of Patricia Tries: External Path Length Viewpoint , 1989, Theor. Comput. Sci..

[8]  Philippe Flajolet,et al.  Digital Search Trees Revisited , 1986, SIAM J. Comput..

[9]  Mireille Régnier,et al.  On the Average Height of Trees in Digital Search and Dynamic Hashing , 1981, Inf. Process. Lett..

[10]  Philippe Flajolet,et al.  A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization , 1982, ICALP.

[11]  L. Devroye.  A Study of Trie-Like Structures Under the Density Model , 1992 .

[12]  Helmut Prodinger,et al.  On the variance of the external path length in a symmetric digital trie , 1989, Discret. Appl. Math..

[13]  Mireille Régnier,et al.  Trie Partitioning Process: Limiting Distributions , 1986, CAAP.

[14]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[15]  Boris G. Pittel,et al.  How many random questions are necessary to identify n distinct objects? , 1990, J. Comb. Theory, Ser. A.

[16]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[17]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[18]  Haim Mendelson,et al.  Analysis of Extendible Hashing , 1982, IEEE Transactions on Software Engineering.

[19]  D. Walkup,et al.  Association of Random Variables, with Applications , 1967 .

[20]  B. Pittel.  Asymptotical Growth of a Class of Random Trees , 1985 .

[21]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[22]  Colin McDiarmid,et al.  Surveys in Combinatorics, 1989: On the method of bounded differences , 1989 .

[23]  Mireille Régnier,et al.  Trie hashing analysis , 1988, Proceedings. Fourth International Conference on Data Engineering.

[24]  Wojciech Szpankowski.  Digital Data Structures and Order Statistics , 1989, WADS.