Guy Kindler

2008
27	EE	Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigderson: Spherical Cubes and Rounding in High Dimensions. FOCS 2008: 189-198
26	EE	Guy Kindler, Assaf Naor, Gideon Schechtman: The UGC hardness threshold of the ℓp Grothendieck problem. SODA 2008: 64-73
25	EE	Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. Algorithmica 50(4): 446-454 (2008)
24	EE	Navin Goyal, Guy Kindler, Michael E. Saks: Lower Bounds for the Noisy Broadcast Problem. SIAM J. Comput. 37(6): 1806-1841 (2008)
2007
23	EE	Uriel Feige, Guy Kindler, Ryan O'Donnell: Understanding Parallel Repetition Requires Understanding Foams. IEEE Conference on Computational Complexity 2007: 179-192
22	EE	Uriel Feige, Guy Kindler, Ryan O'Donnell: Understanding Parallel Repetition Requires Understanding Foams. Electronic Colloquium on Computational Complexity (ECCC) 14(043): (2007)
21	EE	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)
2006
20	EE	Béla Bollobás, Guy Kindler, Imre Leader, Ryan O'Donnell: Eliminating Cycles in the Discrete Torus. LATIN 2006: 202-210
19	EE	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
18	EE	Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305
17	EE	Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs. FOCS 2005: 206-215
16	EE	Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. FOCS 2005: 216-225
15	EE	Navin Goyal, Guy Kindler, Michael E. Saks: Lower Bounds for the Noisy Broadcast Problem. FOCS 2005: 40-52
14	EE	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
13	EE	Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra: On Non-Approximability for Quadratic Programs Electronic Colloquium on Computational Complexity (ECCC)(058): (2005)
12	EE	Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers Electronic Colloquium on Computational Complexity (ECCC)(061): (2005)
11	EE	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
10	EE	Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell: Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? FOCS 2004: 146-154
9	EE	Guy Kindler, Dan Romik: On distributions computable by random walks on graphs. SODA 2004: 131-138
8	EE	Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004)
7	EE	Guy Kindler, Dan Romik: On Distributions Computable by Random Walks on Graphs. SIAM J. Discrete Math. 17(4): 624-633 (2004)
2003
6	EE	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
5	EE	Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing Juntas. FOCS 2002: 103-112
1999
4	EE	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
3	EE	Irit Dinur, Guy Kindler, Shmuel Safra: Approximating-CVP to Within Almost-Polynomial Factors is NP-Hard. FOCS 1998: 99-111
2	EE	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)
1	EE	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)

Coauthor Index

1	Mikhail Alekhnovich	[16]
2	Sanjeev Arora	[13] [17]
3	Boaz Barak	[14]
4	Eli Berger	[13] [17]
5	Béla Bollobás	[20] [25]
6	Irit Dinur	[1] [2] [3] [4] [6] [19]
7	Uriel Feige	[22] [23]
8	Eldar Fischer	[1] [4] [5] [8]
9	Ehud Friedgut	[19]
10	Navin Goyal	[15] [24]
11	Ronen Gradwohl	[12] [18]
12	Elad Hazan	[13] [17]
13	Subhash Khot	[10] [11] [16] [21]
14	Imre Leader	[20] [25]
15	Elchanan Mossel	[10] [11] [21]
16	Assaf Naor	[26]
17	Ryan O'Donnell	[10] [11] [19] [20] [21] [22] [23] [25] [27]
18	Anup Rao	[27]
19	Ran Raz	[1] [4] [6]
20	Omer Reingold	[12] [18]
21	Dan Romik	[7] [9]
22	Dana Ron	[5] [8]
23	Muli Safra	[13] [17]
24	Shmuel Safra	[1] [2] [3] [4] [5] [6] [8]
25	Michael E. Saks	[15] [24]
26	Alex Samorodnitsky	[5] [8]
27	Gideon Schechtman	[26]
28	Ronen Shaltiel	[14]
29	Benny Sudakov	[14]
30	Amnon Ta-Shma	[12] [18]
31	Nisheeth K. Vishnoi	[16]
32	Avi Wigderson	[14] [27]

Colors in the list of coauthors