University of Guelph Logo

Daniel Gabrić

Daniel Gabric

Submitted preprints

  1. Constructing k-ary orientable sequences with asymptotically optimal length
    D. Gabrić and J. Sawada
    Submitted manuscript (2024)
  2. Construction of orientable sequences in O(1)-amortized time per bit
    D. Gabrić and J. Sawada
    Submitted manuscript (2024)

Journal publications

  1. Asymptotic bounds for the number of closed and privileged words
    D. Gabrić
    Electronic Journal of Combinatorics, Vol. 32 (2024) #P2.45
  2. Ranking and unranking bordered and unbordered words
    D. Gabrić
    Information Processing Letters, Vol. 184 (2024) 106452
  3. Mutual borders and overlaps
    D. Gabrić
    IEEE Transactions on Information Theory, Vol. 68 (2022) 6888-6893
  4. Words that almost commute
    D. Gabrić
    Discrete Mathematics, Vol. 345 No. 7 (2022) 112898
  5. Investigating the discrepancy property of de Bruijn sequences
    D. Gabrić and J. Sawada
    Discrete Mathematics, Vol. 345 No. 4 (2022) 112780
  6. An inequality for the number of periods in a word
    D. Gabrić, N. Rampersad, and J. Shallit
    International Journal of Foundations of Computer Science, Vol. 32 No. 05 (2021) 597-614
  7. The simplest binary word with only three squares
    D. Gabrić and J. Shallit
    RAIRO - Theoretical Informatics and Applications, Vol. 55 No. 3 (2021) 1-7
  8. Avoidance of split overlaps
    D. Gabrić, J. Shallit, and X. F. Zhong
    Discrete Mathematics, Vol. 344 No. 2 (2021) 112176
  9. Maximal state complexity and generalized de Bruijn words
    D. Gabrić, Š. Holub, and J. Shallit
    Information and Computation, (2021) 104689
  10. Borders, palindrome prefixes, and square prefixes
    D. Gabrić and J. Shallit
    Information Processing Letters, Vol. 165 (2021) 106027
  11. A successor rule framework for constructing k-ary de Bruijn sequences and universal cycles
    D. Gabrić, J. Sawada, A. Williams, and D. Wong
    IEEE Transactions on Information Theory, Vol. 66 (2019) 679-687
  12. A framework for constructing de Bruijn sequences via simple successor rules
    D. Gabrić, J. Sawada, A. Williams, and D. Wong
    Discrete Mathematics, Vol. 341 No. 11 (2018) 2977-2987
  13. Constructing de Bruijn sequences by concatenating smaller universal cycles
    D. Gabrić and J. Sawada
    Theoretical Computer Science, Vol. 743 (2018) 12-22

Conference publications

  1. Efficient Construction of Long Orientable Sequences
    D. Gabrić and J. Sawada
    35th Annual Symposium on Combinatorial Pattern Matching, LIPIcs, Vol. 296 (2024) 15:1-15:12
    Presented at CPM 2024
  2. Smallest and Largest Block Palindrome Factorizations
    D. Gabrić and J. Shallit
    14th International Conference on WORDS, LNCS 13899 (2023) 181-191
    Presented at WORDS 2023
  3. Generalized de Bruijn words and the state complexity of conjugate sets
    D. Gabrić, Š. Holub, and J. Shallit
    21st International Conference on Descriptional Complexity of Formal Systems, LNCS 11612 (2019) 137-146
    Presented at DCFS 2019
  4. Circularly squarefree words and unbordered conjugates: A new approach
    T. Clokie, D. Gabrić, and J. Shallit
    12th International Conference on WORDS, LNCS 11682 (2019) 133-144
    Presented at WORDS 2019
  5. A de Bruijn sequence construction by concatenating cycles of the complemented cycling register
    D. Gabrić and J. Sawada
    11th International Conference on WORDS, LNCS 10432 (2017) 49-58
    Presented at WORDS 2017