Ido Ben-Eliezer

14 papers A* 1Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2013 J jnl
Comparing the strength of query types in property testing: The case of k-colorability.
Comput. Complex.
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
2012 J jnl
Biased orientation games.
Discret. Math.
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012 J jnl
Long cycles in subgraphs of (pseudo)random directed graphs.
J. Graph Theory
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2012 J jnl
Random low-degree polynomials are hard to approximate.
Comput. Complex.
Ido Ben-Eliezer, Rani Hod, Shachar Lovett
2012 J jnl
The size Ramsey number of a directed path.
J. Comb. Theory B
Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov
2011 — —
Extremal problems on graphs and codes
Ido Ben-Eliezer
2010 — ch.
Comparing the Strength of Query Types in Property Testing: The Case of Testing
Property Testing
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
2009 J jnl
Perfectly Balanced Partitions of Smoothed Graphs.
Electron. J. Comb.
Ido Ben-Eliezer, Michael Krivelevich
2009 J jnl
Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness
CoRR
Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin
2009 — conf
Random Low Degree Polynomials are Hard to Approximate.
APPROX-RANDOM
Ido Ben-Eliezer, Rani Hod, Shachar Lovett
2009 J jnl
Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness.
Electron. Colloquium Comput. Complex.
Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin
2008 A* conf
Comparing the strength of query types in property testing: the case of testing
SODA
Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron
2008 J jnl
Random low degree polynomials are hard to approximate.
Electron. Colloquium Comput. Complex.
Ido Ben-Eliezer, Rani Hod, Shachar Lovett
2008 — conf
Small Sample Spaces Cannot Fool Low Degree Polynomials.
APPROX-RANDOM
Noga Alon, Ido Ben-Eliezer, Michael Krivelevich