Analysis of random LC tries (Q2772924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A diffusion limit for a class of randomly-growing binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved behaviour of tries by adaptive branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted sums of certain dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the average depth of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of the height of tries and of the complexity of triesort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the probabilistic analysis of patricia trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of trie-like structures under the density model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching and sorting real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Association of Random Variables, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the performance evaluation of extendible hashing and trie searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Search Trees Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative association of random variables, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the balance property of Patricia tries: External path length viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The variance of the extremal path length in a symmetric digital trie / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality involving multinomial probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Extendible Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotical growth of a class of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many random questions are necessary to identify \(n\) distinct objects? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Distribution for the Depth in PATRICIA Tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average height of trees in digital search and dynamic hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on V-ary asymmetric tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patricia tries again revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the height of digital trees and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of N-trees / rank
 
Normal rank

Revision as of 22:58, 3 June 2024

scientific article
Language Label Description Also known as
English
Analysis of random LC tries
scientific article

    Statements

    Analysis of random LC tries (English)
    0 references
    0 references
    19 February 2002
    0 references
    LC trie
    0 references
    LC PATRICIA trie
    0 references
    0 references
    0 references
    0 references

    Identifiers