Pages that link to "Item:Q3777471"
From MaRDI portal
The following pages link to Some results on V-ary asymmetric tries (Q3777471):
Displaying 21 items.
- On tries, contention trees and their analysis (Q659773) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- Mellin transforms and asymptotics: Finite differences and Rice's integrals (Q672985) (← links)
- A note on binomial recurrences arising in the analysis of algorithms (Q685508) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- On the height of digital trees and related problems (Q922689) (← 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)
- On The variance of the extremal path length in a symmetric digital trie (Q1262137) (← links)
- Yet another application of a binomial recurrence. Order statistics (Q1262639) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- Expected worst-case partial match in random quadtries (Q1827855) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- On the stack-size of general tries (Q2771494) (← links)
- Analysis of random LC tries (Q2772924) (← links)
- Multiple choice tries and distributed hash tables (Q3633017) (← links)
- A note on the probabilistic analysis of patricia trees (Q3990222) (← links)
