Small Sample Spaces Cannot Fool Low Degree Polynomials. - Noga Alon; Ido Ben-Eliezer; Michael Krivelevich (APPROX-RANDOM, 2008)

Comparing the strength of query types in property testing: the case of testing k-colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (SODA, 2008)

Perfectly Balanced Partitions of Smoothed Graphs. - Ido Ben-Eliezer; Michael Krivelevich (Electron. J. Comb., 2009)

Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness - Ido Ben-Eliezer; Shachar Lovett; Ariel Yadin (CoRR, 2009)

Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. - Shachar Lovett; Ido Ben-Eliezer; Ariel Yadin (Electron. Colloquium Comput. Complex., 2009)

Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (Property Testing, 2010)

Extremal problems on graphs and codes - Ido Ben-Eliezer (2011)

Random low-degree polynomials are hard to approximate. - Ido Ben-Eliezer; Rani Hod; Shachar Lovett (Comput. Complex., 2012)

Biased orientation games. - Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov (Discret. Math., 2012)

The size Ramsey number of a directed path. - Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov (J. Comb. Theory B, 2012)

Long cycles in subgraphs of (pseudo)random directed graphs. - Ido Ben-Eliezer; Michael Krivelevich; Benny Sudakov (J. Graph Theory, 2012)

Comparing the strength of query types in property testing: The case of k-colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (Comput. Complex., 2013)