default search action
Daniel Gabric
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Daniel Gabric:
Asymptotic Bounds for the Number of Closed and Privileged Words. Electron. J. Comb. 31(2) (2024) - [j12]Daniel Gabric
:
Ranking and unranking bordered and unbordered words. Inf. Process. Lett. 184: 106452 (2024) - [c5]Daniel Gabric, Joe Sawada:
Efficient Construction of Long Orientable Sequences. CPM 2024: 15:1-15:12 - [i14]Daniel Gabric
Efficient Construction of Long Orientable Sequences. CoRR abs/2401.14341 (2024) - [i13]Daniel Gabric, Joe Sawada:
Constructing k-ary Orientable Sequences with Asymptotically Optimal Length. CoRR abs/2407.07029 (2024) - 2023
- [c4]Daniel Gabric
Smallest and Largest Block Palindrome Factorizations. WORDS 2023: 181-191 - [i12]Daniel Gabric, Jeffrey O. Shallit:
Smallest and Largest Block Palindrome Factorizations. CoRR abs/2302.13147 (2023) - [i11]Daniel Gabric:
Ranking and unranking bordered and unbordered words. CoRR abs/2305.03000 (2023) - 2022
- [j11]Daniel Gabric
Investigating the discrepancy property of de Bruijn sequences. Discret. Math. 345(4): 112780 (2022) - [j10]Daniel Gabric
Words that almost commute. Discret. Math. 345(7): 112898 (2022) - [j9]Daniel Gabric
Maximal state complexity and generalized de Bruijn words. Inf. Comput. 284: 104689 (2022) - [j8]Daniel Gabric
Mutual Borders and Overlaps. IEEE Trans. Inf. Theory 68(10): 6888-6893 (2022) - [i10]Daniel Gabric:
Asymptotic bounds for the number of closed and privileged words. CoRR abs/2206.14273 (2022) - 2021
- [j7]Daniel Gabric
Avoidance of split overlaps. Discret. Math. 344(2): 112176 (2021) - [j6]Daniel Gabric
An Inequality for the Number of Periods in a Word. Int. J. Found. Comput. Sci. 32(5): 597-614 (2021) - [j5]Daniel Gabric, Jeffrey O. Shallit
Borders, palindrome prefixes, and square prefixes. Inf. Process. Lett. 165: 106027 (2021) - [j4]Daniel Gabric
The simplest binary word with only three squares. RAIRO Theor. Informatics Appl. 55: 1-7 (2021) - [i9]Daniel Gabric:
Words that almost commute. CoRR abs/2110.01120 (2021) - 2020
- [j3]Daniel Gabric
A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. IEEE Trans. Inf. Theory 66(1): 679-687 (2020) - [i8]Daniel Gabric
Avoidance of split overlaps. CoRR abs/2002.01968 (2020) - [i7]Daniel Gabric
Investigating the discrepancy property of de Bruijn sequences. CoRR abs/2005.01638 (2020) - [i6]Daniel Gabric
An inequality for the number of periods in a word. CoRR abs/2005.11718 (2020) - [i5]Daniel Gabric
The Simplest Binary Word with Only Three Squares. CoRR abs/2007.08188 (2020) - [i4]Daniel Gabric:
Mutual Borders and Overlaps. CoRR abs/2010.14663 (2020)
2010 – 2019
- 2019
- [c3]Trevor Clokie, Daniel Gabric
Circularly Squarefree Words and Unbordered Conjugates: A New Approach. WORDS 2019: 133-144 - [c2]Daniel Gabric
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. DCFS 2019: 137-146 - [i3]Daniel Gabric
Generalized de Bruijn words and the state complexity of conjugate sets. CoRR abs/1903.05442 (2019) - [i2]Trevor Clokie, Daniel Gabric, Jeffrey O. Shallit:
Circularly squarefree words and unbordered conjugates: a new approach. CoRR abs/1904.08187 (2019) - [i1]Daniel Gabric
Borders, Palindrome Prefixes, and Square Prefixes. CoRR abs/1906.03689 (2019) - 2018
- [j2]Daniel Gabric
A framework for constructing de Bruijn sequences via simple successor rules. Discret. Math. 341(11): 2977-2987 (2018) - [j1]Daniel Gabric
Constructing de Bruijn sequences by concatenating smaller universal cycles. Theor. Comput. Sci. 743: 12-22 (2018) - 2017
- [c1]Daniel Gabric
A de Bruijn Sequence Construction by Concatenating Cycles of the Complemented Cycling Register. WORDS 2017: 49-58
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: