ECEASST
2011
13 years 6 months ago
2011
ECEASST
2011
13 years 6 months ago
2011
ECEASST
2011
13 years 6 months ago
2011
ECCC
2011
13 years 6 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...
ECCC
2011
13 years 6 months ago
2011
ECCC
2011
13 years 6 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
ECCC
2011
13 years 6 months ago
2011
ECCC
2011
13 years 6 months ago
2011
We revisit the notion of a targeted canonical derandomizer, introduced in our recent ECCC Report (TR10-135) as a uniform notion of a pseudorandom generator that suffices for yield...
ECCC
2011
13 years 6 months ago
2011
We show two new direct product results in two different models of communication complexity. Our first result is in the model of one-way public-coin model. Let f ⊆ X × Y × Z ...
ECCC
2011
13 years 6 months ago
2011
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...