scientific article; zbMATH DE number 1506516
From MaRDI portal
Publication:4504909
zbMATH Open0961.68102MaRDI QIDQ4504909FDOQ4504909
Authors: Timothy R. S. Walsh 
Publication date: 14 January 2001
Title of this publication is not available (Why is that?)
Recommendations
- Locally restricted sequential structures and runs of a subcomposition in integer compositions
- An algorithm for maximum desequencing of repetition-free loops
- Loop-free Gray code algorithms for the set of compositions
- Sequences of low arithmetical complexity
- scientific article; zbMATH DE number 2051150
- Sequences of linear arithmetical complexity
- Sequential algorithms for unbounded nondeterminism
- Integer sequences and semidefinite programming
- Aperiodic compositions and classical integer sequences
- scientific article; zbMATH DE number 3182299
Cited In (13)
- A loopless algorithm for generating the permutations of a multiset
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
- Loop-free Gray code algorithms for the set of compositions
- New algorithms and analyses for sum-preserving encryption
- An efficient Gray code algorithm for generating all permutations with a given major index
- Restricted compositions and permutations: from old to new Gray codes
- Tracing Isomanifolds in \(\mathbb{R}\) d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
- Title not available (Why is that?)
- 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
- Generating restricted classes of involutions, Bell and Stirling permutations
- Generalized algorithm for restricted weak composition generation
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 Q4504909)
