License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2018.16
URN: urn:nbn:de:0030-drops-95982
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9598/
Seelbach Benkner, Louisa ;
Lohrey, Markus
Average Case Analysis of Leaf-Centric Binary Tree Sources
Abstract
We study the average size of the minimal directed acyclic graph (DAG) with respect to so-called leaf-centric binary tree sources as studied by Zhang, Yang, and Kieffer. A leaf-centric binary tree source induces for every n >= 2 a probability distribution on all binary trees with n leaves. We generalize a result shown by Flajolet, Gourdon, Martinez and Devroye according to which the average size of the minimal DAG of a binary tree that is produced by the binary search tree model is Theta(n / log n).
BibTeX - Entry
@InProceedings{seelbachbenkner_et_al:LIPIcs:2018:9598,
author = {Louisa Seelbach Benkner and Markus Lohrey},
title = {{Average Case Analysis of Leaf-Centric Binary Tree Sources}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Igor Potapov and Paul Spirakis and James Worrell},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9598},
URN = {urn:nbn:de:0030-drops-95982},
doi = {10.4230/LIPIcs.MFCS.2018.16},
annote = {Keywords: Directed acylic graphs, average case analysis, tree compression}
}
|
Keywords: |
|
Directed acylic graphs, average case analysis, tree compression |
|
Collection: |
|
43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
27.08.2018 |
