Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The joint distribution of the three types of nodes in uniform binary trees

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

DOI10.1007/BF01190510zbMath0816.68094OpenAlexW1977903920MaRDI QIDQ1346776

Hosam M. Mahmoud

Publication date: 9 April 1995

Published in: Algorithmica (Search for Journal in Brave)

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


zbMATH Keywords

multivariate distributionsrandom binary trees


Mathematics Subject Classification ID

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


Related Items

DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ On the number of vertices with a given degree in a Galton-Watson tree ⋮ On the internal structure of random recursive circuits



Cites Work

  • Unnamed Item
  • Unnamed Item
  • The average number of registers needed to evaluate a binary tree optimally
  • The number of registers required for evaluating arithmetic expressions
  • Limit laws for local counters in random binary search trees
  • The Expected Performance of Traversal Algorithms in Binary Trees
  • Analysis of algorithms on threaded trees
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1346776&oldid=13481573"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki