The coolest way to generate combinations (Q1044892): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.11.048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027483825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Hamilton Paths and a Minimal Change Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for generating subsets of fixed size with a strong minimal change property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the Hamilton-connectedness of certain vertex-transitive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Multiset Permutations in Constant Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3726126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4511229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-2 Cyclic Chaining of Constant-Weight Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loopless algorithm for generating the permutations of a multiset / rank
 
Normal rank
Property / cites work
 
Property / cites work: A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452089 / rank
 
Normal rank

Latest revision as of 06:49, 2 July 2024

scientific article
Language Label Description Also known as
English
The coolest way to generate combinations
scientific article

    Statements

    The coolest way to generate combinations (English)
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    Gray code order
    0 references
    generating combinations
    0 references
    binary strings
    0 references
    colex
    0 references
    loopless algorithm
    0 references
    branchless algorithm
    0 references
    constant extra space
    0 references
    prefix rotation
    0 references
    prefix shift
    0 references

    Identifiers