On a Family of Quintic Thue Equations. - Clemens Heuberger (J. Symb. Comput., 1998)

Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs. - Clemens Heuberger (Computing, 1999)

On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis. - Clemens Heuberger; Helmut Prodinger (Computing, 2001)

On hamiltonian Toeplitz graphs. - Clemens Heuberger (Discret. Math., 2002)

Thomas' Family of Thue Equations Over Imaginary Quadratic Fields. - Clemens Heuberger; Attila Pethö; Robert F. Tichy (J. Symb. Comput., 2002)

On planarity and colorability of circulant graphs. - Clemens Heuberger (Discret. Math., 2003)

Carry propagation in signed digit representations. - Clemens Heuberger; Helmut Prodinger (Eur. J. Comb., 2003)

Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results. - Clemens Heuberger (J. Comb. Optim., 2004)

Automatic solution of families of Thue equations and an example of degree 8. - Clemens Heuberger; Alain Togbé; Volker Ziegler (J. Symb. Comput., 2004)

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms. - Clemens Heuberger (Period. Math. Hung., 2004)

Distribution results for low-weight binary representations for pairs of integers. - Peter J. Grabner; Clemens Heuberger; Helmut Prodinger (Theor. Comput. Sci., 2004)

Minimality of the Hamming Weight of the T-NAF for Koblitz Curves and Improved Combination with Point Halving. - Roberto Maria Avanzi; Clemens Heuberger; Helmut Prodinger (Selected Areas in Cryptography, 2005)

Minimality of the Hamming Weight of the tau-NAF for Koblitz Curves and Improved Combination with Point Halving. - Roberto Maria Avanzi; Clemens Heuberger; Helmut Prodinger (IACR Cryptol. ePrint Arch., 2005)

Analysis of linear combination algorithms in cryptography. - Peter J. Grabner; Clemens Heuberger; Helmut Prodinger; Jörg M. Thuswaldner (ACM Trans. Algorithms, 2005)

The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography. - Clemens Heuberger; Rajendra S. Katti; Helmut Prodinger; Xiaoyu Ruan (Theor. Comput. Sci., 2005)

On Redundant tau -Adic Expansions and Non-adjacent Digit Sets. - Roberto Maria Avanzi; Clemens Heuberger; Helmut Prodinger (Selected Areas in Cryptography, 2006)

Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis. - Roberto Maria Avanzi; Clemens Heuberger; Helmut Prodinger (Algorithmica, 2006)

On the Number of Optimal Base 2 Representations of Integers. - Peter J. Grabner; Clemens Heuberger (Des. Codes Cryptogr., 2006)

All solutions to Thomas' family of Thue equations over imaginary quadratic number fields. - Clemens Heuberger (J. Symb. Comput., 2006)

On α-greedy expansions of numbers. - Clemens Heuberger; Helmut Prodinger (Adv. Appl. Math., 2007)

Minimal weight and colexicographically minimal integer representations. - Clemens Heuberger; James A. Muir (J. Math. Cryptol., 2007)

The Hamming weight of the non-adjacent-form under various input statistics. - Clemens Heuberger; Helmut Prodinger (Period. Math. Hung., 2007)

Randomness with Respect to the Signed-Digit Representation. - Margaret Archibald; Vasco Brattka; Clemens Heuberger (Fundam. Informaticae, 2008)

Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication. - Roberto Maria Avanzi; Clemens Heuberger; Helmut Prodinger (IACR Cryptol. ePrint Arch., 2008)

Redundant tau-adic Expansions II: Non-Optimality and Chaotic Behaviour. - Clemens Heuberger (IACR Cryptol. ePrint Arch., 2008)

Maximizing the number of independent subsets over trees with bounded degree. - Clemens Heuberger; Stephan G. Wagner (J. Graph Theory, 2008)

Editorial. - Clemens Heuberger; Vincent Rijmen (Computing, 2009)

Unbalanced digit sets and the closest choice strategy for minimal weight integer representations. - Clemens Heuberger; James A. Muir (Des. Codes Cryptogr., 2009)

Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations. - Clemens Heuberger; Helmut Prodinger (Int. J. Found. Comput. Sci., 2009)

Arithmetic of Supersingular Koblitz Curves in Characteristic Three. - Roberto Avanzi; Clemens Heuberger; Helmut Prodinger (IACR Cryptol. ePrint Arch., 2010)

Redundant τ-Adic Expansions II: Non-Optimality and Chaotic Behaviour. - Clemens Heuberger (Math. Comput. Sci., 2010)

Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three. - Roberto Maria Avanzi; Clemens Heuberger (Public Key Cryptography, 2011)

Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. - Roberto Maria Avanzi; Clemens Heuberger; Helmut Prodinger (Des. Codes Cryptogr., 2011)

The number of maximum matchings in a tree. - Clemens Heuberger; Stephan G. Wagner (Discret. Math., 2011)

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

The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions. - Christian Elsholtz; Clemens Heuberger; Helmut Prodinger (IEEE Trans. Inf. Theory, 2013)

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

Analysis of the Binary Asymmetric Joint Sparse Form. - Clemens Heuberger; Sara Kropf (Comb. Probab. Comput., 2014)

Symmetric digit sets for elliptic curve scalar multiplication without precomputation. - Clemens Heuberger; Michela Mazzoli (Theor. Comput. Sci., 2014)

Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation. - Clemens Heuberger; Sara Kropf; Helmut Prodinger (Electron. J. Comb., 2015)

Variances and covariances in the Central Limit Theorem for the output of a transducer. - Clemens Heuberger; Sara Kropf; Stephan G. Wagner (Eur. J. Comb., 2015)

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)

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)

Application of Smirnov Words to Waiting Time Distributions of Runs. - Uta R. Freiberg; Clemens Heuberger; Helmut Prodinger (Electron. J. Comb., 2017)

Counting Ascents in Generalized Dyck Paths. - Benjamin Hackl; Clemens Heuberger; Helmut Prodinger (AofA, 2018)

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

Reductions of binary trees and lattice paths induced by the register function. - Benjamin Hackl; Clemens Heuberger; Helmut Prodinger (Theor. Comput. Sci., 2018)

Reducing Simply Generated Trees by Iterative Leaf Cutting. - Benjamin Hackl; Clemens Heuberger; Stephan G. Wagner (ANALCO, 2019)

Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. - Clemens Heuberger; Daniel Krenn (ANALCO, 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)

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

Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$. - Clemens Heuberger; Sarah J. Selkirk; Stephan G. Wagner (Electron. J. Comb., 2023)

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

The distribution of the maximum protection number in simply generated trees. - Clemens Heuberger; Sarah J. Selkirk; Stephan Wagner 003 (Comb. Probab. Comput., 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)