Pages that link to "Item:Q1057565"

The following pages link to Asymptotical growth of a class of random trees (Q1057565):

Displaying 46 items.

• Asymptotics of heights in random trees constructed by aggregation (Q513074) (← links)
• The expected profile of digital search trees (Q549244) (← links)
• Uniform distribution modulo one and binary search trees (Q558117) (← links)
• On the asymptotic growth rate of some spanning trees embedded in \(\mathbb R^d\) (Q631214) (← links)
• Renewal theory in the analysis of tries and strings (Q764315) (← links)
• Asymptotic fringe distributions for general families of random trees (Q809461) (← links)
• Distances in random digital search trees (Q852009) (← links)
• Smoothed heights of tries and patricia tries (Q896160) (← links)
• On the height of digital trees and related problems (Q922689) (← links)
• Text indexing with errors (Q925060) (← links)
• On the silhouette of binary search trees (Q983879) (← links)
• On the average depth of asymmetric LC-tries (Q1044716) (← links)
• A new method for approximate indexing and dictionary lookup with one error (Q1044734) (← links)
• A diffusion limit for a class of randomly-growing binary trees (Q1100799) (← links)
• Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter (Q1202935) (← links)
• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
• On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
• On the variety of shapes in digital trees (Q1692230) (← links)
• Profiles of PATRICIA tries (Q1702132) (← links)
• On the shortest distance between orbits and the longest common substring problem (Q1710399) (← links)
• How many random questions are necessary to identify \(n\) distinct objects? (Q1813292) (← links)
• Optimal data compression algorithm (Q1816650) (← links)
• Expected worst-case partial match in random quadtries (Q1827855) (← links)
• Some results on tries with adaptive branching. (Q1853567) (← links)
• Joint string complexity for Markov sources: small data matters (Q2205940) (← links)
• Volume growth and heat kernel estimates for the continuum random tree (Q2464674) (← links)
• A probabilistic analysis of some tree algorithms (Q2496496) (← links)
• Asymptotic properties of expansive Galton-Watson trees (Q2631840) (← links)
• Analysis of random LC tries (Q2772924) (← links)
• On the Horton-Strahler number for random tries (Q3126013) (← links)
• Longest Path Distance in Random Circuits (Q3168445) (← links)
• An Analysis of the Height of Tries with Random Weights on the Edges (Q3512599) (← links)
• Multiple choice tries and distributed hash tables (Q3633017) (← links)
• A note on the probabilistic analysis of patricia trees (Q3990222) (← links)
• (Q4283160) (← links)
• An almost sure result for path lengths in binary search trees (Q4449502) (← links)
• On the growth of bounded trees (Q4465869) (← links)
• Asymptotic cost of cutting down random free trees (Q4906619) (← links)
• A non-increasing tree growth process for recursive trees and applications (Q4993121) (← links)
• Uncommon suffix tries (Q5175232) (← links)
• Asymmetric Rényi Problem (Q5219326) (← links)
• Search problems in groups and branching processes (Q5252307) (← links)
• Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382) (← links)
• Digital search trees and chaos game representation (Q5851009) (← links)
• Asymptotic pressure on some self-similar trees (Q6038466) (← links)