A note on the stack size of regularly distributed binary trees

DOI10.1007/BF01933188MaRDI QIDQ3865504zbMATH OpenOpenAlexFDO

Authors Rainer Kemp

Publication date 1980

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01933188

zbMATH Keywords

stack size of regularly distributed binary trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Cites work

• scientific article; zbMATH DE number 3645115 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3523640 (Why is no real title available?)
• scientific article; zbMATH DE number 3273551 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• Some remarks on ballot-type sequences of positive integers

Cited in

(8)

• The average height of planted plane trees with M leaves
• On the average depth of a prefix of the Dycklanguage \(D_ 1\).
• The asymptotic distribution of leaf heights in binary trees
• On the average oscillation of a stack
• The scientific works of Rainer Kemp (1949--2004)
• Fringe analysis of plane trees related to cutting and pruning
• scientific article; zbMATH DE number 3829270 (Why is no real title available?)
• On the average hyperoscillations of planted plane trees

This page was built for publication: A note on the stack size of regularly distributed binary trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3865504)