On linear combinations of units with bounded coefficients and double-base digit expansions, with Jörg Thuswaldner and Volker Ziegler. Monatsh. Math., 171(3–4):377–394, 2013.

Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions, with Clemens Heuberger and Stephan Wagner. In Proceedings of the Meeting on Analytic Algorithmics & Combinatorics (ANALCO), New Orleans, Louisiana, USA, January 6, 2013, 33–42. Philadelphia PA, 2013. SIAM.

Analysis of width-w non-adjacent forms to imaginary quadratic bases, with Clemens Heuberger. J. Number Theory, 133(5):1752–1808, 2013.

Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices. Theoret. Comput. Sci., 491:47–70, 2013.

Existence and optimality of w-non-adjacent forms with an algebraic integer base, with Clemens Heuberger. Acta Math. Hungar., 140(1–2):90–104, 2013.

Optimality of the width-w non-adjacent form: general characterisation and the case of imaginary quadratic bases, with Clemens Heuberger. J. Théor. Nombres Bordeaux, 25(2):353–386, 2013.

Sylow p-groups of polynomial permutations on the integers mod pⁿ, with Sophie Frisch. J. Number Theory, 133(12):4188–4199, 2013.

On the number of multi-base representations of an integer, with Dimbinaina Ralaivaosaona and Stephan Wagner. In 25th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'14), volume BA of DMTCS-HAL Proceedings, 229–240. 2014.

The number of compositions into powers of b, with Stephan Wagner. In 25th International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'14), volume BA of DMTCS-HAL Proceedings Series, 241–252. 2014.

Canonical trees, compact prefix-free codes and sums of unit fractions: a probabilistic analysis, with Clemens Heuberger and Stephan Wagner. SIAM J. Discrete Math., 29(3):1600–1653, 2015.

Multi-base representations of integers: asymptotic enumeration and central limit theorems, with Dimbinaina Ralaivaosaona and Stephan Wagner. Appl. Anal. Discrete Math., 9(2):285–312, 2015.

Automata in SageMath—combinatorics meets theoretical computer science, with Clemens Heuberger and Sara Kropf. Discrete Math. Theor. Comput. Sci., 2016.

Compositions into powers of b: asymptotic enumeration and parameters, with Stephan Wagner. Algorithmica, 75(4):606–631, August 2016.

Counting zeros in random walks on the integers and analysis of optimal dual-pivot quicksort, with Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, and Helmut Prodinger. In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. 2016.

An extended note on the comparison-optimal dual-pivot quickselect. In 2017 Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 115–123. SIAM, 2017.

Non-minimality of the width-w non-adjacent form in conjunction with trace one τ-adic digit expansions and Koblitz curves in characteristic two, with Volker Ziegler. Math. Comp., 87(310):821–854, 2018.

Analysis of summatory functions of regular sequences: transducer and Pascal's rhombus, with Clemens Heuberger and Helmut Prodinger. In James Allen Fill and Mark Daniel Ward, editors, Proceedings of the 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, volume 110 of Leibniz International Proceedings in Informatics (LIPIcs), 27:1–27:18. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2018.

Esthetic numbers and lifting restrictions on the analysis of summatory functions of regular sequences, with Clemens Heuberger. In 2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 27–35. SIAM, 2019.

Dual-pivot quicksort: Optimality, analysis and zeros of associated lattice paths, with Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, and Helmut Prodinger. Combin. Probab. Comput., 28(4):485–518, 2019.

An optimization-based sum-of-squares approach to Vizing's conjecture, with Elisabeth Gaar, Susan Margulies, and Angelika Wiegele. In ISSAC'19—Proceedings of the 2019 ACM International Symposium on Symbolic and Algebraic Computation, 155–162. ACM, New York, 2019.

Asymptotic analysis of regular sequences, with Clemens Heuberger. Algorithmica, 82(3):429–508, 2020.

On the minimal Hamming weight of a multi-base representation, with Vorapong Suppakitpaisarn and Stephan Wagner. J. Number Theory, 208:168–179, 2020.

Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares, with Elisabeth Gaar, Susan Margulies, and Angelika Wiegele. J. Symbolic Comput., 107:67–105, 2021.

Decidability and k-regular sequences, with Jeffrey Shallit. Theoret. Comput. Sci., 907:34–44, 2022.

Asymptotic analysis of q-recursive sequences, with Clemens Heuberger and Gabriel F. Lipnik. Algorithmica, 84(9):2480–2532, 2022.

A characterization of graphs with regular distance-2 graphs, with Elisabeth Gaar. Discrete Appl. Math., 324:181–218, 2023.