Pages that link to "Item:Q922689"

The following pages link to On the height of digital trees and related problems (Q922689):

Displaying 13 items.

• Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
• Asymptotic properties of keys and functional dependencies in random databases (Q1389444) (← links)
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
• Random databases with approximate record matching (Q2270185) (← links)
• Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
• Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
• Faster average case low memory semi-external construction of the Burrows-Wheeler transform (Q2363991) (← links)
• Sequential and indexed two-dimensional combinatorial template matching allowing rotations (Q2576875) (← links)
• On the Stack-Size of General Tries (Q2771494) (← links)
• Analysis of random LC tries (Q2772924) (← links)
• Generic properties of subgroups of free groups and finite presentations (Q2975245) (← links)
• An Analysis of the Height of Tries with Random Weights on the Edges (Q3512599) (← links)
• Uncommon suffix tries (Q5175232) (← links)