The following pages link to Alois Panholzer (Q285057):
Displayed 50 items.
- On death processes and urn models (Q2920842) (← links)
- (Q2959859) (← links)
- Ordered increasing k-trees: Introduction and analysis of a preferential attachment network model (Q2959931) (← links)
- Analysis of three graph parameters for random trees (Q3055764) (← links)
- (Q3082005) (← links)
- Analysis of Statistics for Generalized Stirling Permutations (Q3103634) (← links)
- (Q3154689) (← links)
- The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees (Q3156916) (← links)
- (Q3370010) (← links)
- Cutting down very simple trees (Q3431999) (← links)
- (Q3439679) (← links)
- (Q3575003) (← links)
- (Q3575016) (← links)
- (Q3576769) (← links)
- (Q3576776) (← links)
- Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees (Q3614199) (← links)
- On the shape of the fringe of various types of random trees (Q3634637) (← links)
- A Combinatorial Approach for Analyzing the Number of Descendants in Increasing Trees and Related Parameters (Q3638238) (← links)
- Bijections between certain families of labelled and unlabelled d-ary trees (Q3649770) (← links)
- A Short Proof of a Series Evaluation in Terms of Harmonic Numbers (Q3654442) (← links)
- (Q3836514) (← links)
- Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial (Q4226639) (← links)
- (Q4258221) (← links)
- (Q4451056) (← links)
- On generalized Fibonacci permutations (Q4469168) (← links)
- (Q4488956) (← links)
- Noncrossing trees are almost conditioned Galton–Watson trees (Q4534222) (← links)
- (Q4584028) (← links)
- Combinatorial analysis of growth models for series-parallel networks (Q4632491) (← links)
- (Q4667617) (← links)
- The climbing depth of random trees (Q4667858) (← links)
- On Some Parameters in Heap Ordered Trees (Q4670360) (← links)
- Distribution of the Steiner Distance in Generalized M-ary Search Trees (Q4670362) (← links)
- A generating functions approach for the analysis of grand averages for multiple QUICKSELECT (Q4705339) (← links)
- Permuting in place: analysis of two stopping rules (Q4736817) (← links)
- Analysis of insertion costs in priority trees (Q5194609) (← links)
- Generating Random Derangements (Q5194649) (← links)
- Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem (Q5194711) (← links)
- (Q5197595) (← links)
- Combinatorial Analysis of Growth Models for Series-Parallel Networks (Q5219327) (← links)
- A note on harmonic number identities, Stirling series and multiple zeta values (Q5225062) (← links)
- (Q5293966) (← links)
- (Q5387737) (← links)
- ON WEIGHTED PATH LENGTHS AND DISTANCES IN INCREASING TREES (Q5422219) (← links)
- Level of nodes in increasing trees revisited (Q5433258) (← links)
- (Q5466017) (← links)
- (Q5485329) (← links)
- Ancestors and descendants in evolving <i>k</i>‐tree models (Q5495877) (← links)
- On bucket increasing trees, clustered increasing trees and increasing diamonds (Q5886336) (← links)
- Tree evolution processes for bucket increasing trees (Q6046171) (← links)