Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. - Irit Dinur; Guy Kindler; Shmuel Safra (FOCS, 1998)

Approximating CVP to Within Almost Polynomial Factor is NP-Hard - Irit Dinur; Guy Kindler; Shmuel Safra (Electron. Colloquium Comput. Complex., 1998)

PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability - Irit Dinur; Eldar Fischer; Guy Kindler; Ran Raz; Shmuel Safra (Electron. Colloquium Comput. Complex., 1998)

Property testing PCP and juntas - Guy Kindler (2002)

Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. - Irit Dinur; Guy Kindler; Ran Raz; Shmuel Safra (Comb., 2003)

Testing juntas. - Eldar Fischer; Guy Kindler; Dana Ron; Shmuel Safra; Alex Samorodnitsky (J. Comput. Syst. Sci., 2004)

On Distributions Computable by Random Walks on Graphs. - Guy Kindler; Dan Romik (SIAM J. Discret. Math., 2004)

On Non-Approximability for Quadratic Programs - Sanjeev Arora; Eli Berger; Elad Hazan; Guy Kindler; Muli Safra (Electron. Colloquium Comput. Complex., 2005)

On the Error Parameter of Dispersers - Ronen Gradwohl; Guy Kindler; Omer Reingold; Amnon Ta-Shma (Electron. Colloquium Comput. Complex., 2005)

On the fourier tails of bounded functions over the discrete cube. - Irit Dinur; Ehud Friedgut; Guy Kindler; Ryan O'Donnell (STOC, 2006)

Understanding Parallel Repetition Requires Understanding Foams. - Uriel Feige; Guy Kindler; Ryan O'Donnell (Electron. Colloquium Comput. Complex., 2007)

Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. - Subhash Khot; Guy Kindler; Elchanan Mossel; Ryan O'Donnell (SIAM J. Comput., 2007)

Spherical Cubes and Rounding in High Dimensions. - Guy Kindler; Ryan O'Donnell; Anup Rao 001; Avi Wigderson (FOCS, 2008)

The UGC hardness threshold of the ℓp Grothendieck problem. - Guy Kindler; Assaf Naor; Gideon Schechtman (SODA, 2008)

Eliminating Cycles in the Discrete Torus. - Béla Bollobás; Guy Kindler; Imre Leader; Ryan O'Donnell (Algorithmica, 2008)

Lower Bounds for the Noisy Broadcast Problem. - Navin Goyal; Guy Kindler; Michael E. Saks (SIAM J. Comput., 2008)

Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. - Boaz Barak; Guy Kindler; Ronen Shaltiel; Benny Sudakov; Avi Wigderson (Electron. Colloquium Comput. Complex., 2010)

The UGC Hardness Threshold of the Lp Grothendieck Problem. - Guy Kindler; Assaf Naor; Gideon Schechtman (Math. Oper. Res., 2010)

Hardness of Approximating the Closest Vector Problem with Pre-Processing. - Mikhail Alekhnovich; Subhash Khot; Guy Kindler; Nisheeth K. Vishnoi (Comput. Complex., 2011)

PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. - Irit Dinur; Eldar Fischer; Guy Kindler; Ran Raz; Shmuel Safra (Comput. Complex., 2011)

Gaussian Noise Sensitivity and Fourier Tails. - Guy Kindler; Ryan O'Donnell (CCC, 2012)

Spherical cubes: optimal foams from computational hardness amplification. - Guy Kindler; Anup Rao 001; Ryan O'Donnell; Avi Wigderson (Commun. ACM, 2012)

The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem. - Marcus Isaksson; Guy Kindler; Elchanan Mossel (Comb., 2012)

On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. - Boaz Barak; Guy Kindler; David Steurer (ITCS, 2013)

Quantitative relation between noise sensitivity and influences. - Nathan Keller; Guy Kindler (Comb., 2013)

Gaussian Noise Sensitivity and BosonSampling. - Gil Kalai; Guy Kindler (CoRR, 2014)

Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. - Irit Dinur; Prahladh Harsha; Guy Kindler (STOC, 2015)

Unique Games on the Hypercube. - Naman Agarwal; Guy Kindler; Alexandra Kolla; Luca Trevisan 001 (Chic. J. Theor. Comput. Sci., 2015)

Geometric stability via information theory. - David Ellis; Ehud Friedgut; Guy Kindler; Amir Yehudayoff (CoRR, 2015)

Continuous analogues of the Most Informative Function problem. - Guy Kindler; Ryan O'Donnell; David Witmer (CoRR, 2015)

Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. - Irit Dinur; Prahladh Harsha; Guy Kindler (Electron. Colloquium Comput. Complex., 2015)

Approximation of non-boolean 2CSP. - Guy Kindler; Alexandra Kolla; Luca Trevisan 001 (SODA, 2016)

Towards a Proof of the 2-to-1 Games Conjecture? - Irit Dinur; Subhash Khot; Guy Kindler; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2016)

Property Testing, PCP, andJuntas. - Guy Kindler (Electron. Colloquium Comput. Complex., 2016)

Quantum Automata Cannot Detect Biased Coins, Even in the Limit. - Guy Kindler; Ryan O'Donnell (ICALP, 2017)

On Non-Optimally Expanding Sets in Grassmann Graphs. - Irit Dinur; Subhash Khot; Guy Kindler; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2017)

Direct Sum Testing. - Roee David; Irit Dinur; Elazar Goldenberg; Guy Kindler; Igor Shinkar (SIAM J. Comput., 2017)

Traffic Engineering With Equal-Cost-MultiPath: An Algorithmic Perspective. - Marco Chiesa; Guy Kindler; Michael Schapira (IEEE/ACM Trans. Netw., 2017)

Invariance Principle on the Slice. - Yuval Filmus; Guy Kindler; Elchanan Mossel; Karl Wimmer (ACM Trans. Comput. Theory, 2018)

Revisiting Bourgain-Kalai and Fourier Entropies. - Esty Kelman; Guy Kindler; Noam Lifshitz; Dor Minzer; Muli Safra (CoRR, 2019)

Towards a Proof of the Fourier-Entropy Conjecture? - Esty Kelman; Guy Kindler; Noam Lifshitz; Dor Minzer; Muli Safra (FOCS, 2020)

Hypercontractivity on the symmetric group. - Yuval Filmus; Guy Kindler; Noam Lifshitz; Dor Minzer (CoRR, 2020)

Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality. - Esty Kelman; Subhash Khot; Guy Kindler; Dor Minzer; Muli Safra (Electron. Colloquium Comput. Complex., 2020)

Towards a quantum-inspired proof for IP = PSPACE. - Ayal Green; Guy Kindler; Yupan Liu (Quantum Inf. Comput., 2021)

Isoperimetric Inequalities Made Simpler. - Ronen Eldan; Guy Kindler; Noam Lifshitz; Dor Minzer (CoRR, 2022)

Improved Monotonicity Testers via Hypercube Embeddings. - Mark Braverman; Subhash Khot; Guy Kindler; Dor Minzer (ITCS, 2023)

An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 Games. - David Ellis; Guy Kindler; Noam Lifshitz (STOC, 2023)

Product mixing in compact Lie groups. - David Ellis; Guy Kindler; Noam Lifshitz; Dor Minzer (Electron. Colloquium Comput. Complex., 2023)

The Success Probability in Levine's Hat Problem, and Independent Sets in Graphs. - Noga Alon; Ehud Friedgut; Gil Kalai; Guy Kindler (SIAM J. Discret. Math., 2023)

Limits of Preprocessing. - Yuval Filmus; Yuval Ishai; Avi Kaplan; Guy Kindler (Comput. Complex., 2024)