Daniel Gabric

most citedConstruction of orientable sequences in

O (1)

-amortized time per bit

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Necklaces and Lyndon words in colexicographic order

Daniel Gabric, Joe Sawada

We present the first constant-amortized-time algorithms for generating all length- $n$ necklaces and Lyndon words over a $k$ -letter alphabet in colexicographic order, for arbitrary…

math.CO2024

Asymptotic bounds for the number of closed and privileged words

Daniel Gabric

A word~ $w$ has a border $u$ if $u$ is a non-empty proper prefix and suffix of $u$ . A word~ $w$ is said to be \emph{closed} if $w$ is of length at most $1$ or if $w$ has a border tha…