Clemens Heuberger

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 17

Top Topics

Central Limit Theorem

Computer Algebra

Asymptotic Analysis

Top Venues

Electron. J. Comb.

Comb. Probab. Comput.

Publications

Clemens Heuberger, Daniel Krenn, Tobias Lechner
Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. AofA (2024)
Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik
A note on the relation between recognisable series and regular sequences, and their minimal linear representations. J. Symb. Comput. 123 (2024)
Clemens Heuberger, Sarah J. Selkirk, Stephan G. Wagner
Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$. Electron. J. Comb. 30 (1) (2023)
Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik
Asymptotic Analysis of q-Recursive Sequences. Algorithmica 84 (9) (2022)
Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik
A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations. CoRR (2022)
Clemens Heuberger, Daniel Krenn
Asymptotic Analysis of Regular Sequences. Algorithmica 82 (3) (2020)
Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner
Reducing Simply Generated Trees by Iterative Leaf Cutting. ANALCO (2019)
Clemens Heuberger, Daniel Krenn
Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. ANALCO (2019)
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. Comb. Probab. Comput. 28 (4) (2019)
Christian Elsholtz, Clemens Heuberger, Daniel Krenn
Algorithmic counting of nonequivalent compact Huffman codes. CoRR (2019)
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
Counting Ascents in Generalized Dyck Paths. AofA (2018)
Benjamin Hackl, Clemens Heuberger, Helmut Prodinger
Reductions of binary trees and lattice paths induced by the register function. Theor. Comput. Sci. 705 (2018)
Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus. AofA (2018)
Uta R. Freiberg, Clemens Heuberger, Helmut Prodinger
Application of Smirnov Words to Waiting Time Distributions of Runs. Electron. J. Comb. 24 (3) (2017)
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. CoRR (2016)
Clemens Heuberger, Daniel Krenn, Sara Kropf
Automata in SageMath - Combinatorics meet Theoretical Computer Science. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort. CoRR (2016)
Clemens Heuberger, Sara Kropf, Helmut Prodinger
Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation. Electron. J. Comb. 22 (2) (2015)
Clemens Heuberger, Sara Kropf, Stephan G. Wagner
Variances and covariances in the Central Limit Theorem for the output of a transducer. Eur. J. Comb. 49 (2015)
Clemens Heuberger, Daniel Krenn, Stephan G. Wagner
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis. SIAM J. Discret. Math. 29 (3) (2015)
Clemens Heuberger, Sara Kropf
Analysis of the Binary Asymmetric Joint Sparse Form. Comb. Probab. Comput. 23 (6) (2014)
Clemens Heuberger, Daniel Krenn, Sara Kropf
Automata and Transducers in the Computer Algebra System Sage. CoRR (2014)
Clemens Heuberger, Michela Mazzoli
Symmetric digit sets for elliptic curve scalar multiplication without precomputation. Theor. Comput. Sci. 547 (2014)
Clemens Heuberger, Michela Mazzoli
Symmetric Digit Sets for Elliptic Curve Scalar Multiplication without Precomputation. IACR Cryptol. ePrint Arch. 2013 (2013)
Christian Elsholtz, Clemens Heuberger, Helmut Prodinger
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions. IEEE Trans. Inf. Theory 59 (2) (2013)
Clemens Heuberger, Daniel Krenn, Stephan G. Wagner
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. ANALCO (2013)
Roberto Maria Avanzi, Clemens Heuberger
Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three. Public Key Cryptography (2011)
Clemens Heuberger, Stephan G. Wagner
The number of maximum matchings in a tree. Discret. Math. 311 (21) (2011)
Christian Elsholtz, Clemens Heuberger, Helmut Prodinger
The number of Huffman codes, compact trees, and sums of unit fractions CoRR (2011)
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. Des. Codes Cryptogr. 58 (2) (2011)
Clemens Heuberger
-Adic Expansions II: Non-Optimality and Chaotic Behaviour. Math. Comput. Sci. 3 (2) (2010)
Roberto Avanzi, Clemens Heuberger, Helmut Prodinger
Arithmetic of Supersingular Koblitz Curves in Characteristic Three. IACR Cryptol. ePrint Arch. 2010 (2010)
Clemens Heuberger, Vincent Rijmen
Editorial. Computing 85 (1-2) (2009)
Clemens Heuberger, James A. Muir
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations. Des. Codes Cryptogr. 52 (2) (2009)
Clemens Heuberger, Helmut Prodinger
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations. Int. J. Found. Comput. Sci. 20 (3) (2009)
Clemens Heuberger, Stephan G. Wagner
Maximizing the number of independent subsets over trees with bounded degree. J. Graph Theory 58 (1) (2008)
Clemens Heuberger
Redundant tau-adic Expansions II: Non-Optimality and Chaotic Behaviour. IACR Cryptol. ePrint Arch. 2008 (2008)
Clemens Heuberger, James A. Muir
Unbalanced Digit Sets and the Closest Choice Strategy for Minimal Weight Integer Representations. IACR Cryptol. ePrint Arch. 2008 (2008)
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication. IACR Cryptol. ePrint Arch. 2008 (2008)
Margaret Archibald, Vasco Brattka, Clemens Heuberger
Randomness with Respect to the Signed-Digit Representation. Fundam. Informaticae 83 (1-2) (2008)
Clemens Heuberger, James A. Muir
Minimal weight and colexicographically minimal integer representations. J. Math. Cryptol. 1 (4) (2007)
Clemens Heuberger, Helmut Prodinger
-greedy expansions of numbers. Adv. Appl. Math. 38 (4) (2007)
Clemens Heuberger, Helmut Prodinger
The Hamming weight of the non-adjacent-form under various input statistics. Period. Math. Hung. 55 (1) (2007)
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis. Algorithmica 46 (3-4) (2006)
Clemens Heuberger, James A. Muir
Minimal Weight and Colexicographically Minimal Integer Representations. IACR Cryptol. ePrint Arch. 2006 (2006)
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
-Adic Expansions and Non-adjacent Digit Sets. Selected Areas in Cryptography (2006)
Peter J. Grabner, Clemens Heuberger
On the Number of Optimal Base 2 Representations of Integers. Des. Codes Cryptogr. 40 (1) (2006)
Clemens Heuberger
All solutions to Thomas' family of Thue equations over imaginary quadratic number fields. J. Symb. Comput. 41 (9) (2006)
Clemens Heuberger, Rajendra S. Katti, Helmut Prodinger, Xiaoyu Ruan
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography. Theor. Comput. Sci. 341 (1-3) (2005)
Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner
Analysis of linear combination algorithms in cryptography. ACM Trans. Algorithms 1 (1) (2005)
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving. IACR Cryptol. ePrint Arch. 2005 (2005)
Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger
-NAF for Koblitz Curves and Improved Combination with Point Halving. Selected Areas in Cryptography (2005)
Clemens Heuberger
Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms. Period. Math. Hung. 49 (2) (2004)
Peter J. Grabner, Clemens Heuberger, Helmut Prodinger
Distribution results for low-weight binary representations for pairs of integers. Theor. Comput. Sci. 319 (1-3) (2004)
Clemens Heuberger, Alain Togbé, Volker Ziegler
Automatic solution of families of Thue equations and an example of degree 8. J. Symb. Comput. 38 (3) (2004)
Clemens Heuberger
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results. J. Comb. Optim. 8 (3) (2004)
Clemens Heuberger
On planarity and colorability of circulant graphs. Discret. Math. 268 (1-3) (2003)
Clemens Heuberger, Helmut Prodinger
Carry propagation in signed digit representations. Eur. J. Comb. 24 (3) (2003)
Clemens Heuberger
On hamiltonian Toeplitz graphs. Discret. Math. 245 (1-3) (2002)
Clemens Heuberger, Attila Pethö, Robert F. Tichy
Thomas' Family of Thue Equations Over Imaginary Quadratic Fields. J. Symb. Comput. 34 (5) (2002)
Clemens Heuberger, Helmut Prodinger
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis. Computing 66 (4) (2001)
Clemens Heuberger
Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs. Computing 63 (4) (1999)
Clemens Heuberger
On a Family of Quintic Thue Equations. J. Symb. Comput. 26 (2) (1998)