Ido Ben-Eliezer

According to our database, Ido Ben-Eliezer authored at least 12 papers between 2008 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2013

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

2012

Long cycles in subgraphs of (pseudo)random directed graphs.

Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov

J. Graph Theory, 2012

The size Ramsey number of a directed path.

Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov

J. Comb. Theory, Ser. B, 2012

Biased orientation games.

Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov

Discret. Math., 2012

Random low-degree polynomials are hard to approximate.

Ido Ben-Eliezer, Rani Hod, Shachar Lovett

Comput. Complex., 2012

2011

Extremal problems on graphs and codes

Ido Ben-Eliezer

PhD thesis, 2011

2010

Comparing the Strength of Query Types in Property Testing: The Case of Testing <i>k</i>-Colorability.

Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron

Proceedings of the Property Testing - Current Research and Surveys, 2010

2009

Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness.

Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin

Electron. Colloquium Comput. Complex., 2009

Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness

Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin

CoRR, 2009

Perfectly Balanced Partitions of Smoothed Graphs.

Ido Ben-Eliezer, Michael Krivelevich

Electron. J. Comb., 2009

2008

Comparing the strength of query types in property testing: the case of testing <i>k</i>-colorability.

Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Small Sample Spaces Cannot Fool Low Degree Polynomials.

Noga Alon, Ido Ben-Eliezer, Michael Krivelevich

Proceedings of the Approximation, 2008