Daniel Krenn
Orcid: 0000-0001-8076-8535
According to our database1,
Daniel Krenn
authored at least 23 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
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
Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences.
Proceedings of the 35th International Conference on Probabilistic, 2024
2023
Discret. Appl. Math., 2023
2022
2021
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares.
J. Symb. Comput., 2021
2020
2019
Comb. Probab. Comput., 2019
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 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
2018
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., 2018
Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus.
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017
2016
Discret. Math. Theor. Comput. Sci., 2016
Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort.
CoRR, 2016
Algorithmica, 2016
2015
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis.
SIAM J. Discret. Math., 2015
2014
2013
Analysis of the width-<i>w</i>w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices.
Theor. Comput. Sci., 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