Loopless Algorithms And SchrÖder Trees

DOI10.1080/0020716031000070599zbMath1103.68971OpenAlexW2070106234MaRDI QIDQ4464414

Seymour Lipschutz, Paul S. jun. LaFollette, James F. Korsh

Publication date: 27 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020716031000070599

zbMATH Keywords

Gray codeSchröder trees

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Shifts and loopless generation of \(k\)-ary trees
• A classic proof of a recurrence for a very classical sequence
• Efficient generation of the binary reflected gray code and its applications
• Generating Permutations with Nondistinct Items
• On Rotations and the Generation of Binary Trees
• Hipparchus, Plutarch, Schroder, and Hough
• Generating Multiset Permutations in Constant Time
• A Survey of Combinatorial Gray Codes
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

This page was built for publication: Loopless Algorithms And SchrÖder Trees