default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClemens Heuberger
Person information
- affiliation: Alpen-Adria-Universität Klagenfurt, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
Algorithmic counting of nonequivalent compact Huffman codes. Appl. Algebra Eng. Commun. Comput. 35(6): 887-903 (2024)- [j41]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: 102295 (2024) - [c9]Clemens Heuberger, Daniel Krenn, Tobias Lechner:
Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. AofA 2024: 24:1-24:14 - 2023
- [j40]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) - 2022
- [j39]Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik:
Asymptotic Analysis of q-Recursive Sequences. Algorithmica 84(9): 2480-2532 (2022) - [i13]Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik:
A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations. CoRR abs/2201.13446 (2022) - 2020
- [j38]Clemens Heuberger, Daniel Krenn:
Asymptotic Analysis of Regular Sequences. Algorithmica 82(3): 429-508 (2020) - [e2]Michael Drmota, Clemens Heuberger:
31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2020, June 15-19, 2020, Klagenfurt, Austria (Virtual Conference). LIPIcs 159, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-147-4 [contents]
2010 – 2019
- 2019
- [j37]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): 485-518 (2019) - [c8]Clemens Heuberger, Daniel Krenn:
Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. ANALCO 2019: 27-35 - [c7]Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner:
Reducing Simply Generated Trees by Iterative Leaf Cutting. ANALCO 2019: 36-44 - [i12]Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
Algorithmic counting of nonequivalent compact Huffman codes. CoRR abs/1901.11343 (2019) - 2018
- [j36]Benjamin Hackl, Clemens Heuberger, Helmut Prodinger:
Reductions of binary trees and lattice paths induced by the register function. Theor. Comput. Sci. 705: 31-57 (2018) - [c6]Benjamin Hackl, Clemens Heuberger, Helmut Prodinger:
Counting Ascents in Generalized Dyck Paths. AofA 2018: 26:1-26:15 - [c5]Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus. AofA 2018: 27:1-27:18 - 2017
- [j35]Uta R. Freiberg, Clemens Heuberger, Helmut Prodinger:
Application of Smirnov Words to Waiting Time Distributions of Runs. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j34]Clemens Heuberger, Daniel Krenn, Sara Kropf:
Automata in SageMath - Combinatorics meet Theoretical Computer Science. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - [i11]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 abs/1602.04031 (2016) - [i10]Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger:
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths. CoRR abs/1611.00258 (2016) - 2015
- [j33]Clemens Heuberger, Sara Kropf, Helmut Prodinger:
Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation. Electron. J. Comb. 22(2): 2 (2015) - [j32]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: 167-187 (2015) - [j31]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): 1600-1653 (2015) - 2014
- [j30]Clemens Heuberger, Sara Kropf:
Analysis of the Binary Asymmetric Joint Sparse Form. Comb. Probab. Comput. 23(6): 1087-1113 (2014) - [j29]Clemens Heuberger, Michela Mazzoli:
Symmetric digit sets for elliptic curve scalar multiplication without precomputation. Theor. Comput. Sci. 547: 18-33 (2014) - [e1]Christian Pötzsche, Clemens Heuberger, Barbara Kaltenbacher, Franz Rendl:
System Modeling and Optimization - 26th IFIP TC 7 Conference, CSMO 2013, Klagenfurt, Austria, September 9-13, 2013, Revised Selected Papers. IFIP Advances in Information and Communication Technology 443, Springer 2014, ISBN 978-3-662-45503-6 [contents] - [i9]Clemens Heuberger, Daniel Krenn, Sara Kropf:
Automata and Transducers in the Computer Algebra System Sage. CoRR abs/1404.7458 (2014) - 2013
- [j28]Christian Elsholtz, Clemens Heuberger, Helmut Prodinger:
The Number of Huffman Codes, Compact Trees, and Sums of Unit Fractions. IEEE Trans. Inf. Theory 59(2): 1065-1075 (2013) - [c4]Clemens Heuberger, Daniel Krenn, Stephan G. Wagner:
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. ANALCO 2013: 33-42 - [i8]Clemens Heuberger, Michela Mazzoli:
Symmetric Digit Sets for Elliptic Curve Scalar Multiplication without Precomputation. IACR Cryptol. ePrint Arch. 2013: 705 (2013) - 2011
- [j27]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Redundant τ-adic expansions I: non-adjacent digit sets and their applications to scalar multiplication. Des. Codes Cryptogr. 58(2): 173-202 (2011) - [j26]Clemens Heuberger, Stephan G. Wagner:
The number of maximum matchings in a tree. Discret. Math. 311(21): 2512-2542 (2011) - [c3]Roberto Maria Avanzi, Clemens Heuberger:
Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three. Public Key Cryptography 2011: 109-127 - [i7]Christian Elsholtz, Clemens Heuberger, Helmut Prodinger:
The number of Huffman codes, compact trees, and sums of unit fractions. CoRR abs/1108.5964 (2011) - 2010
- [j25]Clemens Heuberger:
Redundant τ-Adic Expansions II: Non-Optimality and Chaotic Behaviour. Math. Comput. Sci. 3(2): 141-157 (2010) - [i6]Roberto Avanzi, Clemens Heuberger, Helmut Prodinger:
Arithmetic of Supersingular Koblitz Curves in Characteristic Three. IACR Cryptol. ePrint Arch. 2010: 436 (2010)
2000 – 2009
- 2009
- [j24]Clemens Heuberger, Vincent Rijmen:
Editorial. Computing 85(1-2): 1-2 (2009) - [j23]Clemens Heuberger, James A. Muir:
Unbalanced digit sets and the closest choice strategy for minimal weight integer representations. Des. Codes Cryptogr. 52(2): 185-208 (2009) - [j22]Clemens Heuberger, Helmut Prodinger:
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations. Int. J. Found. Comput. Sci. 20(3): 443-453 (2009) - 2008
- [j21]Margaret Archibald, Vasco Brattka, Clemens Heuberger:
Randomness with Respect to the Signed-Digit Representation. Fundam. Informaticae 83(1-2): 1-19 (2008) - [j20]Clemens Heuberger, Stephan G. Wagner:
Maximizing the number of independent subsets over trees with bounded degree. J. Graph Theory 58(1): 49-68 (2008) - [i5]Clemens Heuberger, James A. Muir:
Unbalanced Digit Sets and the Closest Choice Strategy for Minimal Weight Integer Representations. IACR Cryptol. ePrint Arch. 2008: 135 (2008) - [i4]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: 148 (2008) - [i3]Clemens Heuberger:
Redundant tau-adic Expansions II: Non-Optimality and Chaotic Behaviour. IACR Cryptol. ePrint Arch. 2008: 153 (2008) - 2007
- [j19]Clemens Heuberger, Helmut Prodinger:
On α-greedy expansions of numbers. Adv. Appl. Math. 38(4): 505-525 (2007) - [j18]Clemens Heuberger, James A. Muir:
Minimal weight and colexicographically minimal integer representations. J. Math. Cryptol. 1(4): 297-328 (2007) - [j17]Clemens Heuberger, Helmut Prodinger:
The Hamming weight of the non-adjacent-form under various input statistics. Period. Math. Hung. 55(1): 81-96 (2007) - 2006
- [j16]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): 249-270 (2006) - [j15]Peter J. Grabner, Clemens Heuberger:
On the Number of Optimal Base 2 Representations of Integers. Des. Codes Cryptogr. 40(1): 25-39 (2006) - [j14]Clemens Heuberger:
All solutions to Thomas' family of Thue equations over imaginary quadratic number fields. J. Symb. Comput. 41(9): 980-998 (2006) - [c2]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
On Redundant tau -Adic Expansions and Non-adjacent Digit Sets. Selected Areas in Cryptography 2006: 285-301 - [i2]Clemens Heuberger, James A. Muir:
Minimal Weight and Colexicographically Minimal Integer Representations. IACR Cryptol. ePrint Arch. 2006: 209 (2006) - 2005
- [j13]Peter J. Grabner, Clemens Heuberger, Helmut Prodinger, Jörg M. Thuswaldner:
Analysis of linear combination algorithms in cryptography. ACM Trans. Algorithms 1(1): 123-142 (2005) - [j12]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): 55-72 (2005) - [c1]Roberto Maria Avanzi, Clemens Heuberger, Helmut Prodinger:
Minimality of the Hamming Weight of the T-NAF for Koblitz Curves and Improved Combination with Point Halving. Selected Areas in Cryptography 2005: 332-344 - [i1]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: 225 (2005) - 2004
- [j11]Clemens Heuberger:
Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results. J. Comb. Optim. 8(3): 329-361 (2004) - [j10]Clemens Heuberger, Alain Togbé, Volker Ziegler:
Automatic solution of families of Thue equations and an example of degree 8. J. Symb. Comput. 38(3): 1145-1163 (2004) - [j9]Clemens Heuberger:
Minimal expansions in redundant number systems: Fibonacci bases and Greedy algorithms. Period. Math. Hung. 49(2): 65-89 (2004) - [j8]Peter J. Grabner, Clemens Heuberger, Helmut Prodinger:
Distribution results for low-weight binary representations for pairs of integers. Theor. Comput. Sci. 319(1-3): 307-331 (2004) - 2003
- [j7]Clemens Heuberger:
On planarity and colorability of circulant graphs. Discret. Math. 268(1-3): 153-169 (2003) - [j6]Clemens Heuberger, Helmut Prodinger:
Carry propagation in signed digit representations. Eur. J. Comb. 24(3): 293-320 (2003) - 2002
- [j5]Clemens Heuberger:
On hamiltonian Toeplitz graphs. Discret. Math. 245(1-3): 107-125 (2002) - [j4]Clemens Heuberger, Attila Pethö, Robert F. Tichy:
Thomas' Family of Thue Equations Over Imaginary Quadratic Fields. J. Symb. Comput. 34(5): 437-449 (2002) - 2001
- [j3]Clemens Heuberger, Helmut Prodinger:
On Minimal Expansions in Redundant Number Systems: Algorithms and Quantitative Analysis. Computing 66(4): 377-393 (2001)
1990 – 1999
- 1999
- [j2]Clemens Heuberger:
Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs. Computing 63(4): 341-349 (1999) - 1998
- [j1]Clemens Heuberger:
On a Family of Quintic Thue Equations. J. Symb. Comput. 26(2): 173-185 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
