An Improved Algorithm for Ordered Sequential Random Sampling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Improved Algorithm for Ordered Sequential Random Sampling

Full text

Pdf (357 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 16 , Issue 3 (September 1990) table of contents

Pages: 269 - 274

Year of Publication: 1990

ISSN:0098-3500

Author

K. Aiyappan Nair

Department of Mathematics and Computer Science, Edinboro University of Pennsylvania, Edinboro, PA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 28, Citation Count: 0

Additional Information:

references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/79505.356313 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	J. H. Ahrens , U. Dieter, Sequential random sampling, ACM Transactions on Mathematical Software (TOMS), v.11 n.2, p.157-169, June 1985 [doi>10.1145/214392.214402]
	2	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	3	Jeffrey Scott Vitter, Faster methods for random sampling, Communications of the ACM, v.27 n.7, p.703-718, July 1984 [doi>10.1145/358105.893]
	4	Jeffrey Scott Vitter, An efficient algorithm for sequential random sampling, ACM Transactions on Mathematical Software (TOMS), v.13 n.1, p.58-67, March 1987 [doi>10.1145/23002.23003]

INDEX TERMS

Primary Classification:
G. Mathematics of Computing

Adobe Acrobat

QuickTime

Windows Media Player

Real Player