Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
From MaRDI portal
Publication:2944462
DOI10.1137/15M1017107zbMath1323.60022arXiv1503.08791MaRDI QIDQ2944462
Clemens Heuberger, Daniel Krenn, Stephan G. Wagner
Publication date: 2 September 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.08791
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Locally restricted compositions. III: Adjacent-part periodic inequalities
- Rate of convergence in the central limit theorem for random variables with strong mixing
- Level number sequences for trees
- Level number sequences of trees and the lambda algebra
- The asymptotic number of solutions of a diophantine equation from coding theory
- Limit distributions for queues and random rooted trees
- Compositions with distinct parts
- Locally restricted compositions. II: General restrictions and infinite matrices
- Locally restricted compositions. I. Restricted adjacent differences
- The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions
- Limiting Distributions for Path Lengths in Recursive Trees
- Singularity Analysis of Generating Functions
- On the total heights of random rooted trees
- The Distribution of Heights of Binary Trees and Other Simple Trees
- On the profile of random trees
- Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions
- A Sufficient Condition for the Convergence of an Infinite Determinant
- Profiles of random trees: correlation and width of random recursive trees and binary search trees
- The height of increasing trees
This page was built for publication: Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
