Randomness-optimal oblivious sampling


We present the first efficient oblivious sampler that uses an optimal number of random bits, up to an arbitrary constant factor bigger than 1. Specifically, for any α > 0, it uses (1 +α)(m+ log γ−1) random bits to output d = poly( −1, log γ−1,m) sample points z1, . . . , zd ∈ {0, 1} such that for any function f : {0, 1} → [0, 1], Pr [ ∣∣∣ 1 d ∑di=1f(zi)−Ef… (More)
DOI: 10.1002/(SICI)1098-2418(199712)11:4%3C345::AID-RSA4%3E3.0.CO;2-Z


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

154 Citations

Semantic Scholar estimates that this publication has 154 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics