E-LIB Suche - Ergebnisse für: Gabric, Daniel

1

Ranking and unranking bordered and unbordered words:

Gabric, Daniel
Information Processing Letters. 184 (2024) - p. 106452 , 2024

Link: https://doi.org/10.1016/..

2

Smallest and Largest Block Palindrome Factorizations:

, In: Lecture Notes in Computer Science; Combinatorics on Words,

Gabric, Daniel ; Shallit, Jeffrey - p. 181-191 , 2023

Link: https://doi.org/10.1007/..

3

Maximal state complexity and generalized de Bruijn words:

Gabric, Daniel ; Holub, Štěpán ; Shallit, Jeffrey
Information and Computation. 284 (2022) - p. 104689 , 2022

Link: https://doi.org/10.1016/..

4

Words that almost commute:

Gabric, Daniel
Discrete Mathematics. 345 (2022) 7 - p. 112898 , 2022

Link: https://doi.org/10.1016/..

5

Investigating the discrepancy property of de Bruijn sequenc..:

Gabric, Daniel ; Sawada, Joe
Discrete Mathematics. 345 (2022) 4 - p. 112780 , 2022

Link: https://doi.org/10.1016/..

6

Mutual Borders and Overlaps:

Gabric, Daniel
IEEE Transactions on Information Theory. 68 (2022) 10 - p. 6888-6893 , 2022

Link: https://doi.org/10.1109/..

7

Borders, palindrome prefixes, and square prefixes:

Gabric, Daniel ; Shallit, Jeffrey
Information Processing Letters. 165 (2021) - p. 106027 , 2021

Link: https://doi.org/10.1016/..

8

Avoidance of split overlaps:

Gabric, Daniel ; Shallit, Jeffrey ; Zhong, Xiao Feng
Discrete Mathematics. 344 (2021) 2 - p. 112176 , 2021

Link: https://doi.org/10.1016/..

9

Circularly Squarefree Words and Unbordered Conjugates: A Ne..:

, In: Lecture Notes in Computer Science; Combinatorics on Words,

Clokie, Trevor ; Gabric, Daniel ; Shallit, Jeffrey - p. 133-144 , 2019

Link: https://doi.org/10.1007/..

10

Generalized de Bruijn Words and the State Complexity of Con..:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,

Gabric, Daniel ; Holub, Štěpán ; Shallit, Jeffrey - p. 137-146 , 2019

Link: https://doi.org/10.1007/..

11

A framework for constructing de Bruijn sequences via simple..:

Gabric, Daniel ; Sawada, Joe ; Williams, Aaron.
Discrete Mathematics. 341 (2018) 11 - p. 2977-2987 , 2018

Link: https://doi.org/10.1016/..

12

Constructing de Bruijn sequences by concatenating smaller u..:

Gabric, Daniel ; Sawada, Joe
Theoretical Computer Science. 743 (2018) - p. 12-22 , 2018

Link: https://doi.org/10.1016/..

13

Efficient Construction of Long Orientable Sequences:

Gabric, Daniel ; Sawada, Joe
http://arxiv.org/abs/2401.14341. , 2024

Link: http://arxiv.org/abs/240..

14

Ranking and unranking bordered and unbordered words:

Gabric, Daniel
http://arxiv.org/abs/2305.03000. , 2023

Link: http://arxiv.org/abs/230..

15

Smallest and Largest Block Palindrome Factorizations:

Gabric, Daniel ; Shallit, Jeffrey
http://arxiv.org/abs/2302.13147. , 2023

Link: http://arxiv.org/abs/230..