A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

DOI10.1016/S0020-0190(98)00208-7MaRDI QIDQ294635zbMATH OpenOpenAlexFDO

Authors Dominique Roelants van Baronaigien

Publication date 16 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S0020019098002087?np=y

zbMATH Keywords

combinatorial problemsconstant amortized timelisting algorithms

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3772962
• A new algorithm for generation of permutations
• Generating permutations with given ups and downs
• scientific article; zbMATH DE number 3557795
• The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets

Cites work

• scientific article; zbMATH DE number 3864523 (Why is no real title available?)
• scientific article; zbMATH DE number 3557795 (Why is no real title available?)
• scientific article; zbMATH DE number 3322983 (Why is no real title available?)
• A Unified Setting for Selection Algorithms (II)
• A mechanical counting method and combinatorial applications
• A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects
• Generating alternating permutations lexicographically
• Generating permutations of a bag by interchanges
• Generating permutations with given ups and downs
• Generation of Permutations by Adjacent Transposition
• Lexicographic permutations with restrictions
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Cited in

(1)

• The minimum number of monotone subsequences

This page was built for publication: A multi-stack method for the fast generation of permutations with minimal length increasing subsequences

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