Lexicographic ordering, ranking and unranking of combinations
From MaRDI portal
Publication:3679196
DOI10.1080/00207168508803468zbMATH Open0565.05008OpenAlexW1972335745MaRDI QIDQ3679196FDOQ3679196
Authors: M. C. Er 
Publication date: 1985
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168508803468
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
Cites Work
Cited In (15)
- A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Essentially lexicographic aggregation
- Title not available (Why is that?)
- 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)
