Guy Kindler
Title
Cited by
Cited by
Year
Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?
S Khot, G Kindler, E Mossel, R O’Donnell
SIAM Journal on Computing 37 (1), 319-357, 2007
6992007
Approximating CVP to within almost-polynomial factors is NP-hard
I Dinur, G Kindler, R Raz, S Safra
Combinatorica 23 (2), 205-243, 2003
2672003
Testing juntas
E Fischer, G Kindler, D Ron, S Safra, A Samorodnitsky
Journal of Computer and System Sciences 68 (4), 753-787, 2004
1582004
Traffic engineering with equal-cost-multipath: An algorithmic perspective
M Chiesa, G Kindler, M Schapira
IEEE/ACM Transactions on Networking 25 (2), 779-792, 2016
1312016
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors
B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1302005
On non-approximability for quadratic programs
S Arora, E Berger, H Elad, G Kindler, M Safra
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 206-215, 2005
802005
The geometry of manipulation—a quantitative proof of the Gibbard-Satterthwaite theorem
M Isaksson, G Kindler, E Mossel
Combinatorica 32 (2), 221-250, 2012
702012
On the Fourier tails of bounded functions over the discrete cube
I Dinur, E Friedgut, G Kindler, R O'Donnell
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006
672006
Lower bounds for the noisy broadcast problem
N Goyal, G Kindler, M Saks
SIAM Journal on Computing 37 (6), 1806-1841, 2008
632008
Simulating independence: New constructions of condensers, Ramsey graphs, dispersers, and extractors
B Barak, G Kindler, R Shaltiel, B Sudakov, A Wigderson
Journal of the ACM (JACM) 57 (4), 1-52, 2010
592010
Towards a proof of the 2-to-1 games conjecture?
I Dinur, S Khot, G Kindler, D Minzer, M Safra
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
562018
PCP characterizations of NP: Towards a polynomially-small error-probability
I Dinur, E Fischer, G Kindler, R Raz, S Safra
Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999
561999
Understanding parallel repetition requires understanding foams
U Feige, G Kindler, R O'Donnell
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
542007
On non-optimally expanding sets in Grassmann graphs
I Dinur, S Khot, G Kindler, D Minzer, M Safra
Israel Journal of Mathematics, 1-44, 2021
422021
Noise-resistant boolean functions are juntas
G Kindler, S Safra
preprint, 2002
422002
Hardness of approximating the closest vector problem with pre-processing
M Alekhnovich, SA Khot, G Kindler, NK Vishnoi
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 216-225, 2005
362005
The UGC hardness threshold of the Lp Grothendieck problem
G Kindler, A Naor, G Schechtman
Mathematics of Operations Research 35 (2), 267-283, 2010
332010
Direct sum testing
R David, I Dinur, E Goldenberg, G Kindler, I Shinkar
SIAM Journal on Computing 46 (4), 1336-1369, 2017
322017
Gaussian noise sensitivity and BosonSampling
G Kalai, G Kindler
arXiv preprint arXiv:1409.3093, 2014
312014
On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction
B Barak, G Kindler, D Steurer
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
302013
The system can't perform the operation now. Try again later.
Articles 1–20