Daniel Gabric

most citedConstruction of orientable sequences in $O(1)$-amortized time per bit

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

collaborators

3 papers

cs.DS2026★ 1 cited

Construction of orientable sequences in $O (1)$ -amortized time per bit

Daniel GabriÄ, Joe Sawada

An orientable sequence of order $n$ is a cyclic binary sequence such that each length- $n$ substring appears at most once \emph{in either direction}. Maximal length orientable seque…

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…

cs.DM2026

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

Daniel Gabric, Wazed Imam, Lukas Janik Jones +1

A universal cycle for a set S of combinatorial objects is a cyclic sequence of length |S| that contains a representative of each element in S exactly once as a substring. Despite t…

Construction of orientable sequences in O(1)-amortized time per bit

Necklaces and Lyndon words in colexicographic order

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

Construction of orientable sequences in $O (1)$ -amortized time per bit