arXiv Open Access 2021

Simple, Optimal Algorithms for Random Sampling Without Replacement

Daniel Ting

Lihat Sumber

Abstrak

Consider the fundamental problem of drawing a simple random sample of size k without replacement from [n] := {1, . . . , n}. Although a number of classical algorithms exist for this problem, we construct algorithms that are even simpler, easier to implement, and have optimal space and time complexity.

Topik & Kata Kunci

cs.DS stat.CO

Penulis (1)

Daniel Ting

Format Sitasi

APA MLA BibTeX

Ting, D. (2021). Simple, Optimal Algorithms for Random Sampling Without Replacement. https://arxiv.org/abs/2104.05091

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2021
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓