The following pages link to Daniel Krenn (Q308943):
Displayed 31 items.
- Compositions into powers of \(b\): asymptotic enumeration and parameters (Q308944) (← links)
- On linear combinations of units with bounded coefficients and double-base digit expansions (Q368536) (← links)
- Analysis of the width-\(w\) non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices (Q387802) (← links)
- Asymptotic behavior of some statistics in Ewens random permutations (Q388962) (← links)
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases (Q394267) (← links)
- Sylow \(p\)-groups of polynomial permutations on the integers mod \(p^n\). (Q740937) (← links)
- Analysis of width-\(w\) non-adjacent forms to imaginary quadratic bases (Q1937312) (← links)
- On the minimal Hamming weight of a multi-base representation (Q2009155) (← links)
- Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005) (← links)
- Decidability and \(k\)-regular sequences (Q2077376) (← links)
- A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
- Asymptotic analysis of \(q\)-recursive sequences (Q2165029) (← links)
- Asymptotic analysis of regular sequences (Q2292859) (← links)
- Existence and optimality of \(w\)-non-adjacent forms with an algebraic integer base (Q2434175) (← links)
- (Q2789561) (← links)
- (Q2789562) (← links)
- Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis (Q2944462) (← links)
- Automata in SageMath---Combinatorics meet Theoretical Computer Science (Q2965981) (← links)
- Non-minimality of the width-$w$ non-adjacent form in conjunction with trace one $\tau $-adic digit expansions and Koblitz curves in characteristic two (Q4600710) (← links)
- Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort (Q4632472) (← links)
- Analysis of Summatory Functions of Regular Sequences: Transducer and Pascal's Rhombus (Q4993549) (← links)
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)
- Analysis of Parameters of Trees Corresponding to Huffman Codes and Sums of Unit Fractions (Q5194736) (← links)
- An Extended Note on the Comparison-optimal Dual-Pivot Quickselect (Q5195042) (← links)
- Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences (Q5195227) (← links)
- Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths (Q5219324) (← links)
- Multi-base representations of integers: Asymptotic enumeration and central limit theorems (Q5278793) (← links)
- A note on the relation between recognisable series and regular sequences, and their minimal linear representations (Q6149153) (← links)
- The continuum P\'olya-like random walk (Q6276204) (← links)
- Algorithmic counting of nonequivalent compact Huffman codes (Q6313357) (← links)
- Decidability and k-Regular Sequences (Q6341033) (← links)