Average case analysis of leaf-centric binary tree sources

DOI10.4230/LIPICS.MFCS.2018.16MaRDI QIDQ5005115zbMATH OpenFDO

Authors Markus Lohrey

Publication date 4 August 2021

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2018.16

zbMATH Keywords

average case analysisdirected acylic graphstree compression

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 4023312
• scientific article; zbMATH DE number 3858431
• Efficiency of lossless compression of a binary tree via its minimal directed acyclic graph representation
• Typical depth of a digital search tree built on a general source
• Properties of Binary Trees Related to Position

Cites work

• scientific article; zbMATH DE number 1080355 (Why is no real title available?)
• On the richness of the collection of subtrees in random binary search trees
• XML compression via directed acyclic graphs

Cited in

(6)

• Distinct fringe subtrees in random trees
• Average case analysis for tree labelling schemes
• Efficiency of lossless compression of a binary tree via its minimal directed acyclic graph representation
• scientific article; zbMATH DE number 6605055 (Why is no real title available?)
• Compaction for two models of logarithmic‐depth trees: Analysis and experiments
• On the number of distinct fringe subtrees in binary search trees

This page was built for publication: Average case analysis of leaf-centric binary tree sources

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