A new binomial recurrence arising in a graphical compression algorithm

MaRDI QIDQ2920840zbMATH OpenFDO

Authors Yongwook Choi, Wojciech Szpankowski, Charles Knessl

Publication date 29 September 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAQ0101/0.html

zbMATH Keywords

digital treesgraph compressionMellin transformPoissonization

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• On a recurrence arising in graph compression
• Towards a complete characterization of tries
• The Ubiquitous Digital Tree
• Digital trees and memoryless sources: from arithmetics to analysis
• Profiles of Tries

Cited in

(1)

• On a recurrence arising in graph compression

This page was built for publication: A new binomial recurrence arising in a graphical compression algorithm

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