Pages that link to "Item:Q1160188"
From MaRDI portal
The following pages link to A note on the average depth of trees (Q1160188):
Displayed 9 items.
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- A probabilistic analysis of the height of tries and of the complexity of triesort (Q760797) (← links)
- On search by address computation (Q802312) (← links)
- On the average depth of asymmetric LC-tries (Q1044716) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- An algebraic approach to the prefix model analysis of binary trie structures and set intersection algorithms (Q1381820) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- Analysis of random LC tries (Q2772924) (← links)
- A note on the probabilistic analysis of patricia trees (Q3990222) (← links)