scientific article; zbMATH DE number 1522933

zbMATH Open0964.68035MaRDI QIDQ4511229FDOQ4511229

Authors: Tadao Takaoka 

Publication date: 30 October 2000

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

Recommendations

• Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
• scientific article; zbMATH DE number 7051269
• A new algorithm for generation of permutations
• scientific article; zbMATH DE number 3864523
• A loopless algorithm for generating the permutations of a multiset

zbMATH Keywords

multiset permutations

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (13)

• A loopless algorithm for generating the permutations of a multiset
• Loop-free Gray code algorithms for the set of compositions
• Binary bubble languages and cool-lex order
• Gray codes, loopless algorithm and partitions
• Flip-swap languages in binary reflected Gray code order
• Constant time generation of derangements
• Title not available (Why is that?)
• The coolest way to generate combinations
• Generating Gray codes for weak orders in constant amortized time
• On \(O(1)\) time algorithms for combinatorial generation
• Design and Analysis of a Tree-Backtracking Algorithm for Multiset and Pure Permutations
• A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order

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