An efficient parallel algorithm for random sampling
- 13 March 1989
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 30 (5), 265-268
- https://doi.org/10.1016/0020-0190(89)90206-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Programming pearlsCommunications of the ACM, 1984
- Faster methods for random samplingCommunications of the ACM, 1984
- An efficient algorithm for random sampling without replacementInternational Journal of Computer Mathematics, 1984
- An Algorithm for Unbiased Random SamplingThe Computer Journal, 1982
- Two efficient algorithms for random sampling without replacementInternational Journal of Computer Mathematics, 1982
- Development of Sampling Plans by Using Sequential (Item by Item) Selection Techniques and Digital ComputersJournal of the American Statistical Association, 1962