16 search results - page 4 / 4 » Pseudorandom Generators and Typically-Correct Derandomizatio... |
ECCC
2011
12 years 11 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...