Daniel Krenn

Computer Science · Physical Sciences

5h-index83citations50works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(15), Coding theory and cryptography(14), Cryptography and Residue Arithmetic(10), Computability, Logic, AI Algorithms(10), Algorithms and Data Compression(7)

Publications50 total

Probabilistic analysis of optimal multi-pivot QuickSort
arXiv (Cornell University)·2025Open Access
Strongly k-recursive sequences
arXiv (Cornell University)·2024Open Access
Strongly K-Recursive Sequences
SSRN Electronic Journal·2024Open Access
Analysis of Regular Sequences: Summatory Functions and Divide-And-Conquer Recurrences
arXiv (Cornell University)·2024Open Access
A note on the relation between recognisable series and regular sequences, and their minimal linear representations
Journal of Symbolic Computation·2023Open Access
Algorithmic counting of nonequivalent compact Huffman codes
Applicable Algebra in Engineering Communication and Computing·2023Open Access
A Note on the Relation between Recognisable Series and Regular Sequences, and Their Minimal Linear Representations
SSRN Electronic Journal·2023Open Access
A characterization of graphs with regular distance-2 graphs
Discrete Applied Mathematics·2022Open Access
Analysis of digital expansions to imaginary quadratic bases
TUGraz OPEN Library (Graz University of Technology)·2022Open Access
Digit expansions with applications in cryptography
TUGraz OPEN Library (Graz University of Technology)·2022Open Access
Asymptotic Analysis of q-Recursive Sequences
Algorithmica·2022· 6 citedOpen Access
A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
arXiv (Cornell University)·2022Open Access
Decidability and k-regular sequences
Theoretical Computer Science·2022· 1 citedOpen Access
Asymptotic Analysis of q-Recursive Sequences
arXiv (Cornell University)·2021Open Access
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares
Journal of Symbolic Computation·2021· 2 citedOpen Access
sagemath/sage: 9.1
2020· 8 citedOpen Access
Metamour-regular Polyamorous Relationships and Graphs
arXiv (Cornell University)·2020Open Access
Asymptotic Analysis of Regular Sequences
Algorithmica·2019Open Access
On the minimal Hamming weight of a multi-base representation
Journal of Number Theory·2019Open Access
An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
2019· 2 citedOpen Access
page 1 of 3Next →

Frequent Co-authors

Clemens Heuberger(23), Stephan Wagner(6), Gabriel F. Lipnik(5), Sara Kropf(4), Elisabeth Gaar(4), Helmut Prodinger(4), Volker Ziegler(3), Jeffrey Shallit(3), Benjamin Hackl(2), Jörg Μ. Thuswaldner(2), Angelika Wiegele(2), Martin Aumüller(2), Martin Dietzfelbinger(2), William Stein(1), Frédéric Chapoton(1), Jeroen Demeyer(1), Matthias Köppe(1), Julian Rüth(1), nathanncohen(1), Volker Braun(1)