Two efficient algorithms for random sampling without replacement

DOI10.1080/00207168208803304MaRDI QIDQ3938518zbMATH OpenOpenAlexFDO

Authors Jukka Teuhola, Olli S. Nevalainen

Publication date 1982

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

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

zbMATH Keywords

auxiliary storageaverage processing timeHash-storage techniquerandom integersrandom numbersworst case processing time

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Theory of software (68N99) Discrete mathematics in relation to computer science (68R99)

Cited in

(1)

• An efficient parallel algorithm for random sampling

This page was built for publication: Two efficient algorithms for random sampling without replacement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3938518)