scientific article; zbMATH DE number 822743

From MaRDI portal

Revision as of 03:46, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4856622

Jump to:navigation, search

zbMath0838.05003MaRDI QIDQ4856622

No author found.

Publication date: 30 May 1996

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

zbMATH Keywords

algorithm integer sequences minimal change

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Permutations, words, matrices (05A05)

Related Items (6)

A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ On a Combinatorial Generation Problem of Knuth ⋮ Star transposition Gray codes for multiset permutations ⋮ Trimming and gluing Gray codes ⋮ On the low Hamming weight discrete logarithm problem for nonadjacent representations ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4856622&oldid=19208108"