Aaron Williams

J. Discrete Algorithms, 2017

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

A simple shift rule for k-ary de Bruijn sequences.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Successor rules for flipping pancakes and burnt pancakes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A surprisingly simple de Bruijn sequence construction.

[BibT_eX]

[DOI]

Discret. Math., 2016

Greedy flipping of pancakes and burnt pancakes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

The Grandmama de Bruijn Sequence for Binary Strings.

[BibT_eX]

[DOI]

Patrick Baxter Dragon

Oscar I. Hernandez

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Super Mario Bros. is Harder/Easier Than We Thought.

[BibT_eX]

[DOI]

Erik D. Demaine

Giovanni Viglietta

Proceedings of the 8th International Conference on Fun with Algorithms, 2016

2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

Buttons & Scissors is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014

The Coolest Way to Generate Binary Strings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

The lexicographically smallest universal cycle for binary strings with minimum specified weight.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

2013

A Gray code for fixed-density necklaces and Lyndon words in constant amortized time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Greedy Pancake Flipping.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

A 'Hot Potato' Gray Code for Permutations.

[BibT_eX]

[DOI]

Xi Sisi Shen

Electron. Notes Discret. Math., 2013

The Greedy Gray Code Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Universal Cycles for Weight-Range Binary Strings.

[BibT_eX]

[DOI]

Dennis Chi-Him Wong

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

De Bruijn Sequences for Fixed-Weight Binary Strings.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

The Feline Josephus Problem.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Hamilton Cycles in Restricted and Incomplete Rotator Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Cool-lex order and k-ary Catalan structures.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Binary bubble languages and cool-lex order.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

Efficient Oracles for Generating Binary Bubble Languages.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Shorthand Universal Cycles for Permutations.

[BibT_eX]

[DOI]

Alexander E. Holroyd

Algorithmica, 2012

The Coolest Order of Binary Strings.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

De Bruijn Sequences for the Binary Strings with Maximum Density.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Hamilton Cycles in Restricted Rotator Graphs.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

2010

An explicit universal cycle for the (n-1)-permutations of an n-set.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Faster Generation of Shorthand Universal Cycles for Permutations.

[BibT_eX]

[DOI]

Alexander E. Holroyd

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

The coolest way to generate combinations.

[BibT_eX]

[DOI]

Discret. Math., 2009

Loopless generation of multiset permutations using a constant number of variables by prefix shifts.

[BibT_eX]

[DOI]

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Generating Balanced Parentheses and Binary Trees by Prefix Shifts.

[BibT_eX]

[DOI]

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007

An explicit universal cycle for the (n-1)-permutations of an n-set

[BibT_eX]

[DOI]

CoRR, 2007

2006

Packing Dicycle Covers in Planar Graphs with No K5-e Minor.

[BibT_eX]

[DOI]

Orlando Lee

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Generating Combinations by Prefix Shifts.

[BibT_eX]

[DOI]