Publication | Date of Publication | Type |
---|
Hypercontractivity on the symmetric group | 2024-01-18 | Paper |
The Success Probability in Levine’s Hat Problem, and Independent Sets in Graphs | 2023-11-29 | Paper |
Improved Monotonicity Testers via Hypercube Embeddings | 2022-11-16 | Paper |
An analogue of Bonami's Lemma for functions on spaces of linear maps, and 2-2 Games | 2022-09-09 | Paper |
Forbidden intersection problems for families of linear maps | 2022-08-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5092467 | 2022-07-21 | Paper |
Isoperimetric Inequalities Made Simpler | 2022-04-13 | Paper |
On non-optimally expanding sets in Grassmann graphs | 2021-08-24 | Paper |
The success probability in Lionel Levine's hat problem is strictly decreasing with the number of players, and this is related to interesting questions regarding Hamming powers of Kneser graphs and independent sets in random subgraphs | 2021-03-02 | Paper |
Towards a proof of the Fourier-entropy conjecture? | 2020-12-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5111344 | 2020-05-27 | Paper |
Invariance Principle on the Slice | 2019-12-06 | Paper |
Towards a proof of the 2-to-1 games conjecture? | 2019-08-22 | Paper |
On non-optimally expanding sets in Grassmann graphs | 2019-08-22 | Paper |
Approximation of non-boolean 2CSP | 2018-07-16 | Paper |
Gaussian noise sensitivity and Fourier tails | 2018-06-29 | Paper |
Invariance principle on the slice | 2017-10-10 | Paper |
Direct Sum Testing | 2017-08-16 | Paper |
Direct Sum Testing | 2017-05-19 | Paper |
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction | 2017-05-16 | Paper |
Geometric stability via information theory | 2016-10-10 | Paper |
PCP characterizations of NP | 2016-09-29 | Paper |
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition | 2015-08-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q5500595 | 2015-08-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501250 | 2015-08-03 | Paper |
On the fourier tails of bounded functions over the discrete cube | 2014-11-25 | Paper |
Quantitative relation between noise sensitivity and influences | 2014-05-05 | Paper |
The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem | 2012-09-17 | Paper |
Hardness of approximating the closest vector problem with pre-processing | 2012-06-26 | Paper |
PCP characterizations of NP: toward a polynomially-small error-probability | 2011-11-30 | Paper |
The UGC Hardness Threshold of the Lp Grothendieck Problem | 2011-04-27 | Paper |
Simulating independence | 2010-08-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q3579368 | 2010-08-06 | Paper |
Simulating independence | 2010-07-14 | Paper |
Lower Bounds for the Noisy Broadcast Problem | 2008-12-22 | Paper |
Eliminating Cycles in the Discrete Torus | 2008-09-18 | Paper |
Eliminating cycles in the discrete torus | 2008-04-23 | Paper |
On the Fourier tails of bounded functions over the discrete cube | 2008-04-01 | Paper |
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? | 2008-03-28 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
On Distributions Computable by Random Walks on Graphs | 2005-02-28 | Paper |
Approximating CVP to within almost-polynomial factors is NP-hard | 2004-09-07 | Paper |
Testing juntas | 2004-08-06 | Paper |
Product Mixing in Compact Lie Groups | 0001-01-03 | Paper |
Polynomial Bogolyubov for special linear groups via tensor rank | 0001-01-03 | Paper |