The following pages link to (Q5659554):
Displaying 21 items.
- Why Delannoy numbers? (Q2568419) (← links)
- On weighted heights of random trees (Q2639445) (← links)
- On the Stack-Size of General Tries (Q2771494) (← links)
- Two-sided prudent walks: a solvable non-directed model of polymer adsorption (Q3302417) (← links)
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation (Q3310623) (← links)
- (Q3674071) (← links)
- On the Average Shape of Binary Trees (Q3960130) (← links)
- Asymptotics for logical limit laws: When the growth of the components is in an RT class (Q4417288) (← links)
- The shape of stretched planar trees (Q4697823) (← links)
- The Sock Problem Revisited (Q4956275) (← links)
- Protection number in plane trees (Q5034292) (← links)
- Retakh's Motzkin paths and some combinatorial comments (Q5093419) (← links)
- Solution of a problem of yekutieli and mandelbrot (Q5096352) (← links)
- Analytic analysis of algorithms (Q5204317) (← links)
- Logarithms of a binomial series: A Stirling number approach (Q5217072) (← links)
- Variations of the Catalan numbers from some nonassociative binary operations (Q5918453) (← links)
- The stack-size of tries: A combinatorial study (Q5958316) (← links)
- Enumeration of partial Łukasiewicz paths (Q6097072) (← links)
- Philippe Flajolet's early work in combinatorics (Q6097991) (← links)
- Trees with exponential height dependent weight (Q6158594) (← links)
- The average size of ordered binary subgraphs (Q6199474) (← links)