Practical algorithms for generating a random ordering of the elements of a weighted set
type: Item
instance of: scholarly article
title: Practical algorithms for generating a random ordering of the elements of a weighted set
zbMATH Open document ID: 1303.68168
author: Kevin J. Lang
published in: Theory of Computing Systems
publication date: 2015-01-21T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q87
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 6388514
zbMATH Keywords: practical algorithms
zbMATH Keywords: random ordering
zbMATH Keywords: random sampling
zbMATH Keywords: card shuffling
MaRDI profile type: Publication
full work available at URL: s00224-013-9496-6
OpenAlex ID: W2175577357
cites work: Trailing the dovetail shuffle to its lair
cites work: Q1600985
cites work: Q3662646
cites work: Q4250204
cites work: Introduction to algorithms
cites work: Elements of Information Theory
cites work: Q3723577
cites work: The complexity of generating an exponentially distributed variate
cites work: Generating Markov-Chain Transitions Quickly: II
cites work: Maintaining discrete probability distributions optimally
cites work: Q3935355
cites work: Q4349924
cites work: Q4131006
cites work: Existence of optimal prefix codes for infinite source alphabets
cites work: Dynamic generation of discrete random variates
cites work: Fast algorithms for generating discrete random variates with changing distributions
cites work: An Efficient Method for Generating Discrete Random Variables with General Distributions
cites work: An Efficient Method for Weighted Sampling without Replacement
DOI: 10.1007/S00224-013-9496-6
description: scientific article; zbMATH DE number 6388514