The following pages link to Aaron Williams (Q299050):
Displaying 19 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- The feline Josephus problem (Q692937) (← links)
- A simple shift rule for \(k\)-ary de Bruijn sequences (Q729788) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
- Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
- Shorthand universal cycles for permutations (Q1759661) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
- A shift Gray code for fixed-content Łukasiewicz words (Q2169973) (← links)
- Super Mario Bros. Is Harder/Easier than We Thought (Q5282811) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
