Daniel Gabric

According to our database, Daniel Gabric authored at least 23 papers between 2017 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences.

Daniel Gabric, Wazed Imam, Lukas Janik Jones, Joe Sawada

CoRR, March, 2026

2025

Random generation of universal cycles and de Bruijn sequences.

Joe Sawada, Daniel Gabric

CoRR, October, 2025

Constructing k-ary orientable sequences with asymptotically optimal length.

Daniel Gabric, Joe Sawada

Des. Codes Cryptogr., July, 2025

Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random.

Joe Sawada, Daniel Gabric

RAIRO Theor. Informatics Appl., 2025

2024

Ranking and unranking bordered and unbordered words.

Daniel Gabric

Inf. Process. Lett., February, 2024

Asymptotic Bounds for the Number of Closed and Privileged Words.

Daniel Gabric

Electron. J. Comb., 2024

Efficient Construction of Long Orientable Sequences.

Daniel Gabric, Joe Sawada

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

Smallest and Largest Block Palindrome Factorizations.

Daniel Gabric, Jeffrey O. Shallit

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2022

Mutual Borders and Overlaps.

Daniel Gabric

IEEE Trans. Inf. Theory, 2022

Maximal state complexity and generalized de Bruijn words.

Daniel Gabric, Stepan Holub, Jeffrey O. Shallit

Inf. Comput., 2022

Investigating the discrepancy property of de Bruijn sequences.

Daniel Gabric, Joe Sawada

Discret. Math., 2022

Words that almost commute.

Daniel Gabric

Discret. Math., 2022

2021

The simplest binary word with only three squares.

Daniel Gabric, Jeffrey O. Shallit

RAIRO Theor. Informatics Appl., 2021

Borders, palindrome prefixes, and square prefixes.

Daniel Gabric, Jeffrey O. Shallit

Inf. Process. Lett., 2021

An Inequality for the Number of Periods in a Word.

Daniel Gabric, Narad Rampersad, Jeffrey O. Shallit

Int. J. Found. Comput. Sci., 2021

Avoidance of split overlaps.

Daniel Gabric, Jeffrey O. Shallit, Xiaofeng Zhong

Discret. Math., 2021

2020

A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles.

Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong

IEEE Trans. Inf. Theory, 2020

Avoidance of split overlaps.

Daniel Gabric, Jeffrey O. Shallit

CoRR, 2020

2019

Generalized de Bruijn Words and the State Complexity of Conjugate Sets.

Daniel Gabric, Stepan Holub, Jeffrey O. Shallit

Proceedings of the Descriptional Complexity of Formal Systems, 2019

Circularly Squarefree Words and Unbordered Conjugates: A New Approach.

Trevor Clokie, Daniel Gabric, Jeffrey O. Shallit

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018

Constructing de Bruijn sequences by concatenating smaller universal cycles.

Daniel Gabric, Joe Sawada

Theor. Comput. Sci., 2018

A framework for constructing de Bruijn sequences via simple successor rules.

Daniel Gabric, Joe Sawada, Aaron Williams, Dennis Wong

Discret. Math., 2018

2017

A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register.

Daniel Gabric, Joe Sawada

Proceedings of the Combinatorics on Words - 11th International Conference, 2017