Submitted preprints
Journal publications
- Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
- Constructing k-ary orientable sequences with asymptotically optimal length
- Asymptotic bounds for the number of closed and privileged words
- Ranking and unranking bordered and unbordered words
- Mutual borders and overlaps
- Words that almost commute
- Investigating the discrepancy property of de Bruijn sequences
- An inequality for the number of periods in a word
- The simplest binary word with only three squares
- Avoidance of split overlaps
- Maximal state complexity and generalized de Bruijn words
- Borders, palindrome prefixes, and square prefixes
- A successor rule framework for constructing k-ary de Bruijn sequences and universal cycles
- A framework for constructing de Bruijn sequences via simple successor rules
- Constructing de Bruijn sequences by concatenating smaller universal cycles
Conference publications
- Efficient Construction of Long Orientable Sequences
- Smallest and Largest Block Palindrome Factorizations
- Generalized de Bruijn words and the state complexity of conjugate sets
- Circularly squarefree words and unbordered conjugates: A new approach
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register