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

How tall is a tree?

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

DOI10.1145/335305.335360zbMATH Open1296.68037OpenAlexW2008909422MaRDI QIDQ3192017FDOQ3192017

Bruce Reed

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335360




Recommendations

  • The height of a random binary search tree
  • On the Variance of the Height of Random Binary Search Trees
  • The height of a binary search tree: the limiting distribution perspective.
  • An analytic approach to the height of binary search trees
  • Numerical studies of the expected height in randomly built binary search trees


Mathematics Subject Classification ID

Data structures (68P05)



Cited In (1)

  • The height of a binary search tree: the limiting distribution perspective.





This page was built for publication: How tall is a tree?

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

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