3 citations · 4 across the 12 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2019★ 3 cited
Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
Dor Genosar, Yotam Svoray, Gera Weiss
We study a fixed-window counting system in which integers are represented by words of constant length while the alphabet grows as needed. This viewpoint arises from De Bruijn seque…
cs.DM2018★ 1 cited
De Bruijn Sequences: From Games to Shift-Rules to a Proof of the Fredricksen-Kessler-Maiorana Theorem
Gal Amram, Amir Rubin, Yotam Svoray +1
We present a combinatorial game and propose efficiently computable optimal strategies. We then show how these strategies can be translated to efficiently computable shift-rules for…
cs.DM2017
An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence
Gal Amram, Yair Ashlagi, Amir Rubin +3
A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, wh…