The expected additive weight of trees
From MaRDI portal
Publication:1262116
DOI10.1007/BF00289158zbMath0685.68023OpenAlexW2059942290MaRDI QIDQ1262116
Publication date: 1989
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00289158
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (10)
(Un)expected path lengths of asymmetric binary search trees ⋮ The scientific works of Rainer Kemp (1949--2004) ⋮ On the lexicographical generation of compressed codes ⋮ On the average number of registers needed to evaluate a special class of backtrack trees ⋮ Uniformly growing backtrack trees ⋮ Additive weights of a special class of nonuniformly distributed backtrack trees ⋮ On the combinatorics of leftist trees ⋮ On the inner structure of multidimensional simply generated trees ⋮ On the inner structure of multidimensional simply generated trees ⋮ Additive weights under the balanced probability model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The average height of planted plane trees with M leaves
- On the average internal path length of m-ary search trees
- Enumerations of ordered trees
- The average height of binary trees and other simple trees
- On the average oscillation of a stack
- Asymptotic Methods in Enumeration
- On the Altitude of Nodes in Random Trees
- Distributional properties of a model for the spread or drug abuse
This page was built for publication: The expected additive weight of trees
