The following pages link to Digital Search Trees Revisited (Q3751029):
Displaying 45 items.
- Approximate counting with \(m\) counters: a probabilistic analysis (Q307930) (← links)
- Notes on protected nodes in digital search trees (Q419140) (← links)
- Mellin transforms and asymptotics: Finite differences and Rice's integrals (Q672985) (← links)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989) (← links)
- On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- A note on binomial recurrences arising in the analysis of algorithms (Q685508) (← links)
- How to select a loser (Q687117) (← links)
- Distances in random digital search trees (Q852009) (← links)
- Phase transition in a generalized Eden growth model on a tree (Q858046) (← links)
- On the average depth of asymmetric LC-tries (Q1044716) (← links)
- Further results on digital search trees (Q1110340) (← links)
- The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028) (← links)
- On the balance property of Patricia tries: External path length viewpoint (Q1124339) (← links)
- A characterization of digital search trees from the successful search viewpoint (Q1183573) (← links)
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter (Q1202935) (← links)
- On The variance of the extremal path length in a symmetric digital trie (Q1262137) (← links)
- A result in order statistics related to probabilistic counting (Q1308501) (← links)
- An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms (Q1381820) (← links)
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach (Q1575544) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- The number of winners in a discrete geometrically distributed sample (Q1814758) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- Combinatorics of geometrically distributed random variables: Left-to-right maxima (Q1917529) (← links)
- Analysis of random LC tries (Q2772924) (← links)
- Probabilistic analysis of adaptative sampling (Q3122911) (← links)
- Approximate counting : an alternative approach (Q3358234) (← links)
- On the shape of the fringe of various types of random trees (Q3634637) (← links)
- (Q3730026) (← links)
- Exact and asymptotic distributions in digital and binary search trees (Q3785960) (← links)
- A note on the probabilistic analysis of patricia trees (Q3990222) (← links)
- On a tree collision resolution algorithm in presence of capture (Q3992092) (← links)
- On some applications of formulae of Ramanujan in the analysis of algorithms (Q4005444) (← links)
- (Q4034179) (← links)
- Universal Limit Laws for Depths in Random Trees (Q4210155) (← links)
- Digital search trees with keys of variable length (Q4341036) (← links)
- (Q4633819) (← links)
- Dependence between path-length and size in random digital trees (Q4684912) (← links)
- Analytic analysis of algorithms (Q5204317) (← links)
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects (Q5204319) (← links)
- The Wiener Index of Random Digital Trees (Q5251627) (← links)
- Gaussian Distribution of Trie Depth for Strongly Tame Sources (Q5364227) (← links)
- The Ubiquitous Digital Tree (Q5449784) (← links)
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol (Q5944437) (← links)
- Philippe Flajolet's early work in combinatorics (Q6097991) (← links)
