19 citations · 73 across the 21 of their papers we have counts for
4 papers · 1 filter
Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences
Evan Sala, Joe Sawada, Abbas Alhakim
The greedy Prefer-same de Bruijn sequence construction was first presented by Eldert et al.[AIEE Transactions 77 (1958)]. As a greedy algorithm, it has one major downside: it requi…
Dichotomizing -vertex-critical -free graphs for of order four
Ben Cameron, Chính T. Hoàng, Joe Sawada
For , we prove (i) there is a finite number of -vertex-critical -free graphs and (ii) -vertex-critical -free graphs have at most v…
Investigating the discrepancy property of de Bruijn sequences
Daniel Gabric, Joe Sawada
The discrepancy of a binary string refers to the maximum (absolute) difference between the number of ones and the number of zeroes over all possible substrings of the given binary…
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
A prefix normal word is a binary word with the property that no substring has more s than the prefix of the same length. By proving that the set of prefix normal words is a bubb…