On the average oscillation of a stack

DOI10.1007/BF02579315zbMATH Open0506.05025MaRDI QIDQ1836670FDOQ1836670

Authors: Yanyan Li 

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

binary treenumber of plane trees with n nodes

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumerations of ordered trees
• The average height of binary trees and other simple trees
• The average height of r-tuply rooted planted plane trees
• Title not available (Why is that?)
• First Passage and Recurrence Distributions
• Title not available (Why is that?)
• A note on the stack size of regularly distributed binary trees
• Title not available (Why is that?)
• Automatic computing methods for special functions

Cited In (10)

• The asymptotic distribution of leaf heights in binary trees
• The limiting common distribution of two leaf heights in a random binary tree
• On the average hyperoscillations of planted plane trees
• The scientific works of Rainer Kemp (1949--2004)
• The average height of planted plane trees with M leaves
• On the number of deepest nodes in ordered trees
• Ordered trees and non-crossing partitions
• On the average shape of monotonically labelled tree structures
• The asymptotic contour process of a binary tree is a Brownian excursion
• The expected additive weight of 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)