scientific article; zbMATH DE number 1506516

zbMath0961.68102MaRDI QIDQ4504909

Timothy R. S. Walsh

Publication date: 14 January 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Gray codeloop-free sequencing algorithm

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05)

Related Items (12)

Tracing Isomanifolds in \(\mathbb{R}\) ^d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations ⋮ A loopless algorithm for generating the permutations of a multiset ⋮ Generalized algorithm for restricted weak composition generation ⋮ New algorithms and analyses for sum-preserving encryption ⋮ Restricted compositions and permutations: from old to new Gray codes ⋮ An efficient Gray code algorithm for generating all permutations with a given major index ⋮ A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions ⋮ Loop-free Gray code algorithms for the set of compositions ⋮ Generating restricted classes of involutions, Bell and Stirling permutations ⋮ A CAT algorithm for generating permutations with a fixed number of inversions ⋮ Gray code orders for \(q\)-ary words avoiding a given factor ⋮ Gray code for derangements

This page was built for publication: