On a recurrence arising in graph compression

zbMATH Open1252.05033MaRDI QIDQ456337FDOQ456337

Authors: Yongwook Choi, Charles Knessl, Wojciech Szpankowski 

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p15

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A new binomial recurrence arising in a graphical compression algorithm
• Towards a complete characterization of tries
• Profiles of Tries
• Digital trees and memoryless sources: from arithmetics to analysis
• Concentration of Size and Path Length of Tries

zbMATH Keywords

Mellin transformgraph compressiondigital treespoissonization

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms (68W40)

Cited In (3)

• A new binomial recurrence arising in a graphical compression algorithm
• Title not available (Why is that?)
• Compressions, graphs, and hyperreflexivity

This page was built for publication: On a recurrence arising in graph compression

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