Clemens Heuberger, Daniel Krenn, Tobias Lechner. Fluctuation Find Min and Max (Software, Code for Example 9). Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@misc{dagstuhl-artifact-22448, title = {{Fluctuation Find Min and Max}}, author = {Heuberger, Clemens and Krenn, Daniel and Lechner, Tobias}, note = {Software, version 1.0., Austrian Science Fund (FWF) [10.55776/DOC78], swhId: \href{https://archive.softwareheritage.org/swh:1:dir:e3d6789813ee435280117108c7bfd47809aeecc9;origin=https://gitlab.com/cheuberg/fluctuation-find-min-max;visit=swh:1:snp:4c5976f8bc6f69a47e4c593ebe5bee8e221afda3;anchor=swh:1:rev:eff7aab95599c61ea5c9102aceedfa8736742e3b}{\texttt{swh:1:dir:e3d6789813ee435280117108c7bfd47809aeecc9}} (visited on 2024-11-28)}, url = {https://gitlab.com/cheuberg/fluctuation-find-min-max}, doi = {10.4230/artifacts.22448}, }
Published in: LIPIcs, Volume 302, 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)
Clemens Heuberger, Daniel Krenn, and Tobias Lechner. Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. In 35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 302, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{heuberger_et_al:LIPIcs.AofA.2024.24, author = {Heuberger, Clemens and Krenn, Daniel and Lechner, Tobias}, title = {{Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences}}, booktitle = {35th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2024)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-329-4}, ISSN = {1868-8969}, year = {2024}, volume = {302}, editor = {Mailler, C\'{e}cile and Wild, Sebastian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2024.24}, URN = {urn:nbn:de:0030-drops-204597}, doi = {10.4230/LIPIcs.AofA.2024.24}, annote = {Keywords: Regular sequence, Divide-and-Conquer Recurrence, Summatory Function, Asymptotic Analysis} }
Published in: LIPIcs, Volume 159, 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 159, pp. 1-402, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Proceedings{drmota_et_al:LIPIcs.AofA.2020, title = {{LIPIcs, Volume 159, AofA 2020, Complete Volume}}, booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)}, pages = {1--402}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-147-4}, ISSN = {1868-8969}, year = {2020}, volume = {159}, editor = {Drmota, Michael and Heuberger, Clemens}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020}, URN = {urn:nbn:de:0030-drops-120296}, doi = {10.4230/LIPIcs.AofA.2020}, annote = {Keywords: LIPIcs, Volume 159, AofA 2020, Complete Volume} }
Published in: LIPIcs, Volume 159, 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 159, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{drmota_et_al:LIPIcs.AofA.2020.0, author = {Drmota, Michael and Heuberger, Clemens}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-147-4}, ISSN = {1868-8969}, year = {2020}, volume = {159}, editor = {Drmota, Michael and Heuberger, Clemens}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2020.0}, URN = {urn:nbn:de:0030-drops-120309}, doi = {10.4230/LIPIcs.AofA.2020.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)
Benjamin Hackl, Clemens Heuberger, and Helmut Prodinger. Counting Ascents in Generalized Dyck Paths. In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hackl_et_al:LIPIcs.AofA.2018.26, author = {Hackl, Benjamin and Heuberger, Clemens and Prodinger, Helmut}, title = {{Counting Ascents in Generalized Dyck Paths}}, booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-078-1}, ISSN = {1868-8969}, year = {2018}, volume = {110}, editor = {Fill, James Allen and Ward, Mark Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.26}, URN = {urn:nbn:de:0030-drops-89191}, doi = {10.4230/LIPIcs.AofA.2018.26}, annote = {Keywords: Lattice path, Lukasiewicz path, ascent, asymptotic analysis, implicit function, singular inversion} }
Published in: LIPIcs, Volume 110, 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)
Clemens Heuberger, Daniel Krenn, and Helmut Prodinger. Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus. In 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 110, pp. 27:1-27:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{heuberger_et_al:LIPIcs.AofA.2018.27, author = {Heuberger, Clemens and Krenn, Daniel and Prodinger, Helmut}, title = {{Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus}}, booktitle = {29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2018)}, pages = {27:1--27:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-078-1}, ISSN = {1868-8969}, year = {2018}, volume = {110}, editor = {Fill, James Allen and Ward, Mark Daniel}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2018.27}, URN = {urn:nbn:de:0030-drops-89204}, doi = {10.4230/LIPIcs.AofA.2018.27}, annote = {Keywords: Regular sequence, Mellin-Perron summation, summatory function, transducer, Pascal's rhombus} }
Feedback for Dagstuhl Publishing