Pages that link to "Item:Q760797"
From MaRDI portal
The following pages link to A probabilistic analysis of the height of tries and of the complexity of triesort (Q760797):
Displaying 21 items.
- On tries, contention trees and their analysis (Q659773) (← links)
- Rounding of continuous random variables and oscillatory asymptotics (Q858983) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- Maximum likelihood analysis of algorithms and data structures (Q1041238) (← links)
- Brownian motion and algorithm complexity (Q1082076) (← 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)
- How many random questions are necessary to identify \(n\) distinct objects? (Q1813292) (← links)
- The properties of random trees (Q1825678) (← links)
- Expected worst-case partial match in random quadtries (Q1827855) (← links)
- A theoretical look at \textsc{Electre Tri}-nB and related sorting models (Q2688878) (← links)
- On the stack-size of general tries (Q2771494) (← links)
- \(D\cdot E\cdot K=(100)_8\) (Q2772918) (← links)
- Analysis of random LC tries (Q2772924) (← links)
- An Analysis of the Height of Tries with Random Weights on the Edges (Q3512599) (← links)
- Exact and asymptotic distributions in digital and binary search trees (Q3785960) (← links)
- A note on the probabilistic analysis of patricia trees (Q3990222) (← links)
- Dichotomic Selection on Words: A Probabilistic Analysis (Q5088910) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925527) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925674) (← links)
