The coolest way to generate combinations F Ruskey, A Williams
Discrete Mathematics 309 (17), 5305-5320, 2009
68 2009 A surprisingly simple de Bruijn sequence construction J Sawada, A Williams, D Wong
Discrete Mathematics 339 (1), 127-131, 2016
63 2016 Loopless generation of multiset permutations using a constant number of variables by prefix shifts A Williams
Proceedings of the twentieth annual ACM-SIAM symposium on discrete …, 2009
56 * 2009 De Bruijn sequences for fixed-weight binary strings F Ruskey, J Sawada, A Williams
SIAM Journal on Discrete Mathematics 26 (2), 605-617, 2012
49 * 2012 The greedy Gray code algorithm A Williams
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013
48 2013 Binary bubble languages and cool-lex order F Ruskey, J Sawada, A Williams
Journal of Combinatorial Theory, Series A 119 (1), 155-169, 2012
47 2012 An explicit universal cycle for the (n -1)-permutations of an n -set F Ruskey, A Williams
ACM Transactions on Algorithms (TALG) 6 (3), 1-12, 2010
46 2010 Shorthand universal cycles for permutations AE Holroyd, F Ruskey, A Williams
Algorithmica 64, 215-245, 2012
36 2012 A framework for constructing de Bruijn sequences via simple successor rules D Gabric, J Sawada, A Williams, D Wong
Discrete Mathematics 341 (11), 2977-2987, 2018
34 2018 A Gray code for fixed-density necklaces and Lyndon words in constant amortized time J Sawada, A Williams
Theoretical Computer Science 502, 46-54, 2013
33 2013 Generating Balanced Parentheses and Binary Trees by Prefix Shifts. F Ruskey, A Williams
CATS 8, 140, 2008
32 2008 A Successor Rule Framework for Constructing D Gabric, J Sawada, A Williams, D Wong
IEEE Transactions on Information Theory 66 (1), 679-687, 2019
30 2019 Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence PB Dragon, OI Hernandez, J Sawada, A Williams, D Wong
European Journal of Combinatorics 72, 1-11, 2018
28 2018 A simple shift rule for k-ary de Bruijn sequences J Sawada, A Williams, D Wong
Discrete Mathematics 340 (3), 524-531, 2017
25 2017 The coolest way to generate binary strings B Stevens, A Williams
Theory of Computing Systems 54, 551-577, 2014
25 2014 Combinatorial generation via permutation languages E Hartung, HP Hoang, T Mütze, A Williams
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
24 2020 Super Mario Bros. is harder/easier than we thought ED Demaine, G Viglietta, A Williams
23 2016 Shift gray codes AM Williams
22 2009 Generating combinations by prefix shifts F Ruskey, A Williams
Computing and Combinatorics: 11th Annual International Conference, COCOON …, 2005
22 2005 Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles J Sawada, A Williams, D Wong
The electronic journal of combinatorics, P1. 24-P1. 24, 2016
21 2016 
Joe SawadaProfessor, Computer Science, University of GuelphBestätigte E-Mail-Adresse bei uoguelph.ca
