Eran Ofek - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2025

Confidence Improves Self-Consistency in LLMsAmir Taubenfeld, Tom Sheffer, Eran Ofek, Amir Feder, Ariel Goldstein, Zorik Gekhman, Gal Yona. acl 2025: 20090-20111 [doi]

2023

What You See is What You Read? Improving Text-Image Alignment EvaluationMichal Yarom, Yonatan Bitton, Soravit Changpinyo, Roee Aharoni, Jonathan Herzig, Oran Lang, Eran Ofek, Idan Szpektor. nips 2023: [doi]

2020

Dynamic Composition for Conversational Domain ExplorationIdan Szpektor, Deborah Cohen, Gal Elidan, Michael Fink, Avinatan Hassidim, Orgad Keller, Sayali Kulkarni, Eran Ofek, Sagie Pudinsky, Asaf Revach, Shimi Salant, Yossi Matias. WWW 2020: 872-883 [doi]

2011

Geodesics and almost geodesic cycles in random regular graphsItai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald. jgt, 66(2):115-136, 2011. [doi]

2008

Routing complexity of faulty networksOmer Angel, Itai Benjamini, Eran Ofek, Udi Wieder. rsa, 32(1):71-87, 2008. [doi]

Finding a Maximum Independent Set in a Sparse Random GraphUriel Feige, Eran Ofek. siamdm, 22(2):693-718, 2008. [doi]

2007

Easily refutable subformulas of large random 3CNF formulasUriel Feige, Eran Ofek. toc, 3(1):25-43, 2007. [doi]

On the Expansion of the Giant Component in Percolated (n, d, lambda) GraphsEran Ofek. cpc, 16(3):445-457, 2007. [doi]

2006

Witnesses for non-satisfiability of dense random 3CNF formulasUriel Feige, Jeong Han Kim, Eran Ofek. focs 2006: 497-508 [doi]

Random 3CNF formulas elude the Lovasz theta functionEran Ofek, Uriel Feige. eccc, 13(043), 2006. [doi]

2005

2004

Easily Refutable Subformulas of Large Random 3CNF FormulasUriel Feige, Eran Ofek. icalp 2004: 519-530 [doi]

2002

Approximating Maximum Edge Coloring in MultigraphsUriel Feige, Eran Ofek, Udi Wieder. approx 2002: 108-121 [doi]

Sign in or sign up to see more results.

runs on WebDSL