default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIdo Ben-Eliezer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j6]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): 89-135 (2013)- 2012
- [j5]Ido Ben-Eliezer, Rani Hod, Shachar Lovett:
Random low-degree polynomials are hard to approximate. Comput. Complex. 21(1): 63-81 (2012) - [j4]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Biased orientation games. Discret. Math. 312(10): 1732-1742 (2012) - [j3]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
The size Ramsey number of a directed path. J. Comb. Theory B 102(3): 743-755 (2012) - [j2]Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Long cycles in subgraphs of (pseudo)random directed graphs. J. Graph Theory 70(3): 284-296 (2012) - 2011
- [b1]Ido Ben-Eliezer:
Extremal problems on graphs and codes. Tel Aviv University, Israel, 2011 - 2010
- [p1]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
2000 – 2009
- 2009
- [j1]Ido Ben-Eliezer, Michael Krivelevich:
Perfectly Balanced Partitions of Smoothed Graphs. Electron. J. Comb. 16(1) (2009) - [c3]Ido Ben-Eliezer, Rani Hod, Shachar Lovett:
Random Low Degree Polynomials are Hard to Approximate. APPROX-RANDOM 2009: 366-377 - [i3]Ido Ben-Eliezer, Shachar Lovett, Ariel Yadin:
Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. CoRR abs/0911.3473 (2009) - [i2]Shachar Lovett, Ido Ben-Eliezer, Ariel Yadin:
Title: Polynomial Threshold Functions: Structure, Approximation and Pseudorandomness. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c2]Noga Alon, Ido Ben-Eliezer, Michael Krivelevich:
Small Sample Spaces Cannot Fool Low Degree Polynomials. APPROX-RANDOM 2008: 266-275 - [c1]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 - [i1]Ido Ben-Eliezer, Rani Hod, Shachar Lovett:
Random low degree polynomials are hard to approximate. Electron. Colloquium Comput. Complex. TR08 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
