Lexicographic ordering, ranking and unranking of combinations
From MaRDI portal
Publication:3679196
Recommendations
- Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects
- scientific article; zbMATH DE number 4195954
- Unranking of small combinations from large sets
- Approximate Quadrature Measures on Data-Defined Spaces
- Some examples of lexicographic order algorithms and some open combinatorial problems
Cited in
(15)- A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
- scientific article; zbMATH DE number 3769721 (Why is no real title available?)
- Learning lexicographic orders
- Some examples of lexicographic order algorithms and some open combinatorial problems
- A new algorithm for generating combinations
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
- Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
- On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement
- Computing and Combinatorics
- Unranking of small combinations from large sets
- Essentially lexicographic aggregation
- scientific article; zbMATH DE number 493144 (Why is no real title available?)
- scientific article; zbMATH DE number 1751384 (Why is no real title available?)
- The coolest way to generate combinations
- Binary cyclic-gap constant weight codes with low-complexity encoding and decoding
This page was built for publication: Lexicographic ordering, ranking and unranking of combinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3679196)