Eli Ben-Sasson

190 papers A* 31A 14B 1Journal 117Unranked 25

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	On Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Ulrich Haböck, Swastik Kopparty, Shubhangi Saraf
2025	J	`jnl`	On Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Dan Carmon, Ulrich Haböck, Swastik Kopparty, Shubhangi Saraf
2023	J	`jnl`	Early childhood tracking application: Correspondence between crowd-based developmental percentiles and clinical tools. Health Informatics J. Ayelet Ben-Sasson, Kayla Jacobs, Eli Ben-Sasson
2023	A*	`conf`	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time SODA Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2023	J	`jnl`	Proximity Gaps for Reed-Solomon Codes. J. ACM Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2022	J	`jnl`	Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2022	—	`conf`	Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). TCC (1) Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2022	J	`jnl`	Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2021	J	`jnl`	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. CoRR Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2021	J	`jnl`	Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
2020	A	`conf`	DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2020	J	`jnl`	Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols. IACR Trans. Symmetric Cryptol. Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec
2020	A*	`conf`	Proximity Gaps for Reed-Solomon Codes. FOCS Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2020	J	`jnl`	Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2020	J	`jnl`	Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
2020	J	`jnl`	STARK Friendly Hash - Survey and Recommendation. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Lior Goldberg, David Levit
2019	—	`conf`	Aurora: Transparent Succinct Arguments for R1CS. EUROCRYPT (1) Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward
2019	J	`jnl`	DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019	J	`jnl`	DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019	J	`jnl`	DEEP-FRI: Sampling outside the box improves soundness. CoRR Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
2019	J	`jnl`	Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution). IACR Cryptol. ePrint Arch. Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec
2019	A*	`conf`	Evaluating Expert Curation in a Baby Milestone Tracking App. CHI Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Elisheva Rotman Argaman, Eden Saig
2019	—	`conf`	Linear-Size Constant-Query IOPs for Delegating Computation. TCC (2) Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner
2019	J	`jnl`	Linear-Size Constant-Query IOPs for Delegating Computation. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner
2019	—	`conf`	Scalable Zero Knowledge with No Trusted Setup. CRYPTO (3) Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
2019	A	`conf`	The Complexity of User Retention. ITCS Eli Ben-Sasson, Eden Saig
2018	J	`jnl`	Aurora: Transparent Succinct Arguments for R1CS. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward
2018	A*	`conf`	Brief Announcement: Towards an Abstract Model of User Retention Dynamics. ICALP Eli Ben-Sasson, Eden Saig
2018	A*	`conf`	Fast Reed-Solomon Interactive Oracle Proofs of Proximity. ICALP Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
2018	J	`jnl`	Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
2018	A	`conf`	Worst-Case to Average Case Reductions for the Distance to a Code. CCC Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
2018	J	`jnl`	Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
2017	—	`conf`	Baby CROINC: an online, crowd-based, expert-curated system for monitoring child development. PervasiveHealth Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Eden Saig
2017	J	`jnl`	Collaborative Discovery: A study of Guru-follower dynamics. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Eden Saig
2017	—	`conf`	Computational Integrity with a Public Random String from Quasi-Linear PCPs. EUROCRYPT (3) Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza
2017	J	`jnl`	Fast Reed-Solomon Interactive Oracle Proofs of Proximity. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
2017	A*	`conf`	Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2017	J	`jnl`	Scalable Zero Knowledge Via Cycles of Elliptic Curves. Algorithmica Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
2017	J	`jnl`	Sparse affine-invariant linear codes are locally testable. Comput. Complex. Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
2017	—	`conf`	Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2016	J	`jnl`	A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms Eli Ben-Sasson, Michael Viderman
2016	J	`jnl`	A security analysis of Probabilistically Checkable Proofs. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev
2016	J	`jnl`	Computational integrity with a public random string from quasi-linear PCPs. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza
2016	J	`jnl`	Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2016	A	`conf`	Fast Multiplication in Binary Fields on GPUs via Register Cache. ICS Eli Ben-Sasson, Matan Hamilis, Mark Silberstein, Eran Tromer
2016	J	`jnl`	Improved concrete efficiency and security analysis of Reed-Solomon PCPPs. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev
2016	—	`conf`	Interactive Oracle Proofs. TCC (B2) Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner
2016	J	`jnl`	Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner
2016	J	`jnl`	On Probabilistic Checking in Perfect Zero Knowledge. CoRR Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2016	J	`jnl`	On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2016	J	`jnl`	On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2016	—	`conf`	On Public Key Encryption from Noisy Codewords. Public Key Cryptography (2) Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
2016	—	`conf`	Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. TCC (A2) Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza
2016	J	`jnl`	Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza
2016	J	`jnl`	Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza
2016	J	`jnl`	Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2016	J	`jnl`	Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
2016	J	`jnl`	Subspace Polynomials and Cyclic Subspace Codes. IEEE Trans. Inf. Theory Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv
2015	J	`jnl`	Composition of semi-LTCs by two-wise tensor products. Comput. Complex. Eli Ben-Sasson, Michael Viderman
2015	J	`jnl`	From Affine to Two-Source Extractors via Approximate Duality. SIAM J. Comput. Eli Ben-Sasson, Noga Ron-Zewi
2015	J	`jnl`	Lower bound for communication complexity with no public randomness. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Gal Maor
2015	J	`jnl`	On Public Key Encryption from Noisy Codewords. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi
2015	J	`jnl`	On Public Key Encryption from Noisy Codewords. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
2015	J	`jnl`	On the information leakage of public-output protocols. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Gal Maor
2015	A*	`conf`	Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs. IEEE Symposium on Security and Privacy Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza
2015	B	`conf`	Subspace polynomials and cyclic subspace codes. ISIT Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv
2014	J	`jnl`	An Additive Combinatorics Approach Relating Rank to Communication Complexity. J. ACM Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
2014	—	`conf`	Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. ICALP (1) Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
2014	—	`conf`	Scalable Zero Knowledge via Cycles of Elliptic Curves. CRYPTO (2) Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
2014	J	`jnl`	Scalable Zero Knowledge via Cycles of Elliptic Curves. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
2014	—	`conf`	Short PCPs with Projection Queries. ICALP (1) Eli Ben-Sasson, Emanuele Viola
2014	J	`jnl`	Short PCPs with projection queries. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Emanuele Viola
2014	J	`jnl`	Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011). SIAM J. Comput. Eli Ben-Sasson, Rafail Ostrovsky
2014	J	`jnl`	Subspace Polynomials and Cyclic Subspace Codes. CoRR Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv
2014	A*	`conf`	Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. USENIX Security Symposium Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
2014	A*	`conf`	Zerocash: Decentralized Anonymous Payments from Bitcoin. IEEE Symposium on Security and Privacy Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza
2014	J	`jnl`	Zerocash: Decentralized Anonymous Payments from Bitcoin. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza
2013	A*	`conf`	A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
2013	A*	`conf`	Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2013	J	`jnl`	Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
2013	J	`jnl`	Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic. Theory Comput. Eli Ben-Sasson, Ariel Gabizon
2013	A	`conf`	Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. ITCS Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
2013	A*	`conf`	On the concrete efficiency of probabilistically-checkable proofs. STOC Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
2013	—	`conf`	SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. CRYPTO (2) Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza
2013	J	`jnl`	SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza
2013	J	`jnl`	Succinct Non-Interactive Arguments for a von Neumann Architecture. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
2012	J	`jnl`	A Combinatorial Characterization of smooth LTCs and Applications. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2012	J	`jnl`	A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
2012	J	`jnl`	Affine Dispersers from Subspace Polynomials. SIAM J. Comput. Eli Ben-Sasson, Swastik Kopparty
2012	A*	`conf`	An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
2012	—	`conf`	Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. APPROX-RANDOM Eli Ben-Sasson, Ariel Gabizon
2012	J	`jnl`	Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
2012	A*	`conf`	Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. CRYPTO Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
2012	J	`jnl`	On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
2012	J	`jnl`	Sampling-based proofs of almost-periodicity results and algorithmic applications CoRR Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
2012	J	`jnl`	Sampling-based proofs of almost-periodicity results and algorithmic applications. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
2012	A*	`conf`	Sparse Affine-Invariant Linear Codes Are Locally Testable. FOCS Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
2012	J	`jnl`	Sparse affine-invariant linear codes are locally testable. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
2012	J	`jnl`	Towards lower bounds on locally testable codes via density arguments. Comput. Complex. Eli Ben-Sasson, Michael Viderman
2011	J	`jnl`	An additive combinatorics approach to the log-rank conjecture in communication complexity CoRR Eli Ben-Sasson, Shachar Lovett, Noga Zewi
2011	J	`jnl`	An additive combinatorics approach to the log-rank conjecture in communication complexity. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Shachar Lovett, Noga Zewi
2011	J	`jnl`	Composition of semi-LTCs by two-wise Tensor Products. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2011	J	`jnl`	Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Ariel Gabizon
2011	A*	`conf`	From affine to two-source extractors via approximate duality. STOC Noga Zewi, Eli Ben-Sasson
2011	—	`conf`	Limits on the Rate of Locally Testable Affine-Invariant Codes. APPROX-RANDOM Eli Ben-Sasson, Madhu Sudan
2011	A*	`conf`	Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. IJCAI Eli Ben-Sasson, Jan Johannsen
2011	J	`jnl`	Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. IACR Cryptol. ePrint Arch. Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
2011	—	`conf`	On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan
2011	J	`jnl`	On Sums of Locally Testable Affine Invariant Properties. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan
2011	A	`conf`	Symmetric LDPC Codes are not Necessarily Locally Testable. CCC Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan
2011	A	`conf`	Towards Lower Bounds on Locally Testable Codes via Density Arguments. CCC Eli Ben-Sasson, Michael Viderman
2011	A	`conf`	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. ICS Eli Ben-Sasson, Jakob Nordström
2010	J	`jnl`	Affine Dispersers from Subspace Polynomials. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Swastik Kopparty
2010	J	`jnl`	Breaking local symmetries can dramatically reduce the length of propositional refutations. Electron. Colloquium Comput. Complex. Shir Ben-Israel, Eli Ben-Sasson, David R. Karger
2010	J	`jnl`	From Affine to Two-Source Extractors via Approximate Duality. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Noga Zewi
2010	—	`ch.`	Limitation on the Rate of Families of Locally Testable Codes. Property Testing Eli Ben-Sasson
2010	J	`jnl`	Limitation on the rate of families of locally testable codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson
2010	J	`jnl`	Limits on the rate of locally testable affine-invariant codes. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Madhu Sudan
2010	J	`jnl`	Locally Testable Codes Require Redundant Testers. SIAM J. Comput. Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
2010	—	`conf`	Low Rate Is Insufficient for Local Testability. APPROX-RANDOM Eli Ben-Sasson, Michael Viderman
2010	J	`jnl`	Low Rate Is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2010	A	`conf`	Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. SAT Eli Ben-Sasson, Jan Johannsen
2010	J	`jnl`	Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. ACM Trans. Comput. Log. Eli Ben-Sasson, Prahladh Harsha
2010	J	`jnl`	Lower bounds for width-restricted clause learning on small width formulas. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jan Johannsen
2010	J	`jnl`	Random Cnf's are Hard for the Polynomial Calculus. Comput. Complex. Eli Ben-Sasson, Russell Impagliazzo
2010	J	`jnl`	Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2010	J	`jnl`	Symmetric LDPC codes are not necessarily locally testable. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan
2010	J	`jnl`	Towards lower bounds on locally testable codes via density arguments. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2010	J	`jnl`	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions CoRR Eli Ben-Sasson, Jakob Nordström
2010	J	`jnl`	Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2009	J	`jnl`	A Space Hierarchy for k-DNF Resolution. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2009	A*	`conf`	Affine dispersers from subspace polynomials. STOC Eli Ben-Sasson, Swastik Kopparty
2009	—	`conf`	Composition of Semi-LTCs by Two-Wise Tensor Products. APPROX-RANDOM Eli Ben-Sasson, Michael Viderman
2009	A	`conf`	Locally Testable Codes Require Redundant Testers. CCC Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
2009	J	`jnl`	Locally Testable Codes Require Redundant Testers. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman
2009	J	`jnl`	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2009	J	`jnl`	Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
2009	J	`jnl`	Tensor Products of Weakly Smooth Codes are Robust. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Michael Viderman
2009	J	`jnl`	Tensor Products of Weakly Smooth Codes are Robust. Theory Comput. Eli Ben-Sasson, Michael Viderman
2009	J	`jnl`	Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Jakob Nordström
2008	J	`jnl`	Short PCPs with Polylog Query Complexity. SIAM J. Comput. Eli Ben-Sasson, Madhu Sudan
2008	A*	`conf`	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. FOCS Eli Ben-Sasson, Jakob Nordström
2008	—	`conf`	Sound 3-Query PCPPs Are Long. ICALP (1) Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah
2008	—	`conf`	Tensor Products of Weakly Smooth Codes Are Robust. APPROX-RANDOM Eli Ben-Sasson, Michael Viderman
2008	—	`conf`	Understanding space in resolution: optimal lower bounds and exponential trade-offs. Computational Complexity of Discrete Problems Eli Ben-Sasson, Jakob Nordström
2007	J	`jnl`	Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. SIAM J. Comput. Mikhail Alekhnovich, Eli Ben-Sasson
2007	J	`jnl`	Sound 3-query PCPPs are Long. Electron. Colloquium Comput. Complex. Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish
2006	—	`conf`	An Approach to Bounded Rationality. NIPS Eli Ben-Sasson, Adam Tauman Kalai, Ehud Kalai
2006	J	`jnl`	Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. SIAM J. Comput. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2006	J	`jnl`	Robust locally testable codes and products of codes. Random Struct. Algorithms Eli Ben-Sasson, Madhu Sudan
2006	A*	`conf`	Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
2005	A	`conf`	Short PCPs Verifiable in Polylogarithmic Time. CCC Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2005	A*	`conf`	Simple PCPs with poly-log rate and query complexity. STOC Eli Ben-Sasson, Madhu Sudan
2005	J	`jnl`	Some 3CNF Properties Are Hard to Test. SIAM J. Comput. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
2004	J	`jnl`	Linear Upper Bounds for Random Walk on Small Density Random 3CNFs Electron. Colloquium Comput. Complex. Michael Alekhnovich, Eli Ben-Sasson
2004	J	`jnl`	Near Optimal Separation Of Tree-Like And General Resolution. Comb. Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
2004	J	`jnl`	Pseudorandom Generators in Propositional Proof Complexity. SIAM J. Comput. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
2004	J	`jnl`	Robust Locally Testable Codes and Products of Codes CoRR Eli Ben-Sasson, Madhu Sudan
2004	J	`jnl`	Robust Locally Testable Codes and Products of Codes Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Madhu Sudan
2004	—	`conf`	Robust Locally Testable Codes and Products of Codes. APPROX-RANDOM Eli Ben-Sasson, Madhu Sudan
2004	J	`jnl`	Robust PCPs of Proximity, Shorter PCPs and Applications to Coding Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2004	A*	`conf`	Robust pcps of proximity, shorter pcps and applications to coding. STOC Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
2004	J	`jnl`	Simple PCPs with Poly-log Rate and Query Complexity Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Madhu Sudan
2003	J	`jnl`	3CNF Properties are Hard to Test Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
2003	—	`conf`	Bounds on 2-Query Codeword Testing. RANDOM-APPROX Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
2003	J	`jnl`	Bounds on 2-Query Codeword Testing. Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
2003	A*	`conf`	Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. FOCS Michael Alekhnovich, Eli Ben-Sasson
2003	J	`jnl`	Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Prahladh Harsha
2003	A*	`conf`	Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. STOC Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
2003	A*	`conf`	Some 3CNF properties are hard to test. STOC Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
2003	J	`jnl`	Space complexity of random formulae in resolution. Random Struct. Algorithms Eli Ben-Sasson, Nicola Galesi
2002	J	`jnl`	A Gap in Average Proof Complexity Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Yonatan Bilu
2002	A	`conf`	Hard Examples for Bounded Depth Frege. CCC Eli Ben-Sasson
2002	A*	`conf`	Hard examples for bounded depth frege. STOC Eli Ben-Sasson
2002	J	`jnl`	Hard examples for the bounded depth Frege proof system. Comput. Complex. Eli Ben-Sasson
2002	A*	`conf`	Size space tradeoffs for resolution. STOC Eli Ben-Sasson
2002	J	`jnl`	Space Complexity in Propositional Calculus. SIAM J. Comput. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
2001	—	`—`	Expansion in proof complexity. (הרחבה ומורכבות הוכחות.). Eli Ben-Sasson
2001	J	`jnl`	Short proofs are narrow - resolution made simple. J. ACM Eli Ben-Sasson, Avi Wigderson
2001	J	`jnl`	Space Complexity of Random Formulae in Resolution Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Nicola Galesi
2001	A	`conf`	Space Complexity of Random Formulae in Resolution. CCC Eli Ben-Sasson, Nicola Galesi
2000	J	`jnl`	Near-Optimal Separation of Treelike and General Resolution Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
2000	J	`jnl`	Pseudorandom Generators in Propositional Proof Complexity Electron. Colloquium Comput. Complex. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
2000	A*	`conf`	Pseudorandom Generators in Propositional Proof Complexity. FOCS Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
2000	A*	`conf`	Space complexity in propositional calculus. STOC Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
1999	A*	`conf`	Random CNF's are Hard for the Polynomial Calculus. FOCS Eli Ben-Sasson, Russell Impagliazzo
1999	A	`conf`	Short Proofs Are Narrow - Resolution Made Simple (Abstract). CCC Eli Ben-Sasson, Avi Wigderson
1999	A*	`conf`	Short Proofs are Narrow - Resolution Made Simple. STOC Eli Ben-Sasson, Avi Wigderson
1999	J	`jnl`	Short Proofs are Narrow - Resolution made Simple Electron. Colloquium Comput. Complex. Eli Ben-Sasson, Avi Wigderson
1999	J	`jnl`	Space Complexity in Propositional Calculus Electron. Colloquium Comput. Complex. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson