Reductions of binary trees and lattice paths induced by the register function

DOI10.1016/j.tcs.2017.09.015zbMath1380.68305arXiv1612.07286OpenAlexW2562127540MaRDI QIDQ1680544

Clemens Heuberger, Benjamin Hackl, Prodinger, Helmut

Publication date: 16 November 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.07286

zbMATH Keywords

asymptoticsbinary treelattice pathregister function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorics in computer science (68R05) Asymptotic enumeration (05A16)

Related Items (3)

Fringe analysis of plane trees related to cutting and pruning ⋮ Reductions of binary trees and lattice paths induced by the register function ⋮ Random self-similar trees: a mathematical theory of Horton laws

Uses Software

• SageMath
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological self-similarity on the random binary-tree model
• A short proof of an identity of Touchard's concerning Catalan numbers
• The average number of registers needed to evaluate a binary tree optimally
• The number of registers required for evaluating arithmetic expressions
• On convergence rates in the central limit theorems for combinatorial structures
• A Strahler bijection between Dyck paths and planar trees
• On a problem of Yekutieli and Mandelbrot about the bifurcation ratio of binary trees
• Reductions of binary trees and lattice paths induced by the register function
• The register function for t -ary trees
• Singularity Analysis of Generating Functions
• Random Trees
• Central limit theorem for the bifurcation ratio of a random binary tree
• Register Allocation for Unary–Binary Trees
• On Horton's Law for Random Channel Networks
• A Large Deviation Rate and Central Limit Theorem for Horton Ratios
• On the Higher Dimensional Quasi-Power Theorem and a Berry-Esseen Inequality
• A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures
• Central Limit Theorems for Additive Tree Parameters with Small Toll Functions

This page was built for publication: Reductions of binary trees and lattice paths induced by the register function