Pages that link to "Item:Q2457886"
From MaRDI portal
The following pages link to Random binary trees: from the average case analysis to the asymptotics of distributions (Q2457886):
Displaying 16 items.
- Mini-workshop: Random trees, information and algorithms. Abstracts from the mini-workshop held April 24--30, 2011 (Q269675) (← links)
- Mini-workshop: Probability theory on trees and analysis of algorithms (Q555991) (← links)
- On the number of descendants and ascendants in random search trees (Q1384587) (← links)
- On binary search tree recursions with monomials as toll functions (Q1612304) (← links)
- Reductions in binary search trees (Q2369002) (← links)
- Combinatiorial Markov chains (Q2442664) (← links)
- Martingales and large deviations for binary search trees (Q2748421) (← links)
- Psi-series method for equality of random trees and quadratic convolution recurrences (Q2874083) (← links)
- Random binary trees. Algorithms, asymptotics and statistics (Q2900747) (← links)
- Stochastic analysis of tree–like data structures (Q3043434) (← links)
- On the Average Size of the Intersection of Binary Trees (Q3990096) (← links)
- Patterns in random binary search trees (Q4361713) (← links)
- An almost sure result for path lengths in binary search trees (Q4449502) (← links)
- (Q4936224) (← links)
- On the probability distribution of the values of binary trees (Q5621100) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)