Thomas Holenstein
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Combinatorial Proofs of Concentration Bounds | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Gives a direct combinatorial proof that for n independent fair bits the chance of ≥ (1+ε)n/2 ones is ≤ exp(-ε^2 n/10) by choosing a random subset M of size m ≈… | ||
| nothing matches | ||