The following pages link to Alois Panholzer (Q285057):
Displaying 50 items.
- Parking functions for mappings (Q285058) (← links)
- On moment sequences and mixed Poisson distributions (Q315389) (← links)
- Analysis of the ``hiring above the median'' selection strategy for the hiring problem (Q378233) (← links)
- Enumeration formulæ for pattern restricted Stirling permutations (Q456658) (← links)
- Analysis of the strategy ``hiring above the \(m\)-th best candidate'' (Q486994) (← links)
- Combinatorial families of multilabelled increasing trees and hook-length formulas (Q501056) (← links)
- Generalized Stirling permutations, families of increasing trees and urn models (Q616442) (← links)
- The analysis of range quickselect and related problems (Q650886) (← links)
- Bilabelled increasing trees and hook-length formulae (Q658008) (← links)
- Left and right length of paths in binary trees or on a question of Knuth (Q659771) (← links)
- Enumeration results for alternating tree families (Q709246) (← links)
- Runs in labelled trees and mappings (Q776318) (← links)
- Descendants in increasing trees (Q813924) (← links)
- Computer-free evaluation of an infinite double sum via Euler sums (Q817949) (← links)
- Destruction of very simple trees (Q866949) (← links)
- The left-right-imbalance of binary search trees (Q868958) (← links)
- On the degree distribution of the nodes in increasing trees (Q880004) (← links)
- Isolating a leaf in rooted trees via random cuttings (Q938214) (← links)
- On the area under lattice paths associated with triangular diminishing urn models (Q962001) (← links)
- On the distribution of distances between specified nodes in increasing trees (Q968167) (← links)
- A combinatorial approach to the analysis of bucket recursive trees (Q986560) (← links)
- Isolating nodes in recursive trees (Q998742) (← links)
- Limit laws for the Randić index of random binary tree models (Q1019451) (← links)
- (Q1028850) (redirect page) (← links)
- Lattice paths, sampling without replacement, and limiting distributions (Q1028851) (← links)
- Average-case analysis of priority trees: A structure of priority queue administration (Q1277386) (← links)
- An analytic approach for the analysis of rotations in fringe-balanced binary search trees (Q1305200) (← links)
- Moments of level numbers of leaves in binary trees (Q1347985) (← links)
- On the number of descendants and ascendants in random search trees (Q1384587) (← links)
- Analysis of multiple quickselect variants. (Q1401319) (← links)
- Binary search tree recursions with harmonic toll functions (Q1612306) (← links)
- Bijections for ternary trees and non-crossing trees (Q1613443) (← links)
- Partial match queries in relaxed multidimensional search trees (Q1840511) (← links)
- Spanning tree size in random binary search trees. (Q1879887) (← links)
- Limiting distributions for the number of inversions in labelled tree families (Q1929740) (← links)
- Parking function varieties for combinatorial tree models (Q2035991) (← links)
- Consecutive permutation patterns in trees and mappings (Q2226519) (← links)
- A combinatorial approach for discrete car parking on random labelled trees (Q2306005) (← links)
- Alternating mapping functions (Q2349207) (← links)
- Analysis of a generalized Friedman's urn with multiple drawings (Q2446890) (← links)
- On edge-weighted recursive trees and inversions in random permutations (Q2467733) (← links)
- A distributional study of the path edge-covering numbers for random trees (Q2482101) (← links)
- A unifying approach for proving hook-length formulas for weighted tree families (Q2637731) (← links)
- (Q2733967) (← links)
- (Q2784339) (← links)
- (Q2834336) (← links)
- Multiple isolation of nodes in recursive trees (Q2878855) (← links)
- Limiting Distributions for a Class Of Diminishing Urn Models (Q2879908) (← links)
- ASYMPTOTIC RESULTS FOR THE NUMBER OF PATHS IN A GRID (Q2891972) (← links)
- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations (Q2894489) (← links)
