17 citations · 24 across the 5 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016
Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem
Jan Hązła, Thomas Holenstein, Anup Rao
We study a special kind of bounds (so called forbidden subgraph bounds, cf. Feige, Verbitsky '02) for parallel repetition of multi-prover games. First, we show that forbidden subgr…
cs.DM2014
Upper Tail Estimates with Combinatorial Proofs
Jan Hązła, Thomas Holenstein
We study generalisations of a simple, combinatorial proof of a Chernoff bound similar to the one by Impagliazzo and Kabanets (RANDOM, 2010). In particular, we prove a randomized ve…