On the average oscillation of a stack
From MaRDI portal
Cites work
- A note on the stack size of regularly distributed binary trees
- Automatic computing methods for special functions
- Enumerations of ordered trees
- First Passage and Recurrence Distributions
- scientific article; zbMATH DE number 3645115 (Why is no real title available?)
- scientific article; zbMATH DE number 3162400 (Why is no real title available?)
- scientific article; zbMATH DE number 3565290 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3390782 (Why is no real title available?)
- The average height of binary trees and other simple trees
- The average height of r-tuply rooted planted plane trees
Cited in
(11)- The average height of planted plane trees with M leaves
- Ordered trees and non-crossing partitions
- The asymptotic contour process of a binary tree is a Brownian excursion
- The asymptotic distribution of leaf heights in binary trees
- The expected additive weight of trees
- The scientific works of Rainer Kemp (1949--2004)
- The limiting common distribution of two leaf heights in a random binary tree
- On the average hyperoscillations of planted plane trees
- A walk in my lattice path garden
- On the average shape of monotonically labelled tree structures
- On the number of deepest nodes in ordered trees
This page was built for publication: On the average oscillation of a stack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836670)
