| Publication | Date of Publication | Type |
|---|
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
RAIRO. Theoretical Informatics and Applications | 2026-01-21 | Paper |
| Efficient construction of long orientable sequences | 2025-12-02 | Paper |
Constructing k-ary orientable sequences with asymptotically optimal length
Designs, Codes and Cryptography | 2025-08-11 | Paper |
Asymptotic bounds for the number of closed and privileged words
The Electronic Journal of Combinatorics | 2024-07-18 | Paper |
Ranking and unranking bordered and unbordered words
Information Processing Letters | 2024-03-26 | Paper |
Mutual Borders and Overlaps
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
An Inequality for the Number of Periods in a Word
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Smallest and Largest Block Palindrome Factorizations
Lecture Notes in Computer Science | 2023-07-25 | Paper |
| Asymptotic bounds for the number of closed and privileged words | 2022-06-28 | Paper |
Words that almost commute
Discrete Mathematics | 2022-05-17 | Paper |
Maximal state complexity and generalized de Bruijn words
Information and Computation | 2022-03-14 | Paper |
Investigating the discrepancy property of de Bruijn sequences
Discrete Mathematics | 2022-02-14 | Paper |
The simplest binary word with only three squares
RAIRO - Theoretical Informatics and Applications | 2022-01-12 | Paper |
Words that almost commute
(available as arXiv preprint) | 2021-10-03 | Paper |
Borders, palindrome prefixes, and square prefixes
Information Processing Letters | 2021-02-04 | Paper |
Avoidance of split overlaps
Discrete Mathematics | 2020-12-04 | Paper |
| Generalized de Bruijn words and the state complexity of conjugate sets | 2020-05-12 | Paper |
A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Circularly squarefree words and unbordered conjugates: a new approach
(available as arXiv preprint) | 2019-11-06 | Paper |
Maximal State Complexity and Generalized de Bruijn Words
(available as arXiv preprint) | 2019-03-13 | Paper |
A framework for constructing de Bruijn sequences via simple successor rules
Discrete Mathematics | 2018-09-21 | Paper |
Constructing de Bruijn sequences by concatenating smaller universal cycles
Theoretical Computer Science | 2018-08-23 | Paper |
| A de Bruijn sequence construction by concatenating cycles of the complemented cycling register | 2017-11-15 | Paper |
Efficient Construction of Long Orientable Sequences
(available as arXiv preprint) | N/A | Paper |
