- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| c18 |      | Boaz Barak, Guy Kindler, David Steurer: On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction. ITCS 2013: 197-214 |
| 2012 | ||
| j12 | | Guy Kindler, Anup Rao, Ryan O'Donnell, Avi Wigderson: Spherical cubes: optimal foams from computational hardness amplification. Commun. ACM 55(10): 90-97 (2012) |
| j11 | | Marcus Isaksson, Guy Kindler, Elchanan Mossel: The geometry of manipulation - A quantitative proof of the Gibbard-Satterthwaite theorem. Combinatorica 32(2): 221-250 (2012) |
| c17 | | Guy Kindler, Ryan O'Donnell: Gaussian Noise Sensitivity and Fourier Tails. IEEE Conference on Computational Complexity 2012: 137-147 |
| 2011 | ||
| j10 | | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Computational Complexity 20(3): 413-504 (2011) |
| j9 | | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. Computational Complexity 20(4): 741-753 (2011) |
| 2010 | ||
| j8 | | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. J. ACM 57(4) (2010) |
| j7 | | Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC Hardness Threshold of the Lp Grothendieck Problem. Math. Oper. Res. 35(2): 267-283 (2010) |
| c16 | | Marcus Isaksson, Guy Kindler, Elchanan Mossel: The Geometry of Manipulation: A Quantitative Proof of the Gibbard-Satterthwaite Theorem. FOCS 2010: 319-328 |
| i7 | | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors. Electronic Colloquium on Computational Complexity (ECCC) 17: 37 (2010) |
| 2008 | ||
| j6 | | Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. Algorithmica 50(4): 446-454 (2008) |
| j5 | | Navin Goyal, Guy Kindler, Michael E. Saks: Lower Bounds for the Noisy Broadcast Problem. SIAM J. Comput. 37(6): 1806-1841 (2008) |
| c15 | | Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigderson: Spherical Cubes and Rounding in High Dimensions. FOCS 2008: 189-198 |
| c14 | | Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC hardness threshold of the ℓp Grothendieck problem. SODA 2008: 64-73 |
| 2007 | ||
| j4 | | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell: Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. SIAM J. Comput. 37(1): 319-357 (2007) |
| c13 | | Uriel Feige, Guy Kindler, Ryan O'Donnell: Understanding Parallel Repetition Requires Understanding Foams. IEEE Conference on Computational Complexity 2007: 179-192 |
| i6 | | Uriel Feige, Guy Kindler, Ryan O'Donnell: Understanding Parallel Repetition Requires Understanding Foams. Electronic Colloquium on Computational Complexity (ECCC) 14(043) (2007) |
| 2006 | ||
| c12 | | Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. LATIN 2006: 202-210 |
| c11 | | Irit Dinur, Ehud Friedgut, Guy Kindler, Ryan O'Donnell: On the fourier tails of bounded functions over the discrete cube. STOC 2006: 437-446 |
| 2005 | ||
| c10 | | Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305 |
| c9 | | Navin Goyal, Guy Kindler, Michael E. Saks: Lower Bounds for the Noisy Broadcast Problem. FOCS 2005: 40-52 |
| c8 | | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs. FOCS 2005: 206-215 |
| c7 | | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. FOCS 2005: 216-225 |
| c6 | | Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, Avi Wigderson: Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors. STOC 2005: 1-10 |
| i5 | | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs. Electronic Colloquium on Computational Complexity (ECCC)(058) (2005) |
| i4 | | Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. Electronic Colloquium on Computational Complexity (ECCC)(061) (2005) |
| i3 | | Guy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel: Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? Electronic Colloquium on Computational Complexity (ECCC)(101) (2005) |
| 2004 | ||
| j3 | | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004) |
| j2 | | Guy Kindler, Dan Romik: On Distributions Computable by Random Walks on Graphs. SIAM J. Discrete Math. 17(4): 624-633 (2004) |
| c5 | | Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell: Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? FOCS 2004: 146-154 |
| c4 | | |
| 2003 | ||
| j1 | | Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra: Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Combinatorica 23(2): 205-243 (2003) |
| 2002 | ||
| c3 | | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing Juntas. FOCS 2002: 103-112 |
| 1999 | ||
| c2 | | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC 1999: 29-40 |
| 1998 | ||
| c1 | | Irit Dinur, Guy Kindler, Shmuel Safra: Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. FOCS 1998: 99-111 |
| i2 | | Irit Dinur, Guy Kindler, Shmuel Safra: Approximating CVP to Within Almost Polynomial Factor is NP-Hard. Electronic Colloquium on Computational Complexity (ECCC) 5(48) (1998) |
| i1 | | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra: PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. Electronic Colloquium on Computational Complexity (ECCC) 5(66) (1998) |
Data released under the ODC-BY 1.0 license — See also our legal information page