scientific article; zbMATH DE number 7829467

MaRDI QIDQ6126504

Jittat Fakcharoenphol, Unnamed Author

Publication date: 9 April 2024

Full work available at URL: https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1555

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programmingpolynomial time algorithmrandom generationderangement

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Linear-time generation of uniform random derangements encoded in cycle notation
• Gaussian limiting distributions for the number of components in combinatorial structures
• Ranking and unranking permutations in linear time
• Efficient linear-time ranking and unranking of derangements
• The Feller coupling for random derangements
• Efficient generation of random derangements with the expected distribution of cycle lengths
• The sampling theory of selectively neutral alleles
• Integer multiplication in time \(O(n\log n)\)
• Mersenne twister
• Generating Random Derangements

This page was built for publication: