The following pages link to Profiles of Tries (Q3642866):
Displaying 27 items.
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- The degree profile of random Pólya trees (Q439063) (← links)
- On a recurrence arising in graph compression (Q456337) (← links)
- The expected profile of digital search trees (Q549244) (← links)
- On tries, contention trees and their analysis (Q659773) (← links)
- A probabilistic analysis of the height of tries and of the complexity of triesort (Q760797) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- A functional limit theorem for the profile of \(b\)-ary trees (Q988760) (← links)
- A note on the asymptotic behavior of the depth of tries (Q1277381) (← links)
- Profiles of PATRICIA tries (Q1702132) (← links)
- Limit theorems for patterns in phylogenetic trees (Q2340020) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Asymptotic expectation of protected node profile in random digital search trees (Q2688817) (← links)
- Trie structure for graph sequences (Q2789555) (← links)
- Limit theorems for subtree size profiles of increasing trees (Q2888869) (← links)
- A new binomial recurrence arising in a graphical compression algorithm (Q2920840) (← links)
- Towards a complete characterization of tries (Q2921651) (← links)
- A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys (Q3128196) (← links)
- On the number of full levels in tries (Q3159456) (← links)
- Average-Case Analysis of Cousins in <i>m</i>-ary Tries (Q3535643) (← links)
- Trie size in a dynamic list structure (Q5044775) (← links)
- Normal Limit Law for Protected Node Profile of Random Recursive Trees (Q5046635) (← links)
- Asymmetric Rényi Problem (Q5219326) (← links)
- The Wiener Index of Random Digital Trees (Q5251627) (← links)
- Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)
- Node profiles of symmetric digital search trees: Concentration properties (Q6049998) (← links)
