| |
| * | 2009 | |
|---|---|---|
| 4 | EE | Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM 2009: 366-377 |
| 2008 | ||
| 3 | EE | Noga Alon, Ido Ben-Eliezer, Michael Krivelevich: Small Sample Spaces Cannot Fool Low Degree Polynomials. APPROX-RANDOM 2008: 266-275 |
| 2 | EE | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron: Comparing the strength of query types in property testing: the case of testing k-colorability. SODA 2008: 1213-1222 |
| 1 | EE | Ido Ben-Eliezer, Rani Hod, Shachar Lovett: Random low degree polynomials are hard to approximate. Electronic Colloquium on Computational Complexity (ECCC) 15(080): (2008) |
| 1 | Noga Alon | [3] |
| 2 | Rani Hod | [1] [4] |
| 3 | Tali Kaufman | [2] |
| 4 | Michael Krivelevich | [2] [3] |
| 5 | Shachar Lovett | [1] [4] |
| 6 | Dana Ron | [2] |