The following pages link to Patricia tries again revisited (Q3495658):
Displaying 18 items.
- 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)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- On the balance property of Patricia tries: External path length viewpoint (Q1124339) (← links)
- Analytical depoissonization and its applications (Q1129001) (← 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)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- Profiles of PATRICIA tries (Q1702132) (← links)
- Optimizing registration based encryption (Q2149790) (← links)
- Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
- Analysis of random LC tries (Q2772924) (← links)
- Julia and John revisited (Q3094893) (← links)
- A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence (Q3191203) (← links)
- Analytic analysis of algorithms (Q5204317) (← links)
- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (Q5204318) (← links)
- Asymmetric Rényi Problem (Q5219326) (← links)
