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

Solution of a problem of yekutieli and mandelbrot

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

DOI10.1007/3-540-59175-3_110zbMath1495.68183OpenAlexW1548624736MaRDI QIDQ5096352

Prodinger, Helmut

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_110



Mathematics Subject Classification ID

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


Related Items (1)

On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees



Cites Work

  • The average number of registers needed to evaluate a binary tree optimally
  • The number of registers required for evaluating arithmetic expressions
  • Singularity Analysis of Generating Functions
  • Register Allocation for Unary–Binary Trees
  • On the Order of Random Channel Networks
  • Horton-Strahler ordering of random binary trees
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Solution of a problem of yekutieli and mandelbrot

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5096352&oldid=19598778"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 12:47.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki