A framework for constructing de Bruijn sequences via simple successor rules D Gabric, J Sawada, A Williams, D Wong Discrete Mathematics 341 (11), 2977-2987, 2018 | 37 | 2018 |
A Successor Rule Framework for Constructing -Ary de Bruijn Sequences and Universal Cycles D Gabric, J Sawada, A Williams, D Wong IEEE Transactions on Information Theory 66 (1), 679-687, 2019 | 32 | 2019 |
Constructing de Bruijn sequences by concatenating smaller universal cycles D Gabric, J Sawada Theoretical Computer Science 743, 12-22, 2018 | 16 | 2018 |
A de Bruijn sequence construction by concatenating cycles of the complemented cycling register D Gabric, J Sawada Combinatorics on Words: 11th International Conference, WORDS 2017, Montréal …, 2017 | 11 | 2017 |
Investigating the discrepancy property of de Bruijn sequences D Gabric, J Sawada Discrete Mathematics 345 (4), 112780, 2022 | 6 | 2022 |
Circularly squarefree words and unbordered conjugates: A new approach T Clokie, D Gabric, J Shallit Combinatorics on Words: 12th International Conference, WORDS 2019 …, 2019 | 6 | 2019 |
An inequality for the number of periods in a word D Gabric, N Rampersad, J Shallit International Journal of Foundations of Computer Science 32 (05), 597-614, 2021 | 5 | 2021 |
Maximal state complexity and generalized de Bruijn words D Gabric, Š Holub, J Shallit Information and Computation 284, 104689, 2022 | 3 | 2022 |
Generalized de Bruijn words and the state complexity of conjugate sets D Gabric, Š Holub, J Shallit Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International …, 2019 | 3 | 2019 |
Mutual borders and overlaps D Gabric IEEE Transactions on Information Theory 68 (10), 6888-6893, 2022 | 2 | 2022 |
The simplest binary word with only three squares D Gabric, J Shallit RAIRO-Theoretical Informatics and Applications 55, 3, 2021 | 2 | 2021 |
Borders, palindrome prefixes, and square prefixes D Gabric, J Shallit Information Processing Letters 165, 106027, 2021 | 2 | 2021 |
Words that almost commute D Gabric Discrete Mathematics 345 (7), 112898, 2022 | 1 | 2022 |
Asymptotic bounds for the number of closed and privileged words D Gabric arXiv preprint arXiv:2206.14273, 2022 | 1 | 2022 |
Avoidance of split overlaps D Gabric, J Shallit, XF Zhong Discrete Mathematics 344 (2), 112176, 2021 | 1 | 2021 |
Ranking and unranking bordered and unbordered words D Gabric Information Processing Letters 184, 106452, 2024 | | 2024 |
Efficient Construction of Long Orientable Sequences D Gabric, J Sawada arXiv preprint arXiv:2401.14341, 2024 | | 2024 |
Smallest and Largest Block Palindrome Factorizations D Gabric, J Shallit International Conference on Combinatorics on Words, 181-191, 2023 | | 2023 |
On the Properties and Structure of Bordered Words and Generalizations D Gabric University of Waterloo, 2022 | | 2022 |
Constructing de Bruijn sequences by concatenating cycles of feedback shift registers D Gabric University of Guelph, 2018 | | 2018 |