The coolest way to generate binary strings
From MaRDI portal
Publication:489746
DOI10.1007/S00224-013-9486-8zbMATH Open1303.68165OpenAlexW2006913132MaRDI QIDQ489746FDOQ489746
Authors: Brett Stevens, Aaron Williams 
Publication date: 21 January 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9486-8
Recommendations
- Computing on binary strings
- scientific article; zbMATH DE number 1472198
- Efficient generation of binary words of given weight
- On generating binary words palindromically
- Counting certain binary strings
- Binary strings and the Jacobsthal numbers
- Binary strings with all runs of odd length
- scientific article; zbMATH DE number 1665457
- Generative binary codes
de Bruijn sequenceHamming distancecombinatorics on wordsGray codebinary stringscool-lex orderFKM algorithmuniversal cycleLevenshtein distancenecklace prefix algorithm
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- A problem in arrangements
- An algorithm for generating subsets of fixed size with a strong minimal change property
- Title not available (Why is that?)
- The origins of combinatorics on words
- An algorithm for generating necklaces of beads in two colors
- De Bruijn sequences for fixed-weight binary strings
- A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
- Generating necklaces
- Efficient oracles for generating binary bubble languages
- Binary bubble languages and cool-lex order
- Monotone Gray codes and the middle levels problem
- Long cycles in the middle two layers of the discrete cube
- De Bruijn sequences for the binary strings with maximum density
- The coolest way to generate combinations
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- Cool-lex order and \(k\)-ary Catalan structures
- Title not available (Why is that?)
- Adjacent interchange generation of combinations
- On the de Bruijn torus problem
Cited In (10)
- Binary bubble languages and cool-lex order
- Flip-swap languages in binary reflected Gray code order
- On the hardness of Gray code problems for combinatorial objects
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
- Successor rules for flipping pancakes and burnt pancakes
- De Bruijn sequences for fixed-weight binary strings
- On universal partial words
- Computing generalized de Bruijn sequences
- The coolest way to generate combinations
- Trimming and gluing Gray codes
This page was built for publication: The coolest way to generate binary strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489746)
