1. Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences;ACM Transactions on Algorithms;2024-07-26
2. On prefer-one sequences;Designs, Codes and Cryptography;2024-06-10
3. Constructions of full cycles;Sequences and the de Bruijn Graph;2024
4. A relation between sequences generated by Golomb’s preference algorithm;Designs, Codes and Cryptography;2022-09-07
5. Entropy Lost: Nintendo’s Not-So-Random Sequence of 32, 767 Bits;FDG '22: Proceedings of the 17th International Conference on the Foundations of Digital Games;2022-09-05