Observations on the generation of permutations from random sequences

DOI10.1080/00207168908803745zbMath0675.68037OpenAlexW2088789991WikidataQ84508537 ScholiaQ84508537MaRDI QIDQ3830536

G. W. Kimble

Publication date: 1989

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803745

zbMATH Keywords

sampling without replacementrandom permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

On random and adaptive parallel generation of combinatorial objects

Cites Work

• Shuffling Cards and Stopping Times
• Quasi-Monte Carlo methods and pseudo-random numbers
• On the Length of Programs for Computing Finite Binary Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item