Clemens Heuberger

Orcid: 0000-0003-0082-7334

Affiliations:
  • Alpen-Adria-Universität Klagenfurt, Austria


According to our database1, Clemens Heuberger authored at least 58 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algorithmic counting of nonequivalent compact Huffman codes.
Appl. Algebra Eng. Commun. Comput., November, 2024

A note on the relation between recognisable series and regular sequences, and their minimal linear representations.
J. Symb. Comput., July, 2024

The distribution of the maximum protection number in simply generated trees.
Comb. Probab. Comput., 2024

Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences.
Proceedings of the 35th International Conference on Probabilistic, 2024

2023
Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$.
Electron. J. Comb., 2023

2022
Asymptotic Analysis of q-Recursive Sequences.
Algorithmica, 2022

2020
Asymptotic Analysis of Regular Sequences.
Algorithmica, 2020

2019
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths.
Comb. Probab. Comput., 2019

Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

Reducing Simply Generated Trees by Iterative Leaf Cutting.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Reductions of binary trees and lattice paths induced by the register function.
Theor. Comput. Sci., 2018

Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus.
Proceedings of the 29th International Conference on Probabilistic, 2018

Counting Ascents in Generalized Dyck Paths.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
Application of Smirnov Words to Waiting Time Distributions of Runs.
Electron. J. Comb., 2017

2016
Automata in SageMath - Combinatorics meet Theoretical Computer Science.
Discret. Math. Theor. Comput. Sci., 2016

Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort.
CoRR, 2016

2015
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis.
SIAM J. Discret. Math., 2015

Variances and covariances in the Central Limit Theorem for the output of a transducer.
Eur. J. Comb., 2015

Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation.
Electron. J. Comb., 2015

2014
Symmetric digit sets for elliptic curve scalar multiplication without precomputation.
Theor. Comput. Sci., 2014

Analysis of the Binary Asymmetric Joint Sparse Form.
Comb. Probab. Comput., 2014

Automata and Transducers in the Computer Algebra System Sage.
CoRR, 2014

2013
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions.
IEEE Trans. Inf. Theory, 2013

Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2011
The number of maximum matchings in a tree.
Discret. Math., 2011

Redundant <i>τ</i>-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication.
Des. Codes Cryptogr., 2011

Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

2010
Redundant <i>τ</i>-Adic Expansions II: Non-Optimality and Chaotic Behaviour.
Math. Comput. Sci., 2010

Arithmetic of Supersingular Koblitz Curves in Characteristic Three.
IACR Cryptol. ePrint Arch., 2010

2009
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations.
Int. J. Found. Comput. Sci., 2009

Unbalanced digit sets and the closest choice strategy for minimal weight integer representations.
Des. Codes Cryptogr., 2009

Editorial.
Computing, 2009

2008
Maximizing the number of independent subsets over trees with bounded degree.
J. Graph Theory, 2008

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

Redundant tau-adic Expansions I: Non-Adjacent Digit Sets and their Applications to Scalar Multiplication.
IACR Cryptol. ePrint Arch., 2008

Randomness with Respect to the Signed-Digit Representation.
Fundam. Informaticae, 2008

2007
The Hamming weight of the non-adjacent-form under various input statistics.
Period. Math. Hung., 2007

Minimal weight and colexicographically minimal integer representations.
J. Math. Cryptol., 2007

On <i>α</i>-greedy expansions of numbers.
Adv. Appl. Math., 2007

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

On the Number of Optimal Base 2 Representations of Integers.
Des. Codes Cryptogr., 2006

Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis.
Algorithmica, 2006

On Redundant <i>tau</i> -Adic Expansions and Non-adjacent Digit Sets.
Proceedings of the Selected Areas in Cryptography, 13th International Workshop, 2006

2005
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography.
Theor. Comput. Sci., 2005

Analysis of linear combination algorithms in cryptography.
ACM Trans. Algorithms, 2005

Minimality of the Hamming Weight of the \tau-NAF for Koblitz Curves and Improved Combination with Point Halving.
IACR Cryptol. ePrint Arch., 2005

Minimality of the Hamming Weight of the <i>T</i>-NAF for Koblitz Curves and Improved Combination with Point Halving.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2004
Distribution results for low-weight binary representations for pairs of integers.
Theor. Comput. Sci., 2004

Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms.
Period. Math. Hung., 2004

Automatic solution of families of Thue equations and an example of degree 8.
J. Symb. Comput., 2004

Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results.
J. Comb. Optim., 2004

2003
Carry propagation in signed digit representations.
Eur. J. Comb., 2003

On planarity and colorability of circulant graphs.
Discret. Math., 2003

2002
Thomas' Family of Thue Equations Over Imaginary Quadratic Fields.
J. Symb. Comput., 2002

On hamiltonian Toeplitz graphs.
Discret. Math., 2002

2001
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis.
Computing, 2001

1999
Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs.
Computing, 1999

1998
On a Family of Quintic Thue Equations.
J. Symb. Comput., 1998


  Loading...