×

Found 14 Documents (Results 1–14)

Reducing simply generated trees by iterative leaf cutting. (English) Zbl 1433.05075

Mishna, Marni (ed.) et al., Proceedings of the 16th workshop on analytic algorithmics and combinatorics, ANALCO ’19, San Diego, CA, USA, January 6, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 36-44 (2019).
MSC:  05C05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Counting ascents in generalized Dyck paths. (English) Zbl 1482.05012

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 26, 15 p. (2018).
MSC:  05A15
PDFBibTeX XMLCite
Full Text: DOI arXiv

Iterative cutting and pruning of planar trees. (English) Zbl 1433.05076

Martínez, Conrado (ed.) et al., Proceedings of the 14th workshop on analytic algorithmics and combinatorics, ANALCO ’17, Barcelona, Spain, January 16–17, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 66-72 (2017).
MSC:  05C05 05C10 05C76
PDFBibTeX XMLCite
Full Text: DOI

The register function and reductions of binary trees and lattice paths. (English) Zbl 1409.05022

Neininger, Ralph (ed.) et al., Proceedings of the 27th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms – AofA’16, Kraków, Poland, July 4–8, 2016. Kraków: Jagiellonian University, Department of Theoretical Computer Science. 12 p. (2016).
PDFBibTeX XMLCite
Full Text: arXiv

Filter Results by …

Database

all top 5

Year of Publication

all top 3

Main Field