| A framework for constructing de Bruijn sequences via simple successor rules D Gabrić, J Sawada, A Williams, D Wong Discrete Mathematics 341 (11), 2977-2987, 2018 | 40 | 2018 |
| A successor rule framework for constructing -ary de Bruijn sequences and universal cycles D Gabrić, 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 Gabrić, 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 Gabrić, J Sawada Combinatorics on Words: 11th International Conference, WORDS 2017, Montréal …, 2017 | 11 | 2017 |
| Investigating the discrepancy property of de Bruijn sequences D Gabrić, J Sawada Discrete Mathematics 345 (4), 112780, 2022 | 8 | 2022 |
| Circularly squarefree words and unbordered conjugates: A new approach T Clokie, D Gabrić, J Shallit Combinatorics on Words: 12th International Conference, WORDS 2019 …, 2019 | 6 | 2019 |
| An inequality for the number of periods in a word D Gabrić, N Rampersad, J Shallit International Journal of Foundations of Computer Science 32 (05), 597-614, 2021 | 5 | 2021 |
| Generalized de Bruijn words and the state complexity of conjugate sets D Gabrić, Š Holub, J Shallit Descriptional Complexity of Formal Systems: 21st IFIP WG 1.02 International …, 2019 | 4 | 2019 |
| Mutual borders and overlaps D Gabrić IEEE Transactions on Information Theory 68 (10), 6888-6893, 2022 | 3 | 2022 |
| Maximal state complexity and generalized de Bruijn words D Gabrić, Š Holub, J Shallit Information and Computation 284, 104689, 2022 | 3 | 2022 |
| Efficient Construction of Long Orientable Sequences D Gabrić, J Sawada 35th Annual Symposium on Combinatorial Pattern Matching, CPM 2024, Fukuoka …, 2024 | 2 | 2024 |
| The simplest binary word with only three squares D Gabrić, J Shallit RAIRO-Theoretical Informatics and Applications 55, 3, 2021 | 2 | 2021 |
| Borders, palindrome prefixes, and square prefixes D Gabrić, J Shallit Information Processing Letters 165, 106027, 2021 | 2 | 2021 |
| Asymptotic bounds for the number of closed and privileged words D Gabrić The Electronic Journal of Combinatorics 31 (2), P2.45, 2024 | 1 | 2024 |
| Ranking and unranking bordered and unbordered words D Gabrić Information Processing Letters 184, 106452, 2024 | 1 | 2024 |
| Words that almost commute D Gabrić Discrete Mathematics 345 (7), 112898, 2022 | 1 | 2022 |
| Avoidance of split overlaps D Gabrić, J Shallit, XF Zhong Discrete Mathematics 344 (2), 112176, 2021 | 1 | 2021 |
| Constructing -ary Orientable Sequences with Asymptotically Optimal Length D Gabrić, J Sawada arXiv preprint arXiv:2407.07029, 2024 | | 2024 |
| Construction of orientable sequences in O(1)-amortized time per bit D Gabrić, J Sawada arXiv preprint arXiv:2401.14341v3, 2024 | | 2024 |
| Smallest and Largest Block Palindrome Factorizations D Gabrić, J Shallit International Conference on Combinatorics on Words, 181-191, 2023 | | 2023 |
Joe SawadaProfessor, Computer Science, University of GuelphVerified email at uoguelph.ca
