scientific article; zbMATH DE number 4195954

MaRDI QIDQ5202662zbMATH OpenFDO

Authors Phillip J. Chase

Publication date 1989

zbMATH Keywords

combinations of k out of n ordered elementsgeneration at randomGray-codesequential generation

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Permutations, words, matrices (05A05) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Combinatorial codes (94B25)

Recommendations

• Approximate Quadrature Measures on Data-Defined Spaces
• Computing and Combinatorics
• Lexicographic ordering, ranking and unranking of combinations
• An optimal parallel algorithm for generating combinations
• scientific article; zbMATH DE number 4106841

Cited in

(20)

• The coolest way to generate combinations
• Trimming and gluing Gray codes
• Features of formation and ordering of samples
• Re-entrant lines
• Gray code for derangements
• Strings from linear recurrences and permutations: a gray code
• On the low Hamming weight discrete logarithm problem for nonadjacent representations
• A new algorithm for generating combinations
• An Eades-McKay algorithm for well-formed parentheses strings
• Lexicographic ordering, ranking and unranking of combinations
• scientific article; zbMATH DE number 510624 (Why is no real title available?)
• Approximate Quadrature Measures on Data-Defined Spaces
• The coolest way to generate binary strings
• On a combinatorial generation problem of Knuth
• Computing and Combinatorics
• A minimum-change version of the Chung-Feller theorem for Dyck paths
• Star transposition Gray codes for multiset permutations
• Kneser graphs are Hamiltonian
• Kneser graphs are Hamiltonian
• A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

This page was built for publication:

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