| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan |
Sparse affine-invariant linear codes are locally testable.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer |
On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer |
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. |
IACR Cryptology ePrint Archive |
2012 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Shachar Lovett, Noga Zewi |
An additive combinatorics approach to the log-rank conjecture in communication complexity. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
On Sums of Locally Testable Affine Invariant Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ariel Gabizon |
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Composition of semi-LTCs by two-wise Tensor Products. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky |
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Shachar Lovett, Noga Zewi |
An additive combinatorics approach to the log-rank conjecture in communication complexity |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jan Johannsen |
Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. |
IJCAI |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
On Sums of Locally Testable Affine Invariant Properties. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Limits on the Rate of Locally Testable Affine-Invariant Codes. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
Symmetric LDPC Codes are not Necessarily Locally Testable. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Towards Lower Bounds on Locally Testable Codes via Density Arguments. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Zewi, Eli Ben-Sasson |
From affine to two-source extractors via approximate duality. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
Symmetric LDPC codes are not necessarily locally testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Limits on the rate of locally testable affine-invariant codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty |
Affine Dispersers from Subspace Polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shir Ben-Israel, Eli Ben-Sasson, David R. Karger |
Breaking local symmetries can dramatically reduce the length of propositional refutations. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Towards lower bounds on locally testable codes via density arguments. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Low Rate Is Insufficient for Local Testability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jan Johannsen |
Lower bounds for width-restricted clause learning on small width formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Noga Zewi |
From Affine to Two-Source Extractors via Approximate Duality. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson |
Limitation on the rate of families of locally testable codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Russell Impagliazzo |
Random Cnf's are Hard for the Polynomial Calculus. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha |
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
Subspace polynomials and limits to list decoding of Reed-Solomon codes. |
IEEE Transactions on Information Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jan Johannsen |
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. |
SAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson |
Limitation on the Rate of Families of Locally Testable Codes. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Low Rate Is Insufficient for Local Testability. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
Sound 3-Query PCPPs Are Long. |
TOCT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
A Space Hierarchy for k-DNF Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Tensor Products of Weakly Smooth Codes are Robust. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Tensor Products of Weakly Smooth Codes are Robust. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Composition of Semi-LTCs by Two-Wise Tensor Products. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty |
Affine dispersers from subspace polynomials. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
randomness, extractors |
| 1 | Eli Ben-Sasson, Madhu Sudan |
Short PCPs with Polylog Query Complexity. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
Sound 3-Query PCPPs Are Long. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Michael Viderman |
Tensor Products of Weakly Smooth Codes Are Robust. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Jakob Nordström |
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish |
Sound 3-query PCPPs are Long. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Mikhail Alekhnovich, Eli Ben-Sasson |
Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust locally testable codes and products of codes. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
Subspace Polynomials and List Decoding of Reed-Solomon Codes. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Adam Tauman Kalai, Ehud Kalai |
An Approach to Bounded Rationality. |
NIPS |
2006 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova |
Some 3CNF Properties Are Hard to Test. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Short PCPs Verifiable in Polylogarithmic Time. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Simple PCPs with poly-log rate and query complexity. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
PCPP, probabilistically checkable proofs, PCP, locally testable codes |
| 1 | Michael Alekhnovich, Eli Ben-Sasson |
Linear Upper Bounds for Random Walk on Small Density Random 3CNFs |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust Locally Testable Codes and Products of Codes |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Simple PCPs with Poly-log Rate and Query Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson |
Near Optimal Separation Of Tree-Like And General Resolution. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03F20, 68Q17 |
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust Locally Testable Codes and Products of Codes |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Pseudorandom Generators in Propositional Proof Complexity. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan |
Robust Locally Testable Codes and Products of Codes. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
Robust pcps of proximity, shorter pcps and applications to coding. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, PCP, locally decodable codes, locally testable codes |
| 1 | Eli Ben-Sasson, Oded Goldreich, Madhu Sudan |
Bounds on 2-Query Codeword Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova |
3CNF Properties are Hard to Test |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Prahladh Harsha |
Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Nicola Galesi |
Space complexity of random formulae in resolution. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Oded Goldreich, Madhu Sudan |
Bounds on 2-Query Codeword Testing. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Alekhnovich, Eli Ben-Sasson |
Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson |
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing |
| 1 | Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova |
Some 3CNF properties are hard to test. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
CNF formulas, lower bounds, property testing, sublinear algorithms, locally testable codes |
| 1 | Eli Ben-Sasson, Yonatan Bilu |
A Gap in Average Proof Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson |
Hard examples for the bounded depth Frege proof system. |
Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03F20 |
| 1 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Space Complexity in Propositional Calculus. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson |
Hard Examples for Bounded Depth Frege. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson |
Hard examples for bounded depth frege. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson |
Size space tradeoffs for resolution. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Avi Wigderson |
Short proofs are narrow - resolution made simple. |
J. ACM |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson |
Near-Optimal Separation of Treelike and General Resolution |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Pseudorandom Generators in Propositional Proof Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Pseudorandom Generators in Propositional Proof Complexity. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
combinatorial pseudorandom generators, Nisan-Wigderson generator, Tseitin tautologies, polynomial calculus with resolution, polynomial calculus, computational complexity, theorem proving, process algebra, resolution, random processes, pseudorandom generators, propositional proof complexity |
| 1 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Space complexity in propositional calculus. |
STOC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Avi Wigderson |
Short Proofs are Narrow - Resolution made Simple |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
Space Complexity in Propositional Calculus |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Russell Impagliazzo |
Random CNF's are Hard for the Polynomial Calculus. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
polynomial calculus, satisfiability, proof complexity |
| 1 | Eli Ben-Sasson, Avi Wigderson |
Short Proofs Are Narrow - Resolution Made Simple (Abstract). (PDF / PS) |
IEEE Conference on Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Avi Wigderson |
Short Proofs are Narrow - Resolution Made Simple. |
STOC |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")