default search action
Aaron Williams 0001
Person information
- affiliation: Williams College, Department of Computer Science, Williamstown, MA, USA
- affiliation: Bard College at Simon's Rock, Science, Mathematics, and Computing Faculty, Great Barrington, MA, USA
- affiliation (PhD 2008): University of Victoria, Victoria, BC, Canada
Other persons with the same name
- Aaron Williams — disambiguation page
- Aaron Williams 0002 — North Carolina State University, Principles of Expressive Machines (POEM) Lab, Raleigh, NC, USA
- Aaron Williams 0003 — The Washington Post, Washington, DC, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c37]Yuan Qiu, Aaron Williams
:
Generating Signed Permutations by Twisting Two-Sided Ribbons. LATIN (1) 2024: 114-129 - [c36]Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. WALCOM 2024: 103-117 - [i9]Arturo Merino, Namrata, Aaron Williams:
On the Hardness of Gray Code Problems for Combinatorial Objects. CoRR abs/2401.14963 (2024) - 2023
- [j29]Ben Cameron, Joe Sawada, Wei Therese, Aaron Williams
Hamiltonicity of k-Sided Pancake Networks with Fixed-Spin: Efficient Generation, Ranking, and Optimality. Algorithmica 85(3): 717-744 (2023) - [j28]Joe Sawada
Constructing the first (and coolest) fixed-content universal cycle. Algorithmica 85(6): 1754-1785 (2023) - [c35]Emily Downing, Stephanie Einstein, Elizabeth Hartung, Aaron Williams:
Catalan Squares and Staircases: Relayering and Repositioning Gray Codes. CCCG 2023: 273-281 - [c34]Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams:
Cordial Forests. FCT 2023: 291-303 - [c33]Zsuzsanna Lipták
Constant Time and Space Updates for the Sigma-Tau Problem. SPIRE 2023: 323-330 - [i8]Joe Sawada, Jackson Sears, Andrew Trautrim, Aaron Williams:
Demystifying our Grandparent's De Bruijn Sequences with Concatenation Trees. CoRR abs/2308.12405 (2023) - [i7]Yuan Qiu, Aaron Williams:
Generating Signed Permutations by Twisting Two-Sided Ribbons. CoRR abs/2311.06974 (2023) - [i6]Emily Downing, Elizabeth Hartung, Aaron Williams:
Pattern Avoidance for Fibonacci Sequences using k-Regular Words. CoRR abs/2312.16052 (2023) - 2022
- [j27]Joe Sawada, Aaron Williams, Dennis Wong:
Flip-swap languages in binary reflected Gray code order. Theor. Comput. Sci. 933: 138-148 (2022) - [c32]Kirby Gordon, Jacob Lezberg, Aaron Williams:
Unstacking Slabs Safely in Megalit is NP-Hard. CCCG 2022: 169-176 - [c31]Trang Ngo, Aaron Williams
Entropy Lost: Nintendo's Not-So-Random Sequence of 32, 767 Bits. FDG 2022: 65:1-65:10 - [c30]Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Rolling Polyhedra on Tessellations. FUN 2022: 6:1-6:16 - [c29]Arturo Merino, Torsten Mütze, Aaron Williams:
All Your bases Are Belong to Us: Listing All Bases of a Matroid by Greedy Exchanges. FUN 2022: 22:1-22:28 - [c28]Paul W. Lapey, Aaron Williams:
Pop & Push: Ordered Tree Iteration in 𝒪(1)-Time. ISAAC 2022: 53:1-53:16 - [c27]Paul W. Lapey, Aaron Williams
A Shift Gray Code for Fixed-Content Łukasiewicz Words. IWOCA 2022: 383-397 - 2021
- [c26]Austin Barr, Calvin Chung, Aaron Williams:
Block Dude Puzzles are NP-Hard (and the Rugs Really Tie the Reductions Together). CCCG 2021: 114-125 - [c25]Aster Greenblatt, Oscar I. Hernandez, Robert A. Hearn, Yichao Hou, Hiro Ito, Minwoo Kang, Aaron Williams, Andrew Winslow:
Turning Around and Around: Motion Planning through Thick and Thin Turnstiles. CCCG 2021: 377-387 - [c24]Joe Sawada, Aaron Williams, Dennis Wong:
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. WORDS 2021: 172-184 - [c23]Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. IWOCA 2021: 137-151 - [c22]Joe Sawada, Aaron Williams:
A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). WADS 2021: 599-612 - [i5]Ben Cameron, Joe Sawada, Aaron Williams:
A Hamilton Cycle in the k-Sided Pancake Network. CoRR abs/2103.09256 (2021) - [i4]Joe Sawada, Aaron Williams, Dennis Wong:
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order. CoRR abs/2105.03556 (2021) - 2020
- [j26]Joe Sawada
Solving the Sigma-Tau Problem. ACM Trans. Algorithms 16(1): 11:1-11:17 (2020) - [j25]Daniel Gabric
A Successor Rule Framework for Constructing k-Ary de Bruijn Sequences and Universal Cycles. IEEE Trans. Inf. Theory 66(1): 679-687 (2020) - [c21]Elizabeth Hartung
Combinatorial generation via permutation languages. SODA 2020: 1214-1225
2010 – 2019
- 2019
- [i3]Elizabeth Hartung, Hung Phuc Hoang, Torsten Mütze, Aaron Williams:
Combinatorial generation via permutation languages. I. Fundamentals. CoRR abs/1906.06069 (2019) - 2018
- [j24]Daniel Gabric
A framework for constructing de Bruijn sequences via simple successor rules. Discret. Math. 341(11): 2977-2987 (2018) - [j23]Patrick Baxter Dragon, Oscar I. Hernandez, Joe Sawada, Aaron Williams, Dennis Wong:
Constructing de Bruijn sequences with co-lexicographic order: The k-ary Grandmama sequence. Eur. J. Comb. 72: 1-11 (2018) - [c20]Addison Allen, Aaron Williams:
Sto-Stone is NP-Complete. CCCG 2018: 28-34 - [c19]Daniel Packer, Sophia White, Aaron Williams:
A Paper on Pencils: A Pencil and Paper Puzzle - Pencils is NP-Complete. CCCG 2018: 35-41 - [c18]Jonathan Gabor, Aaron Williams:
Switches are PSPACE-Complete. CCCG 2018: 42-48 - [c17]Joe Sawada, Aaron Williams:
A Hamilton Path for the Sigma-Tau Problem. SODA 2018: 568-575 - 2017
- [j22]Joe Sawada, Aaron Williams, Dennis Wong
A simple shift rule for k-ary de Bruijn sequences. Discret. Math. 340(3): 524-531 (2017) - [j21]Joe Sawada, Aaron Williams:
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. J. Discrete Algorithms 43: 95-110 (2017) - [j20]Joe Sawada, Aaron Williams, Dennis Wong:
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. J. Discrete Algorithms 46-47: 25-35 (2017) - 2016
- [j19]Joe Sawada, Aaron Williams, Dennis Wong:
Generalizing the Classic Greedy and Necklace Constructions of de Bruijn Sequences and Universal Cycles. Electron. J. Comb. 23(1): 1 (2016) - [j18]Joe Sawada, Aaron Williams:
Greedy flipping of pancakes and burnt pancakes. Discret. Appl. Math. 210: 61-74 (2016) - [j17]Joe Sawada, Aaron Williams, Dennis Wong
A surprisingly simple de Bruijn sequence construction. Discret. Math. 339(1): 127-131 (2016) - [j16]Joe Sawada, Aaron Williams
Successor rules for flipping pancakes and burnt pancakes. Theor. Comput. Sci. 609: 60-75 (2016) - [c16]Erik D. Demaine, Giovanni Viglietta, Aaron Williams:
Super Mario Bros. is Harder/Easier Than We Thought. FUN 2016: 13:1-13:14 - [c15]Patrick Baxter Dragon, Oscar I. Hernandez, Aaron Williams:
The Grandmama de Bruijn Sequence for Binary Strings. LATIN 2016: 347-361 - [i2]Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Single-Player and Two-Player Buttons & Scissors Games. CoRR abs/1607.01826 (2016) - 2015
- [c14]Harrison Gregg, Jody Leonard, Aaron Santiago, Aaron Williams:
Buttons & Scissors is NP-Complete. CCCG 2015 - [c13]Kyle Burke
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - 2014
- [j15]Joe Sawada, Aaron Williams, Dennis Wong:
The lexicographically smallest universal cycle for binary strings with minimum specified weight. J. Discrete Algorithms 28: 31-40 (2014) - [j14]Brett Stevens, Aaron Williams:
The Coolest Way to Generate Binary Strings. Theory Comput. Syst. 54(4): 551-577 (2014) - 2013
- [j13]Xi Sisi Shen, Aaron Williams:
A 'Hot Potato' Gray Code for Permutations. Electron. Notes Discret. Math. 44: 89-94 (2013) - [j12]Aaron Williams, Joe Sawada:
Greedy Pancake Flipping. Electron. Notes Discret. Math. 44: 357-362 (2013) - [j11]Joe Sawada, Aaron Williams:
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theor. Comput. Sci. 502: 46-54 (2013) - [c12]Joe Sawada, Aaron Williams, Dennis Chi-Him Wong:
Universal Cycles for Weight-Range Binary Strings. IWOCA 2013: 388-401 - 2012
- [j10]Alexander E. Holroyd, Frank Ruskey
Shorthand Universal Cycles for Permutations. Algorithmica 64(2): 215-245 (2012) - [j9]Joe Sawada, Aaron Williams:
Efficient Oracles for Generating Binary Bubble Languages. Electron. J. Comb. 19(1): 42 (2012) - [j8]Frank Ruskey
Binary bubble languages and cool-lex order. J. Comb. Theory A 119(1): 155-169 (2012) - [j7]Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Frank Ruskey
Cool-lex order and k-ary Catalan structures. J. Discrete Algorithms 16: 287-307 (2012) - [j6]Brett Stevens, Aaron Williams:
Hamilton Cycles in Restricted and Incomplete Rotator Graphs. J. Graph Algorithms Appl. 16(4): 785-810 (2012) - [j5]Frank Ruskey
The Feline Josephus Problem. Theory Comput. Syst. 50(1): 20-34 (2012) - [j4]Frank Ruskey
De Bruijn Sequences for Fixed-Weight Binary Strings. SIAM J. Discret. Math. 26(2): 605-617 (2012) - [c11]Brett Stevens, Aaron Williams:
The Coolest Order of Binary Strings. FUN 2012: 322-333 - 2011
- [c10]Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams:
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. IWOCA 2011: 182-194 - [c9]Brett Stevens, Aaron Williams:
Hamilton Cycles in Restricted Rotator Graphs. IWOCA 2011: 324-336 - [c8]Joe Sawada, Brett Stevens, Aaron Williams:
De Bruijn Sequences for the Binary Strings with Maximum Density. WALCOM 2011: 182-190 - 2010
- [j3]Frank Ruskey
An explicit universal cycle for the (n-1)-permutations of an n-set. ACM Trans. Algorithms 6(3): 45:1-45:12 (2010) - [c7]Alexander E. Holroyd, Frank Ruskey
Faster Generation of Shorthand Universal Cycles for Permutations. COCOON 2010: 298-307 - [c6]Frank Ruskey
The Feline Josephus Problem. FUN 2010: 343-354 - [c5]Aaron Williams:
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List. FUN 2010: 368-379
2000 – 2009
- 2009
- [b1]Aaron Michael Williams:
Shift gray codes. University of Victoria, Canada, 2009 - [j2]Frank Ruskey
The coolest way to generate combinations. Discret. Math. 309(17): 5305-5320 (2009) - [c4]Aaron Williams:
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. SODA 2009: 987-996 - 2008
- [c3]Frank Ruskey, Aaron Williams:
Generating Balanced Parentheses and Binary Trees by Prefix Shifts. CATS 2008: 107-115 - 2007
- [i1]Frank Ruskey, Aaron Williams:
An explicit universal cycle for the (n-1)-permutations of an n-set. CoRR abs/0710.1842 (2007) - 2006
- [c2]Orlando Lee, Aaron Williams:
Packing Dicycle Covers in Planar Graphs with No K5-e Minor. LATIN 2006: 677-688 - 2005
- [j1]Aaron Michael Williams, Bertrand Guenin:
Advances in packing directed joins. Electron. Notes Discret. Math. 19: 249-255 (2005) - [c1]Frank Ruskey
Generating Combinations by Prefix Shifts. COCOON 2005: 570-576
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-17 23:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: