The following pages link to Aaron Williams (Q299050):
Displaying 50 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)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- The Grandmama de Bruijn Sequence for Binary Strings (Q2802952) (← links)
- Universal Cycles for Weight-Range Binary Strings (Q2870044) (← links)
- De Bruijn sequences for fixed-weight binary strings (Q2910938) (← links)
- An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (Q2930325) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
- Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order (Q3111650) (← links)
- Hamilton Cycles in Restricted Rotator Graphs (Q3111661) (← links)
- Hamilton Cycles in Restricted and Incomplete Rotator Graphs (Q3144121) (← links)
- (Q3439690) (← links)
- Packing Dicycle Covers in Planar Graphs with No K 5–e Minor (Q3525800) (← links)
- (Q3576763) (← links)
- Faster Generation of Shorthand Universal Cycles for Permutations (Q3578329) (← links)
- (Q4607918) (← links)
- (Q4633912) (← links)
- (Q4956509) (← links)
- Solving the Sigma-Tau Problem (Q4973059) (← links)
- Combinatorial generation via permutation languages (Q5146846) (← links)
- A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles (Q5211627) (← links)
- Super Mario Bros. Is Harder/Easier than We Thought (Q5282811) (← links)
- Computing and Combinatorics (Q5716977) (← links)
- Combinatorial generation via permutation languages. I. Fundamentals (Q5863047) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- A Hamilton Cycle in the $k$-Sided Pancake Network (Q6363018) (← links)
- Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order (Q6367136) (← links)
- Rolling polyhedra on tessellations (Q6540575) (← links)
- All your bases are belong to us: listing all bases of a matroid by greedy exchanges (Q6540592) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
- Cordial forests (Q6546601) (← links)
- Generating signed permutations by twisting two-sided ribbons (Q6547921) (← links)
- On the hardness of Gray code problems for combinatorial objects (Q6575387) (← links)
