91 citations · 178 across the 17 of their papers we have counts for
1 paper · 2 filters
Daniel Ting
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 thi…