Ido Ben-Eliezer

Publication Activity (10 Years)

Years Active: 2008-2013
Publications (10 Years): 0

Top Topics

Simulation Game

Grow Exponentially

Top Venues

Comput. Complex.

J. Graph Theory

J. Comb. Theory, Ser. B

Publications

Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
Comparing the strength of query types in property testing: The case of k-colorability. Comput. Complex. 22 (1) (2013)
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
The size Ramsey number of a directed path. J. Comb. Theory, Ser. B 102 (3) (2012)
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Long cycles in subgraphs of (pseudo)random directed graphs. J. Graph Theory 70 (3) (2012)
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
Biased orientation games. Discret. Math. 312 (10) (2012)
Ido Ben-Eliezer, Rani Hod, Shachar Lovett
Random low-degree polynomials are hard to approximate. Comput. Complex. 21 (1) (2012)
Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin
Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness CoRR (2009)
Ido Ben-Eliezer, Rani Hod, Shachar Lovett
Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM (2009)
Ido Ben-Eliezer, Michael Krivelevich
Perfectly Balanced Partitions of Smoothed Graphs. Electron. J. Comb. 16 (1) (2009)
Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin
Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. Electron. Colloquium Comput. Complex. 16 (2009)
Ido Ben-Eliezer, Rani Hod, Shachar Lovett
Random low degree polynomials are hard to approximate. Electron. Colloquium Comput. Complex. 15 (080) (2008)
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
-colorability. SODA (2008)
Noga Alon, Ido Ben-Eliezer, Michael Krivelevich
Small Sample Spaces Cannot Fool Low Degree Polynomials. APPROX-RANDOM (2008)