scientific article; zbMATH DE number 2040940

zbMATH Open1038.68566MaRDI QIDQ4452089FDOQ4452089

Authors:

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310073.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1933234
• Gray codes for involutions
• A general exhaustive generation algorithm for Gray structures
• Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
• Linear time construction of a compressed Gray code

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Combinatorics on words (68R15)

Cited In (28)

• Binary bubble languages and cool-lex order
• A general exhaustive generation algorithm for Gray structures
• Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
• Flip-swap languages in binary reflected Gray code order
• More restrictive Gray codes for necklaces and Lyndon words
• Title not available (Why is that?)
• Restricted compositions and permutations: from old to new Gray codes
• Improved methods for generating quasi-Gray codes
• Efficient coroutine generation of constrained Gray sequences
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words
• Gray codes for signed involutions
• Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
• Traversing combinatorial 0/1-polytopes via optimization
• A fast algorithm to generate Beckett-Gray codes
• Minimal change list for Lucas strings and some graph theoretic consequences
• Prefix partitioned Gray codes for particular cross-bifix-free sets
• Gray code orders for \(q\)-ary words avoiding a given factor
• Gray coding cubic planar maps
• Gray visiting Motzkins
• Efficient generation of restricted growth words
• The coolest way to generate combinations
• Generating Gray codes for weak orders in constant amortized time
• Gray code for permutations with a fixed number of cycles
• Strings from linear recurrences and permutations: a gray code
• Generalized algorithm for restricted weak composition generation
• Generating 2-Gray codes for ballot sequences in constant amortized time
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order
• Gray codes for involutions

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 Q4452089)