Practical algorithms for generating a random ordering of the elements of a weighted set

DOI10.1007/s00224-013-9496-6zbMath1303.68168OpenAlexW2175577357MaRDI QIDQ489756

Kevin J. Lang

Publication date: 21 January 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-013-9496-6

zbMATH Keywords

random samplingrandom orderingcard shufflingpractical algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Parallel Weighted Random Sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trailing the dovetail shuffle to its lair
• Dynamic generation of discrete random variates
• Contemporary combinatorics. Collection of survey papers in combinatorics based on lectures given in the workshop on probabilistic combinatorics at the Paul Erdős Summer Research Center in Mathematics, Budapest, Hungary
• An Efficient Method for Generating Discrete Random Variables with General Distributions
• The complexity of generating an exponentially distributed variate
• An Efficient Method for Weighted Sampling without Replacement
• Generating Markov-Chain Transitions Quickly: II
• Existence of optimal prefix codes for infinite source alphabets
• Maintaining discrete probability distributions optimally
• Fast algorithms for generating discrete random variates with changing distributions
• Elements of Information Theory

This page was built for publication: Practical algorithms for generating a random ordering of the elements of a weighted set