Compaction for two models of logarithmic‐depth trees: Analysis and experiments-Reference-Cited by-同舟云学术

Compaction for two models of logarithmic‐depth trees: Analysis and experiments

Published:2021-11-13 Issue: Volume: Page:
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Bodini Olivier¹,Genitrini Antoine²,Gittenberger Bernhard³,Larcher Isabella³,Naima Mehdi¹

Affiliation:

1. Université Sorbonne Paris Nord, Laboratoire d'Informatique de Paris Nord, CNRS, UMR 7030 Villetaneuse France

2. Sorbonne Université, CNRS, Laboratoire d'Informatique de Paris 6 ‐LIP6‐ UMR 7606 Paris France

3. Department of Discrete Mathematics and Geometry Technische Universität Wien Vienna Austria

Funder

Austrian Science Fund

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.21056

Reference33 articles.

1. Advanced Mathematical Methods for Scientists and Engineers I

2. L.Seelbach BenknerandM.Lohrey Average case analysis of leaf‐centric binary tree sources Proc. 43rd Int. Sympos. Math. Found. Comput. Sci. MFCS vol. 117 LIPIcs 2018 pp. 16:1–16:15.

3. L. S.BenknerandS. G.Wagner On the collection of fringe subtrees in random binary trees Theor. Inform. 14th Latin Amer. Sympos. (LATIN) vol. 12118 Lect. Notes Comput. Sci. Springer New York NY 2020 pp. 546–558.

4. Varieties of increasing trees

5. O.BodiniandA.Genitrini Cuts in increasing trees Proc. 12th SIAM Meeting Anal. Algorithmics Comb. (ANALCO) San Diego January 2015 pp. 66–77.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Distinct Fringe Subtrees in Random Trees;Algorithmica;2022-08-01