Guy Kindler
Guy Kindler
כתובת אימייל מאומתת בדומיין cs.huji.ac.il
כותרתצוטט על ידישנה
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
5652007
Approximating-CVP to within almost-polynomial factors is NP-hard
I Dinur, G Kindler, S Safra
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
2341998
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
1222005
Testing juntas
E Fischer, G Kindler, D Ron, S Safra, A Samorodnitsky
Journal of Computer and System Sciences 68 (4), 753-787, 2004
1222004
Constitutional constructions and constitutional decision rules: thoughts on the Carving of Implementation Space
MN Berman
Const. Comment. 27, 39, 2010
68*2010
The magazine archive includes every article published in Communications of the ACM for over the past 50 years.
S McDonald, HM Edwards
Communications of the ACM 50 (1), 66-71, 2007
65*2007
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
642005
Traffic engineering with equal-cost-multipath: An algorithmic perspective
M Chiesa, G Kindler, M Schapira
IEEE/ACM Transactions on Networking (TON) 25 (2), 779-792, 2017
622017
The geometry of manipulation—a quantitative proof of the Gibbard-Satterthwaite theorem
M Isaksson, G Kindler, E Mossel
Combinatorica 32 (2), 221-250, 2012
622012
PCP characterizations of NP: Towards a polynomially-small error-probability
I Dinur, E Fischer, G Kindler, R Raz, S Safra
STOC, 29-40, 1999
611999
Lower bounds for the noisy broadcast problem
N Goyal, G Kindler, M Saks
SIAM Journal on Computing 37 (6), 1806-1841, 2008
562008
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
522006
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), 20, 2010
492010
Understanding parallel repetition requires understanding foams
U Feige, G Kindler, R O'Donnell
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007
472007
Noise-resistant boolean functions are juntas
G Kindler, S Safra
preprint, 2002
362002
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
312005
The UGC hardness threshold of the Lp Grothendieck problem
G Kindler, A Naor, G Schechtman
Mathematics of Operations Research 35 (2), 267-283, 2010
292010
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
252013
Gaussian noise sensitivity and Fourier tails
G Kindler, R O'Donnell
2012 IEEE 27th Conference on Computational Complexity, 137-147, 2012
232012
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
222018
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20