| The coolest way to generate combinations F Ruskey, A Williams Discrete Mathematics 309 (17), 5305-5320, 2009 | 73 | 2009 |
| A surprisingly simple de Bruijn sequence construction J Sawada, A Williams, D Wong Discrete Mathematics 339 (1), 127-131, 2016 | 68 | 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 | 59 | 2009 |
| The greedy Gray code algorithm A Williams Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013 | 54 | 2013 |
| De Bruijn sequences for fixed-weight binary strings F Ruskey, J Sawada, A Williams SIAM Journal on Discrete Mathematics 26 (2), 605-617, 2012 | 50* | 2012 |
| Binary bubble languages and cool-lex order F Ruskey, J Sawada, A Williams Journal of Combinatorial Theory, Series A 119 (1), 155-169, 2012 | 48 | 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 | 48 | 2010 |
| Shorthand universal cycles for permutations AE Holroyd, F Ruskey, A Williams Algorithmica 64, 215-245, 2012 | 42 | 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 | 40 | 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 |
| A Successor Rule Framework for Constructing -Ary de Bruijn Sequences and Universal Cycles D Gabric, J Sawada, A Williams, D Wong IEEE Transactions on Information Theory 66 (1), 679-687, 2019 | 32 | 2019 |
| Generating Balanced Parentheses and Binary Trees by Prefix Shifts. F Ruskey, A Williams CATS 8, 140, 2008 | 32 | 2008 |
| 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 | 30 | 2018 |
| Super Mario Bros. is harder/easier than we thought ED Demaine, G Viglietta, A Williams | 28 | 2016 |
| Combinatorial generation via permutation languages. I. Fundamentals E Hartung, H Hoang, T Mütze, A Williams Transactions of the American Mathematical Society 375 (04), 2255-2291, 2022 | 26 | 2022 |
| A simple shift rule for k-ary de Bruijn sequences J Sawada, A Williams, D Wong Discrete Mathematics 340 (3), 524-531, 2017 | 26 | 2017 |
| 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 | 25 | 2020 |
| The coolest way to generate binary strings B Stevens, A Williams Theory of Computing Systems 54, 551-577, 2014 | 25 | 2014 |
| 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 | 22 | 2016 |
| Universal cycles for weight-range binary strings J Sawada, A Williams, D Wong Combinatorial Algorithms: 24th International Workshop, IWOCA 2013, Rouen …, 2013 | 21 | 2013 |
Joe SawadaProfessor, Computer Science, University of Guelph在 uoguelph.ca 的电子邮件经过验证
