Daniel Krenn

Orcid: 0000-0001-8076-8535

According to our database1, Daniel Krenn authored at least 22 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A note on the relation between recognisable series and regular sequences, and their minimal linear representations.
J. Symb. Comput., July, 2024

Strongly k-recursive sequences.
CoRR, 2024

2023
A characterization of graphs with regular distance-2 graphs.
Discret. Appl. Math., 2023

2022
Decidability and <i>k</i>-regular sequences.
Theor. Comput. Sci., 2022

Asymptotic Analysis of q-Recursive Sequences.
Algorithmica, 2022

2021
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares.
J. Symb. Comput., 2021

2020
Decidability and k-Regular Sequences.
CoRR, 2020

Asymptotic Analysis of Regular Sequences.
Algorithmica, 2020

2019
Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths.
Comb. Probab. Comput., 2019

Algorithmic counting of nonequivalent compact Huffman codes.
CoRR, 2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture.
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
An Extended Note on the Comparison-optimal Dual-Pivot Quickselect.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016
Automata in SageMath - Combinatorics meet Theoretical Computer Science.
Discret. Math. Theor. Comput. Sci., 2016

Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort.
CoRR, 2016

Compositions into Powers of b: Asymptotic Enumeration and Parameters.
Algorithmica, 2016

2015
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis.
SIAM J. Discret. Math., 2015

2014
Automata and Transducers in the Computer Algebra System Sage.
CoRR, 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


  Loading...