Linear-Time Ranking of Permutations

DOI10.1007/978-3-540-75520-3_18MaRDI QIDQ3527211zbMATH OpenOpenAlexFDO

Authors Martin Mareš, Milan Straka

Publication date 25 September 2008

Published in Algorithms – ESA 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75520-3_18

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Ranking and unranking permutations in linear time
• scientific article; zbMATH DE number 1206598
• scientific article; zbMATH DE number 2145159
• Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects
• scientific article; zbMATH DE number 1783748

Cited in

(17)

• A linear time randomizing algorithm for searching ranked functions
• Ranking and unranking permutations in linear time
• Cool-lex order and k-ary Catalan structures
• Efficient linear-time ranking and unranking of derangements
• Ranking binary unlabelled necklaces in polynomial time
• Homomorphic rank sort using surrogate polynomials
• Lexicographic ranking and unranking of derangements in cycle notation
• Fast order-preserving pattern matching
• Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects
• scientific article; zbMATH DE number 1783748 (Why is no real title available?)
• The saga of minimum spanning trees
• scientific article; zbMATH DE number 2145159 (Why is no real title available?)
• Unranking of small combinations from large sets
• A fast algorithm for order-preserving pattern matching
• Ranking Templates for Linear Loops
• A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem
• Ranking and unranking bordered and unbordered words

This page was built for publication: Linear-Time Ranking of Permutations

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