scientific article; zbMATH DE number 3864523

MaRDI QIDQ3332267zbMATH OpenFDO

Authors Frank Ruskey, Dominique Roelants van Baronaigien

Publication date 1984

zbMATH Keywords

algorithms for generating combinatorial objectsConstant average time algorithmsmultiset permutationsordered trees

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• Mathematical Foundations of Computer Science 2003
• The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
• Generating ordered trees
• On random and adaptive parallel generation of combinatorial objects
• A calculus for the random generation of labelled combinatorial structures

Cited in

(23)

• Generating permutations with given ups and downs
• Generating permutations of a bag by interchanges
• Finding parity difference by involutions
• Generating words lexicographically: An average-case analysis
• On generating \(k\)-ary trees in computer representation
• Features of formation and ordering of samples
• Efficient iteration in admissible combinatorial classes
• Generation of combinatorial elements using OOP
• On O(1) time algorithms for combinatorial generation
• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
• Quasi-Monotonic Sequences: Theory, Algorithms and Applications
• Generating random combinatorial objects
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• On random and adaptive parallel generation of combinatorial objects
• Efficient enumeration of ordered trees with \(k\) leaves
• scientific article; zbMATH DE number 1504592 (Why is no real title available?)
• scientific article; zbMATH DE number 1504644 (Why is no real title available?)
• scientific article; zbMATH DE number 1522933 (Why is no real title available?)
• A non-recursive algorithm of generating an r-permutation and its applications
• Successor algorithms via counting arguments
• Mathematical Foundations of Computer Science 2003
• Distribution of distinguishable objects to bins: generating all distributions
• Combinatorial generation: greedy approaches and symmetry

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