default search action
Eran Ofek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c7]Michal Yarom, Yonatan Bitton, Soravit Changpinyo, Roee Aharoni, Jonathan Herzig, Oran Lang, Eran Ofek, Idan Szpektor:
What You See is What You Read? Improving Text-Image Alignment Evaluation. NeurIPS 2023 - [i5]Michal Yarom, Yonatan Bitton, Soravit Changpinyo, Roee Aharoni, Jonathan Herzig, Oran Lang, Eran Ofek, Idan Szpektor:
What You See is What You Read? Improving Text-Image Alignment Evaluation. CoRR abs/2305.10400 (2023) - 2020
- [c6]Idan Szpektor, Deborah Cohen, Gal Elidan, Michael Fink, Avinatan Hassidim, Orgad Keller, Sayali Kulkarni, Eran Ofek, Sagie Pudinsky, Asaf Revach, Shimi Salant, Yossi Matias:
Dynamic Composition for Conversational Domain Exploration. WWW 2020: 872-883
2010 – 2019
- 2011
- [j6]Itai Benjamini, Carlos Hoppen
, Eran Ofek, Pawel Pralat, Nicholas C. Wormald:
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66(2): 115-136 (2011)
2000 – 2009
- 2008
- [j5]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008) - [j4]Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. SIAM J. Discret. Math. 22(2): 693-718 (2008) - 2007
- [j3]Eran Ofek:
On the Expansion of the Giant Component in Percolated (n, d, lambda) Graphs. Comb. Probab. Comput. 16(3): 445-457 (2007) - [j2]Uriel Feige, Eran Ofek:
Easily refutable subformulas of large random 3CNF formulas. Theory Comput. 3(1): 25-43 (2007) - 2006
- [c5]Uriel Feige, Jeong Han Kim, Eran Ofek:
Witnesses for non-satisfiability of dense random 3CNF formulas. FOCS 2006: 497-508 - [i4]Uriel Feige, Eran Ofek:
Random 3CNF formulas elude the Lovasz theta function. CoRR abs/cs/0603084 (2006) - [i3]Eran Ofek, Uriel Feige:
Random 3CNF formulas elude the Lovasz theta function. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Uriel Feige, Eran Ofek:
Spectral techniques applied to sparse random graphs. Random Struct. Algorithms 27(2): 251-275 (2005) - [c4]Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. APPROX-RANDOM 2005: 282-293 - [c3]Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder:
Routing complexity of faulty networks. PODC 2005: 209-217 - [i2]Uriel Feige, Eran Ofek:
Finding a Maximum Independent Set in a Sparse Random Graph. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Eran Ofek:
On the expansion of the giant component in percolated (n,d,lambda) graphs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c2]Uriel Feige, Eran Ofek:
Easily Refutable Subformulas of Large Random 3CNF Formulas. ICALP 2004: 519-530 - 2002
- [c1]Uriel Feige, Eran Ofek, Udi Wieder:
Approximating Maximum Edge Coloring in Multigraphs. APPROX 2002: 108-121
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-04-25 05:42 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: