Results 1  10
of
17
Limit Laws for Heights in Generalized Tries and PATRICIA Tries
, 1999
"... We consider digital trees such as (generalized) tries and PATRICIA tries, built from n random strings generated by an unbiased memoryless source (i.e., all symbols are equally likely). We study limit laws of the height which is defined as the longest path in such trees. It turns out that this heigh ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We consider digital trees such as (generalized) tries and PATRICIA tries, built from n random strings generated by an unbiased memoryless source (i.e., all symbols are equally likely). We study limit laws of the height which is defined as the longest path in such trees. It turns out
Universal Asymptotics for Random Tries and Patricia Trees
 Algorithmica
, 2004
"... We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many parameters Z_n of these random structures are universally stable in the sense that Z_n/E{Z_n} tends to one probability. This occur ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many parameters Z_n of these random structures are universally stable in the sense that Z_n/E{Z_n} tends to one probability
A Multivariate Study on the Size of mary Tries and PATRICIA Tries
"... Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show t ..."
Abstract
 Add to MetaCart
Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show
Do we really need to balance Patricia tries?
, 1987
"... In this paper, we give exact and asymptotic approximations for variance of the external path length in a symmetric Patricia trie. The problem was open up to now. We prove that for the binary Patricia trie, the variance is asymptotically equal to 0.37...·n + n P (lOg2 n) where n is the number of stor ..."
Abstract
 Add to MetaCart
of stored records and P (x) is a periodic function with a very small amplitude. This result is next used to show that from the practical (average) viewpoint, the Patricia trie does not need to be restructured in order to keep it balanced. In general, we ask to what extent simpler and more direct algorithms
Laws of large numbers and tail inequalities for random tries and Patricia trees
 JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
, 2002
"... We consider random tries and random Patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. If Hn is the height of this tree, we show that Hn/E{Hn} tends to one in probability. Additional tail inequalities are given for the height, depth, s ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
We consider random tries and random Patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. If Hn is the height of this tree, we show that Hn/E{Hn} tends to one in probability. Additional tail inequalities are given for the height, depth
Analysis of random LC tries
 Random Struc. Alg
, 2001
"... LC tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries or patricia tries in which, from the top down, maximal height complete subtrees are level compressed. Andersson and Nilsson (1993) showed that for i.i.d. uniformly distributed input strings, the expected ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
LC tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries or patricia tries in which, from the top down, maximal height complete subtrees are level compressed. Andersson and Nilsson (1993) showed that for i.i.d. uniformly distributed input strings
Do we really need to balance Patricia tries? (Extended Abstract)
"... In this paper, we give exact and asymptotic approximations for the variance of the external path length in a symmetric Patricia trie. The problem was open up to now. We prove that for the binary Patricia trie, the variance is asymptotically equal to 0.37... •n + n P (loge n) where n is the number of ..."
Abstract
 Add to MetaCart
of stored records and P (x) is a periodic function with a very small amplitude. This result is next used to show that from the practical (average) viewpoint, the Patricia the does not need to be restructured in order to keep it balanced. In general, we ask to what extent simpler and more direct algorithms
A General Central Limit Theorem for Shape Parameters of
, 2014
"... Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show ..."
Abstract
 Add to MetaCart
Tries and PATRICIA tries are fundamental data structures in computer science with numerous applications. In a recent paper, a general framework for obtaining the mean and variance of additive shape parameters of tries and PATRICIA tries under the Bernoulli model was proposed. In this note, we show
Cultural Biases in Economic Exchange",
, 2004
"... Abstract How much do cultural biases affect economic exchange? We try to answer this question by using the relative trust European citizens have for citizens of other countries. First, we document that this trust is affected not only by objective characteristics of the country being trusted, but al ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
Abstract How much do cultural biases affect economic exchange? We try to answer this question by using the relative trust European citizens have for citizens of other countries. First, we document that this trust is affected not only by objective characteristics of the country being trusted
A Multivariate View of Random Bucket Digital Search Trees
, 2002
"... We take a multivariate view of digital search trees by studying the number of nodes of di#erent types that may coexist in a bucket digital search tree as it grows under an arbitrary memory management system. We obtain the mean of each type of node, as well as the entire covariance matrix between ..."
Results 1  10
of
17