The coolest way to generate combinations

DOI10.1016/J.DISC.2007.11.048zbMATH Open1180.68297OpenAlexW2027483825MaRDI QIDQ1044892FDOQ1044892

Authors: Frank Ruskey, Aaron Williams 

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.048

Recommendations

• Computing and Combinatorics
• The coolest way to generate binary strings
• scientific article; zbMATH DE number 4195954
• Lexicographic ordering, ranking and unranking of combinations
• scientific article

zbMATH Keywords

binary stringsgenerating combinationsloopless algorithmbranchless algorithmcolexconstant extra spaceGray code orderprefix rotationprefix shift

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• An algorithm for generating subsets of fixed size with a strong minimal change property
• Some Hamilton Paths and a Minimal Change Algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient generation of the binary reflected gray code and its applications
• Gray codes for involutions
• Title not available (Why is that?)
• A loopless algorithm for generating the permutations of a multiset
• Generating Multiset Permutations in Constant Time
• Title not available (Why is that?)
• Computing and Combinatorics
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
• Determining the Hamilton-connectedness of certain vertex-transitive graphs
• Distance-2 Cyclic Chaining of Constant-Weight Codes

Cited In (16)

• Cool-lex order and \(k\)-ary Catalan structures
• 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
• Constructing the first (and coolest) fixed-content universal cycle
• De Bruijn sequences for the binary strings with maximum density
• A shift Gray code for fixed-content Łukasiewicz words
• Successor rules for flipping pancakes and burnt pancakes
• Star transposition Gray codes for multiset permutations
• Computing and Combinatorics
• Unranking of small combinations from large sets
• On a Combinatorial Generation Problem of Knuth
• Computing expectations and marginal likelihoods for permutations
• The coolest way to generate binary strings
• Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
• Constant time and space updates for the sigma-tau problem

This page was built for publication: The coolest way to generate combinations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044892)