Lossless Compression of Binary Trees With Correlated Vertex Names

DOI10.1109/TIT.2018.2851224zbMath1401.94102DBLPjournals/tit/MagnerTS18OpenAlexW2811001158WikidataQ90183779 ScholiaQ90183779MaRDI QIDQ4682896

Abram Magner, Krzysztof Turowski, Wojciech Szpankowski

Publication date: 19 September 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2018.2851224

Mathematics Subject Classification ID

Data structures (68P05) Source coding (94A29)

Related Items (2)

Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Compression of dynamic graphs generated by a duplication model

This page was built for publication: Lossless Compression of Binary Trees With Correlated Vertex Names