 | 2012 |
|---|
| 11 |       | Ido Ben-Eliezer,
Rani Hod,
Shachar Lovett:
Random low-degree polynomials are hard to approximate.
Computational Complexity 21(1): 63-81 (2012) |
| 10 | | Ido Ben-Eliezer,
Michael Krivelevich,
Benny Sudakov:
Biased orientation games.
Discrete Mathematics 312(10): 1732-1742 (2012) |
| 9 | | Ido Ben-Eliezer,
Michael Krivelevich,
Benny Sudakov:
The size Ramsey number of a directed path.
J. Comb. Theory, Ser. B 102(3): 743-755 (2012) |
| 2010 |
|---|
| 8 | | Ido Ben-Eliezer,
Tali Kaufman,
Michael Krivelevich,
Dana Ron:
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability.
Property Testing 2010: 253-259 |
| 2009 |
|---|
| 7 | | Ido Ben-Eliezer,
Rani Hod,
Shachar Lovett:
Random Low Degree Polynomials are Hard to Approximate.
APPROX-RANDOM 2009: 366-377 |
| 6 | | Ido Ben-Eliezer,
Shachar Lovett,
Ariel Yadin:
Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness
CoRR abs/0911.3473: (2009) |
| 5 | | Ido Ben-Eliezer,
Michael Krivelevich:
Perfectly Balanced Partitions of Smoothed Graphs.
Electr. J. Comb. 16(1): (2009) |
| 4 | | Shachar Lovett,
Ido Ben-Eliezer,
Ariel Yadin:
Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness.
Electronic Colloquium on Computational Complexity (ECCC) 16: 118 (2009) |
| 2008 |
|---|
| 3 | | Noga Alon,
Ido Ben-Eliezer,
Michael Krivelevich:
Small Sample Spaces Cannot Fool Low Degree Polynomials.
APPROX-RANDOM 2008: 266-275 |
| 2 | | 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 | | Ido Ben-Eliezer,
Rani Hod,
Shachar Lovett:
Random low degree polynomials are hard to approximate.
Electronic Colloquium on Computational Complexity (ECCC) 15(080): (2008) |
Data released under the ODC-BY 1.0 license — See also our legal information page