default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Krenn
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j13]Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
Algorithmic counting of nonequivalent compact Huffman codes. Appl. Algebra Eng. Commun. Comput. 35(6): 887-903 (2024)- [j12]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) - 2023
- [j11]Elisabeth Gaar, Daniel Krenn:
A characterization of graphs with regular distance-2 graphs. Discret. Appl. Math. 324: 181-218 (2023) - 2022
- [j10]Clemens Heuberger, Daniel Krenn, Gabriel F. Lipnik:
Asymptotic Analysis of q-Recursive Sequences. Algorithmica 84(9): 2480-2532 (2022) - [j9]Daniel Krenn, Jeffrey O. Shallit:
Decidability and k-regular sequences. Theor. Comput. Sci. 907: 34-44 (2022) - 2021
- [j8]Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele:
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares. J. Symb. Comput. 107: 67-105 (2021) - 2020
- [j7]Clemens Heuberger, Daniel Krenn:
Asymptotic Analysis of Regular Sequences. Algorithmica 82(3): 429-508 (2020) - 2019
- [j6]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) - 2018
- [j5]Daniel Krenn, Volker Ziegler:
Non-minimality of the width-w non-adjacent form in conjunction with trace one 휏-adic digit expansions and Koblitz curves in characteristic two. Math. Comput. 87(310): 821-854 (2018) - 2016
- [j4]Daniel Krenn, Stephan G. Wagner:
Compositions into Powers of b: Asymptotic Enumeration and Parameters. Algorithmica 75(4): 606-631 (2016) - [j3]Clemens Heuberger, Daniel Krenn, Sara Kropf:
Automata in SageMath - Combinatorics meet Theoretical Computer Science. Discret. Math. Theor. Comput. Sci. 18(3) (2016) - 2015
- [j2]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) - 2013
- [j1]Daniel Krenn:
Analysis of the width-ww non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices. Theor. Comput. Sci. 491: 47-70 (2013)
Conference and Workshop Papers
- 2024
- [c6]Clemens Heuberger, Daniel Krenn, Tobias Lechner:
Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences. AofA 2024: 24:1-24:14 - 2019
- [c5]Clemens Heuberger, Daniel Krenn:
Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. ANALCO 2019: 27-35 - [c4]Elisabeth Gaar, Angelika Wiegele, Daniel Krenn, Susan Margulies:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. ISSAC 2019: 155-162 - 2018
- [c3]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
- [c2]Daniel Krenn:
An Extended Note on the Comparison-optimal Dual-Pivot Quickselect. ANALCO 2017: 115-123 - 2013
- [c1]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
Informal and Other Publications
- 2024
- [i9]Daniel Krenn, Jeffrey O. Shallit:
Strongly k-recursive sequences. CoRR abs/2401.14231 (2024) - 2022
- [i8]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
- [i7]Daniel Krenn, Jeffrey O. Shallit:
Decidability and k-Regular Sequences. CoRR abs/2005.09507 (2020) - 2019
- [i6]Elisabeth Gaar, Daniel Krenn, Susan Margulies, Angelika Wiegele:
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture. CoRR abs/1901.10288 (2019) - [i5]Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
Algorithmic counting of nonequivalent compact Huffman codes. CoRR abs/1901.11343 (2019) - 2016
- [i4]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) - [i3]Daniel Krenn:
An Extended Note on the Comparison-optimal Dual Pivot Quickselect. CoRR abs/1607.05008 (2016) - [i2]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) - 2014
- [i1]Clemens Heuberger, Daniel Krenn, Sara Kropf:
Automata and Transducers in the Computer Algebra System Sage. CoRR abs/1404.7458 (2014)
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:34 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:
