Pages that link to "Item:Q1603397"
From MaRDI portal
The following pages link to Ranking and unranking permutations in linear time (Q1603397):
Displaying 21 items.
- Unranking of small combinations from large sets (Q473209) (← links)
- Random and exhaustive generation of permutations and cycles (Q659769) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- A note on unscrambling address lines (Q1007522) (← links)
- On zigzag permutations and comparisons of adjacent elements (Q1063028) (← links)
- A linear time randomizing algorithm for searching ranked functions (Q1101237) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Efficient linear-time ranking and unranking of derangements (Q2094363) (← links)
- Ranking binary unlabelled necklaces in polynomial time (Q2112175) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Lexicographic ranking and unranking of derangements in cycle notation (Q2636806) (← links)
- An audit tool for genome rearrangement algorithms (Q2828184) (← links)
- Fast Order-Preserving Pattern Matching (Q2867128) (← links)
- A Groupoid of Isomorphic Data Transformations (Q3637276) (← links)
- Une permutation sur un ensemble dont le cardinal est un nombre triangulaire. (A permutation on a set of which the number of elements is a triangular number) (Q3976895) (← links)
- Translation Techniques for Reversible Circuit Synthesis with Positive and Negative Controls (Q5157443) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- A prediction model for ranking branch-and-bound procedures for the resource-constrained project scheduling problem (Q6106485) (← links)
- Ranking and unranking bordered and unbordered words (Q6121434) (← links)