J. Sawada

most citedConstructing

k

-ary Orientable Sequences with Asymptotically Optimal Length

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

collaborators

Showing cs.DMShow all

3 papers · 1 filter

cs.DM2026

Universal cycle constructions for k-subsets and k-multisets

Colin Campbell, Luke Janik-Jones, Joe Sawada

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

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…

cs.DM2024★ 1 cited

Constructing $k$ -ary Orientable Sequences with Asymptotically Optimal Length

Daniel Gabrić, Joe Sawada

An orientable sequence of order $n$ over an alphabet ${0, 1, \dots, k - 1}$ is a cyclic sequence such that each length- $n$ substring appears at most once \emph{in either direction…

Universal cycle constructions for k-subsets and k-multisets

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

Constructing k-ary Orientable Sequences with Asymptotically Optimal Length

Constructing $k$ -ary Orientable Sequences with Asymptotically Optimal Length