Fetching the paper…
Reading the bibliography…
Hypercontractivity is one of the most powerful tools in Boolean function analysis.
Aline Bonami, Étude des coefficients de fourier des fonctions de L p
1970
Earlier work this paper cites.
William Beckner, Inequalities in fourier analysis , Annals of Mathematics 102
1975
Earlier work this paper cites.
Leonard Gross, Logarithmic sobolev inequalities , American Journal of Mathematics 97
1975
Earlier work this paper cites.
J. Kahn, G. Kalai, and N. Linial, The influence of variables on boolean functions , 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (Los Alamitos, CA, USA), IEEE Computer Society, oct 1988, pp. 68–80
1988
Earlier work this paper cites.
Jean Bourgain, Jeff Kahn, Gil Kalai, Yitzhak Katznelson, and Nathan Linial, The influence of variables in product spaces , Israel Journal of Mathematics 77
1992
Earlier work this paper cites.
Michel Talagrand, On russo’s approximate zero-one law , The Annals of Probability (1994), 1576–1587
1994
Earlier work this paper cites.
Persi Diaconis and Laurent Saloff-Coste, Logarithmic sobolev inequalities for finite markov chains , The Annals of Applied Probability 6
1996
Earlier work this paper cites.
Ehud Friedgut and Gil Kalai, Every monotone graph property has a sharp threshold , Proceedings of the American mathematical Society 124
1996
Earlier work this paper cites.
Ehud Friedgut, Boolean functions with low average sensitivity depend on few coordinates , Combinatorica 18
1998
Earlier work this paper cites.
Ehud Friedgut and Jean Bourgain, Sharp thresholds of graph properties, and the k-sat problem , Journal of the American mathematical Society 12
1999
Earlier work this paper cites.
Ehud Friedgut, Gil Kalai, and Assaf Naor, Boolean functions whose fourier transform is concentrated on the first two levels , Advances in Applied Mathematics 29
2002
Earlier work this paper cites.
Alexander Lubotzky, Beth Samuels, and Uzi Vishne, Explicit constructions of ramanujan complexes of type ad , European Journal of Combinatorics 26
2005
Earlier work this paper cites.
Elchanan Mossel, Ryan O’Donnell, and Krzysztof Oleszkiewicz, Noise stability of functions with low influences: invariance and optimality , 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS’05), IEEE, 2005, pp. 21–30
2005
Earlier work this paper cites.
Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, and David Steurer, Making the long code shorter , 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, IEEE, 2012, pp. 370–379
2012
Earlier work this paper cites.
Ryan O’Donnell, Analysis of boolean functions , Cambridge University Press, 2014
2014
Earlier work this paper cites.
2016
Earlier work this paper cites.
Irit Dinur and Tali Kaufman, High dimensional expanders imply agreement expanders , 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2017, pp. 974–985
2017
Earlier work this paper cites.
Subhash Khot, Dor Minzer, and Muli Safra, On independent sets, 2-to-2 games, and grassmann graphs , Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017, pp. 576–589
2017
Earlier work this paper cites.
2018
Cited alongside, same era.
Yotam Dikstein, Irit Dinur, Yuval Filmus, and Prahladh Harsha, Boolean function analysis on high-dimensional expanders , Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018
2018
Cited alongside, same era.
Irit Dinur, Subhash Khot, Guy Kindler, Dor Minzer, and Muli Safra, On non-optimally expanding sets in grassmann graphs , Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, pp. 940–951
2018
Cited alongside, same era.
2018
Cited alongside, same era.
Shai Evra, Tali Kaufman, and Gilles Zémor, Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders , 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, 2020, pp. 218–227
2020
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
Tali Kaufman and Ella Sharakanski, Chernoff bound for high-dimensional expanders , To Appear APPROX/RANDOM 2020, 2020
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Subhash Khot, Dor Minzer, Dana Moshkovitz, and Muli Safra, Small set expansion in the johnson graph. , Electronic Colloquium on Computational Complexity (ECCC), vol. 25, 2018, p. 78
2018
Cited alongside, same era.
Tali Kaufman and Izhar Oppenheim, Construction of new local spectral high dimensional expanders , Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018, pp. 773–786
2018
Cited alongside, same era.
Izhar Oppenheim, Local spectral expansion approach to high dimensional expanders part i: Descent of spectral gaps , Discrete & Computational Geometry 59
2018
Cited alongside, same era.
Vedat Levi Alev, Fernando Granha Jeronimo, and Madhur Tulsiani, Approximating constraint satisfaction problems on high-dimensional expanders , 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2019, pp. 180–201
2019
Cited alongside, same era.
Nima Anari, Kuikui Liu, Shayan Oveis Gharan, and Cynthia Vinzant, Log-concave polynomials ii: high-dimensional walks and an fpras for counting bases of a matroid , Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, pp. 1–12
2019
Cited alongside, same era.
Yotam Dikstein and Irit Dinur, Agreement testing theorems on layered set systems , 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, 2019, pp. 1495–1524
2019
Cited alongside, same era.
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, and Amnon Ta Shma, List decoding with double samplers , Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2019, pp. 2134–2153
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2020
Later among the works it cites.
2021
Closest in time.
2021
Closest in time.
Zongchen Chen, Andreas Galanis, Daniel Štefankovič, and Eric Vigoda, Rapid mixing for colorings via spectral independence , Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2021, pp. 1548–1557
2021
Closest in time.
2021
Closest in time.
Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang, Rapid mixing from spectral independence beyond the boolean domain , Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2021, pp. 1558–1577
2021
Closest in time.
Tom Gur, Noam Lifshitz, and Siqi Liu, Personal communication, June 2021
2021
Closest in time.
2021
Closest in time.
Fernando Granha Jeronimo, Shashank Srivastava, and Madhur Tulsiani, Near-linear time decoding of ta-shma’s codes via splittable regularity , Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021, pp. 1527–1536
2021
Closest in time.
Tali Kaufman and Izhar Oppenheim, High dimensional expansion implies amplified local testability , CoRR (2021)
2021
Closest in time.
2021
Closest in time.
Tali Kaufman and Ran J. Tessler, New cosystolic expanders from tensors imply explicit quantum LDPC codes with Ω \Omega ( √ \surd n log k n ) distance , STOC ’21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021, 2021, pp. 1317–1329
2021
Closest in time.