Travelled to:1 × Canada
1 × Denmark
1 × Iceland
1 × United Kingdom
8 × USA
Collaborated with:A.Wigderson ∅ M.Sudan P.Harsha S.Kopparty E.Viola N.Zewi J.Johannsen S.P.Vadhan S.Raskhodnikova N.Ron-Zewi M.Tulsiani J.Wolf A.Chiesa D.Genkin E.Tromer O.Lachish A.Matsliah M.Alekhnovich A.A.Razborov A.Gabizon Y.Kaplan S.Saraf O.Goldreich
Talks about:pcps (5) short (3) queri (3) proof (3) code (3) resolut (2) complex (2) effici (2) applic (2) width (2)
Person: Eli Ben-Sasson
DBLP: Ben-Sasson:Eli
Contributed to:
2014
20132011
201020092008200520042003200220001999Wrote 16 papers:
- ICALP-v1-2014-Ben-SassonRTW #algorithm #proving
- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications (EBS, NRZ, MT, JW), pp. 955–966.
- ICALP-v1-2014-Ben-SassonV #query
- Short PCPs with Projection Queries (EBS, EV), pp. 163–173.
- STOC-2013-Ben-SassonCGT #on the #performance #proving
- On the concrete efficiency of probabilistically-checkable proofs (EBS, AC, DG, ET), pp. 585–594.
- STOC-2013-Ben-SassonGKKS #algebra #geometry #product line
- A new family of locally correctable codes based on degree-lifted algebraic geometry codes (EBS, AG, YK, SK, SS), pp. 833–842.
- STOC-2011-ZewiB #approximate
- From affine to two-source extractors via approximate duality (NZ, EBS), pp. 177–186.
- SAT-2010-Ben-SassonJ #bound #learning #strict
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.
- STOC-2009-Ben-SassonK
- Affine dispersers from subspace polynomials (EBS, SK), pp. 65–74.
- ICALP-A-2008-Ben-SassonHLM
- Sound 3-Query PCPPs Are Long (EBS, PH, OL, AM), pp. 686–697.
- STOC-2005-Ben-SassonS #complexity #query
- Simple PCPs with poly-log rate and query complexity (EBS, MS), pp. 266–275.
- STOC-2004-Ben-SassonGHSV #proximity #robust
- Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
- STOC-2003-Ben-SassonHR
- Some 3CNF properties are hard to test (EBS, PH, SR), pp. 345–354.
- STOC-2003-Ben-SassonSVW #testing
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.
- STOC-2002-Ben-Sasson #trade-off
- Size space tradeoffs for resolution (EBS), pp. 457–464.
- STOC-2002-Ben-Sasson02a #bound
- Hard examples for bounded depth frege (EBS), pp. 563–572.
- STOC-2000-AlekhnovichBRW #calculus #complexity
- Space complexity in propositional calculus (MA, EBS, AAR, AW), pp. 358–367.
- STOC-1999-Ben-SassonW #proving
- Short Proofs are Narrow — Resolution Made Simple (EBS, AW), pp. 517–526.