Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 3847416

From MaRDI portal
Publication:3317124
Jump to:navigation, search

zbMATH Open0534.05028MaRDI QIDQ3317124FDOQ3317124


Authors: Peter Kirschenhofer Edit this on Wikidata


Publication date: 1983



Title of this publication is not available (Why is that?)



Recommendations

  • scientific article; zbMATH DE number 4023312
  • An analytic approach to the height of binary search trees
  • The Distribution of Heights of Binary Trees and Other Simple Trees
  • On the concentration of the height of binary search trees
  • Moments of level numbers of leaves in binary trees


zbMATH Keywords

random binary treeexpected height


Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80)



Cited In (9)

  • Moments of level numbers of leaves in binary trees
  • The asymptotic distribution of leaf heights in binary trees
  • Average-case analysis of quicksort and binary insertion tree height using incompressibility
  • Title not available (Why is that?)
  • ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
  • Some new results on the average shape of binary trees and other simply generated families
  • The asymptotic contour process of a binary tree is a Brownian excursion
  • A note on the height of binary search trees
  • Title not available (Why is that?)





This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3317124&oldid=16548139"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 12:50. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki