Pages that link to "Item:Q1052098"

The following pages link to On the performance evaluation of extendible hashing and trie searching (Q1052098):

Displaying 24 items.

• Improved behaviour of tries by adaptive branching (Q685503) (← 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)
• Interpolation-based index maintenance (Q1050774) (← links)
• The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028) (← links)
• The average height of binary trees and other simple trees (Q1171885) (← links)
• Extendible hashing with overflow (Q1172380) (← 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)
• Performance analysis of a main memory multi-directory hashing technique (Q1209985) (← links)
• An approximate analysis of the performance of extendible hashing with elastic buckets (Q1313719) (← 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)
• Expected worst-case partial match in random quadtries (Q1827855) (← links)
• Some results on the asymptotic behaviour of coefficients of large powers of functions (Q1893987) (← links)
• An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
• On the Stack-Size of General Tries (Q2771494) (← links)
• Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
• Analysis of random LC tries (Q2772924) (← links)
• An Analysis of the Height of Tries with Random Weights on the Edges (Q3512599) (← links)
• A note on the probabilistic analysis of patricia trees (Q3990222) (← links)
• Node profiles of symmetric digital search trees: Concentration properties (Q6049998) (← links)