An efficient parallel algorithm for random sampling

DOI10.1016/0020-0190(89)90206-8zbMath0665.68033OpenAlexW2127463195MaRDI QIDQ1116335

S. H. Smith

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90206-8

zbMATH Keywords

parallel algorithmrandom samplingPRAMCREW

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial probability (60C05) Discrete mathematics in relation to computer science (68R99)

Related Items (2)

An improved deterministic algorithm for generating different many-element random samples ⋮ Weighted random sampling with a reservoir

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• An efficient algorithm for random sampling without replacement
• Tight Bounds on the Complexity of Parallel Sorting
• Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital Computers
• Faster methods for random sampling
• Two efficient algorithms for random sampling without replacement
• Correction: Parallel Merge Sort

This page was built for publication: An efficient parallel algorithm for random sampling