40 citations · 178 across the 39 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.NT2011★ 8 cited
Optimality of the Width- Non-adjacent Form: General Characterisation and the Case of Imaginary Quadratic Bases
Clemens Heuberger, Daniel Krenn
Efficient scalar multiplication in Abelian groups (which is an important operation in public key cryptography) can be performed using digital expansions. Apart from rational intege…
math.CO2011★ 18 cited
The number of Huffman codes, compact trees, and sums of unit fractions
Christian Elsholtz, Clemens Heuberger, Helmut Prodinger
The number of "nonequivalent" Huffman codes of length r over an alphabet of size t has been studied frequently. Equivalently, the number of "nonequivalent" complete t-ary trees has…