Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. - Clemens Heuberger; Daniel Krenn; Stephan G. Wagner (ANALCO, 2013)

Analysis of the width-ww non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices. - Daniel Krenn (Theor. Comput. Sci., 2013)

Automata and Transducers in the Computer Algebra System Sage. - Clemens Heuberger; Daniel Krenn; Sara Kropf (CoRR, 2014)

Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis. - Clemens Heuberger; Daniel Krenn; Stephan G. Wagner (SIAM J. Discret. Math., 2015)

Compositions into Powers of b: Asymptotic Enumeration and Parameters. - Daniel Krenn; Stephan G. Wagner (Algorithmica, 2016)

Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. - Martin Aumüller 001; Martin Dietzfelbinger; Clemens Heuberger; Daniel Krenn; Helmut Prodinger (CoRR, 2016)

Automata in SageMath - Combinatorics meet Theoretical Computer Science. - Clemens Heuberger; Daniel Krenn; Sara Kropf (Discret. Math. Theor. Comput. Sci., 2016)

An Extended Note on the Comparison-optimal Dual-Pivot Quickselect. - Daniel Krenn (ANALCO, 2017)

Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus. - Clemens Heuberger; Daniel Krenn; Helmut Prodinger (AofA, 2018)

Non-minimality of the width-w non-adjacent form in conjunction with trace one 휏-adic digit expansions and Koblitz curves in characteristic two. - Daniel Krenn; Volker Ziegler (Math. Comput., 2018)

Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. - Clemens Heuberger; Daniel Krenn (ANALCO, 2019)

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. - Elisabeth Gaar; Angelika Wiegele; Daniel Krenn; Susan Margulies (ISSAC, 2019)

Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. - Martin Aumüller 001; Martin Dietzfelbinger; Clemens Heuberger; Daniel Krenn; Helmut Prodinger (Comb. Probab. Comput., 2019)

Asymptotic Analysis of Regular Sequences. - Clemens Heuberger; Daniel Krenn (Algorithmica, 2020)

Decidability and k-Regular Sequences. - Daniel Krenn; Jeffrey O. Shallit (CoRR, 2020)

Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares. - Elisabeth Gaar; Daniel Krenn; Susan Margulies; Angelika Wiegele (J. Symb. Comput., 2021)

Asymptotic Analysis of q-Recursive Sequences. - Clemens Heuberger; Daniel Krenn; Gabriel F. Lipnik (Algorithmica, 2022)

Decidability and k-regular sequences. - Daniel Krenn; Jeffrey O. Shallit (Theor. Comput. Sci., 2022)

A characterization of graphs with regular distance-2 graphs. - Elisabeth Gaar; Daniel Krenn (Discret. Appl. Math., 2023)

Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. - Clemens Heuberger; Daniel Krenn; Tobias Lechner (AofA, 2024)

Strongly k-recursive sequences. - Daniel Krenn; Jeffrey O. Shallit (CoRR, 2024)

A note on the relation between recognisable series and regular sequences, and their minimal linear representations. - Clemens Heuberger; Daniel Krenn; Gabriel F. Lipnik (J. Symb. Comput., 2024)

Fluctuation Find Min and Max. - Clemens Heuberger; Daniel Krenn; Tobias Lechner (DROPS Artifacts, 2024)

Algorithmic counting of nonequivalent compact Huffman codes. - Christian Elsholtz; Clemens Heuberger; Daniel Krenn (Appl. Algebra Eng. Commun. Comput., 2024)