Lexicographic ordering, ranking and unranking of combinations

DOI10.1080/00207168508803468zbMath0565.05008OpenAlexW1972335745MaRDI QIDQ3679196

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

zbMATH Keywords

rankinglexicographic orderrecursive algorithmunrankingrepresenting combinations as binary strings

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Related Items (3)

On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement ⋮ A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan

Cites Work

• Factoring numbers in O(log n) arithmetic steps

This page was built for publication: Lexicographic ordering, ranking and unranking of combinations