Guy Kindler

Sitert av

	Alle	Siden 2020
Sitater	3231	1161
h-indeks	26	15
i10-indeks	35	27

260

130

195

19992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202512 17 13 13 21 20 29 86 60 96 109 131 140 143 112 145 144 153 156 185 206 165 221 255 233 250 37

Offentlig tilgang

Vis alle

14 artikler

0 artikler

tilgjengelige

ikke tilgjengelige

Basert på finansieringsmandater

Medforfattere

Ryan O'DonnellProfessor, Computer Science Department, Carnegie MellonVerifisert e-postadresse på cs.cmu.edu
Elchanan MosselProfessor of Mathematics, MITVerifisert e-postadresse på mit.edu
Noam LifshitzSenior lecturer, Einstein institute of Mathematics, Hebrew University of JerusalemVerifisert e-postadresse på mail.huji.ac.il
Boaz BarakHarvard UniversityVerifisert e-postadresse på boazbarak.org
Ran RazPrinceton UniversityVerifisert e-postadresse på princeton.edu
Ehud FriedgutProfessor of Mathematics, Weizmann Institute of ScienceVerifisert e-postadresse på weizmann.ac.il
Ronen ShaltielProfessor of Computer Science, University of HaifaVerifisert e-postadresse på cs.haifa.ac.il
Sanjeev AroraProfessor of Computer Science, Princeton UniversityVerifisert e-postadresse på princeton.edu
Benjamin SudakovETH, ZurichVerifisert e-postadresse på math.ethz.ch
Gil KalaiProf. of Computer Science, The Interdisciplinary Center; Prof. of Mathematics, Hebrew U.Verifisert e-postadresse på math.huji.ac.il
Yuval FilmusAssociate Professor, TechnionVerifisert e-postadresse på cs.technion.ac.il
Elad HazanProfessor at Princeton University and Director Google AI PrincetonVerifisert e-postadresse på princeton.edu
Marco ChiesaKTH Royal Institute of TechnologyVerifisert e-postadresse på kth.se
Michael SchapiraProfessor of Computer Science, The Hebrew University of JerusalemVerifisert e-postadresse på huji.ac.il
Anup RaoProfessor of Computer Science, University of WashingtonVerifisert e-postadresse på cs.washington.edu
Michael SaksRutgers University-New BrunswickVerifisert e-postadresse på math.rutgers.edu
Esty KelmanMIT and BUVerifisert e-postadresse på bu.edu
David SteurerETH ZürichVerifisert e-postadresse på inf.ethz.ch
Navin GoyalMicrosoft ResearchVerifisert e-postadresse på microsoft.com
Uriel FeigeProfessor of Computer Science, Weizmann Institute of ScienceVerifisert e-postadresse på weizmann.ac.il

Følg

Guy Kindler

The Hebrew University

Verifisert e-postadresse på cs.huji.ac.il - Startside

Theory of Computer Science Harmonic analysis of Boolean functions


Tittel Sorter etter sitater Sorter etter år Sorter etter tittel	Sitert av Sitert av	År
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	922	2007
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	321	1998
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	224	2016
Testing juntas E Fischer, G Kindler, D Ron, S Safra, A Samorodnitsky Journal of Computer and System Sciences 68 (4), 753-787, 2004	180	2004
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	139	2005
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	106	2018
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	102	2005
On non-optimally expanding sets in Grassmann graphs I Dinur, S Khot, G Kindler, D Minzer, M Safra Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	87	2018
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	84	2006
The geometry of manipulation—a quantitative proof of the Gibbard-Satterthwaite theorem M Isaksson, G Kindler, E Mossel Combinatorica 32 (2), 221-250, 2012	77	2012
Lower bounds for the noisy broadcast problem N Goyal, G Kindler, M Saks SIAM Journal on Computing 37 (6), 1806-1841, 2008	71	2008
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	70	2010
Gaussian noise sensitivity and BosonSampling G Kalai, G Kindler arXiv preprint arXiv:1409.3093, 2014	65	2014
Understanding parallel repetition requires understanding foams U Feige, G Kindler, R O'Donnell Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07 …, 2007	63	2007
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	62	1999
Noise-resistant boolean functions are juntas G Kindler, S Safra preprint 5 (7), 19, 2002	58	2002
Direct sum testing R David, I Dinur, E Goldenberg, G Kindler, I Shinkar Proceedings of the 2015 Conference on innovations in theoretical computer …, 2015	46	2015
The UGC hardness threshold of the Lp Grothendieck problem G Kindler, A Naor, G Schechtman Mathematics of Operations Research 35 (2), 267-283, 2010	44	2010
Property testing PCP G Kindler Tel-Aviv University, 2002	41	2002
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	38	2005

Systemet kan ikke utføre handlingen. Prøv på nytt senere.

Artikler 1–20

Sitater per år

Duplikatsitater

Sammenslåtte sitater

Legg til medforfattereMedforfattere

Følg

Sitert av

Medforfattere