Loopless Algorithms And SchrÖder Trees

DOI10.1080/0020716031000070599MaRDI QIDQ4464414zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Loopless Generation of Schroder Trees
• A loopless algorithm for generating binary tree sequences
• Loop Free Generation ofK-Ary Trees
• FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
• On generating \(k\)-ary trees in computer representation

Cites work

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

Cited in

(7)

• A loopless algorithm for generating binary tree sequences
• The representation of permutations by trees
• An exhaustive generation algorithm for Catalan objects and others
• FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
• Loopless Functional Algorithms
• Loopless Generation of Schroder Trees
• Loop Free Generation ofK-Ary Trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464414)