default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEli Ben-Sasson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j32]Ayelet Ben-Sasson
, Kayla Jacobs, Eli Ben-Sasson:
Early childhood tracking application: Correspondence between crowd-based developmental percentiles and clinical tools. Health Informatics J. 29(1): 146045822311646 (2023)- [j31]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. J. ACM 70(5): 31:1-31:57 (2023) - [c70]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time O(n log n) over all Finite Fields. SODA 2023: 700-737 - 2022
- [c69]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). TCC (1) 2022: 467-496 - [i84]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. Electron. Colloquium Comput. Complex. TR22 (2022) - [i83]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). IACR Cryptol. ePrint Arch. 2022: 1542 (2022) - 2021
- [i82]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. CoRR abs/2107.08473 (2021) - [i81]Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j30]Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec:
Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols. IACR Trans. Symmetric Cryptol. 2020(3): 1-45 (2020) - [c68]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. FOCS 2020: 900-909 - [c67]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS 2020: 5:1-5:32 - [i80]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. TR20 (2020) - [i79]Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf:
Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. 2020: 654 (2020) - [i78]Eli Ben-Sasson, Lior Goldberg, David Levit:
STARK Friendly Hash - Survey and Recommendation. IACR Cryptol. ePrint Arch. 2020: 948 (2020)
2010 – 2019
- 2019
- [c66]Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Elisheva Rotman Argaman, Eden Saig:
Evaluating Expert Curation in a Baby Milestone Tracking App. CHI 2019: 553 - [c65]Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev:
Scalable Zero Knowledge with No Trusted Setup. CRYPTO (3) 2019: 701-732 - [c64]Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward:
Aurora: Transparent Succinct Arguments for R1CS. EUROCRYPT (1) 2019: 103-128 - [c63]Eli Ben-Sasson, Eden Saig:
The Complexity of User Retention. ITCS 2019: 12:1-12:30 - [c62]Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner:
Linear-Size Constant-Query IOPs for Delegating Computation. TCC (2) 2019: 494-521 - [i77]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling outside the box improves soundness. CoRR abs/1903.12243 (2019) - [i76]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. TR19 (2019) - [i75]Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. 2019: 336 (2019) - [i74]Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec:
Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution). IACR Cryptol. ePrint Arch. 2019: 426 (2019) - [i73]Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner:
Linear-Size Constant-Query IOPs for Delegating Computation. IACR Cryptol. ePrint Arch. 2019: 1230 (2019) - 2018
- [c61]Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-Case to Average Case Reductions for the Distance to a Code. CCC 2018: 24:1-24:23 - [c60]Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev:
Fast Reed-Solomon Interactive Oracle Proofs of Proximity. ICALP 2018: 14:1-14:17 - [c59]Eli Ben-Sasson, Eden Saig:
Brief Announcement: Towards an Abstract Model of User Retention Dynamics. ICALP 2018: 164:1-164:4 - [i72]Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf:
Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. TR18 (2018) - [i71]Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev:
Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. 2018: 46 (2018) - [i70]Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward:
Aurora: Transparent Succinct Arguments for R1CS. IACR Cryptol. ePrint Arch. 2018: 828 (2018) - 2017
- [j29]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge Via Cycles of Elliptic Curves. Algorithmica 79(4): 1102-1160 (2017) - [j28]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse affine-invariant linear codes are locally testable. Comput. Complex. 26(1): 37-77 (2017) - [c58]Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational Integrity with a Public Random String from Quasi-Linear PCPs. EUROCRYPT (3) 2017: 551-579 - [c57]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP 2017: 40:1-40:15 - [c56]Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Eden Saig:
Baby CROINC: an online, crowd-based, expert-curated system for monitoring child development. PervasiveHealth 2017: 110-119 - [c55]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) 2017: 172-206 - [i69]Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev:
Fast Reed-Solomon Interactive Oracle Proofs of Proximity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i68]Eli Ben-Sasson, Eden Saig:
Collaborative Discovery: A study of Guru-follower dynamics. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j27]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM 63(4): 32:1-32:57 (2016) - [j26]Eli Ben-Sasson, Michael Viderman:
A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms 49(2): 280-307 (2016) - [j25]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. IEEE Trans. Inf. Theory 62(3): 1157-1165 (2016) - [c54]Eli Ben-Sasson, Matan Hamilis, Mark Silberstein, Eran Tromer:
Fast Multiplication in Binary Fields on GPUs via Register Cache. ICS 2016: 35:1-35:12 - [c53]Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. Public Key Cryptography (2) 2016: 417-446 - [c52]Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner:
Interactive Oracle Proofs. TCC (B2) 2016: 31-60 - [c51]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. TCC (A2) 2016: 33-64 - [i67]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. CoRR abs/1610.03798 (2016) - [i66]Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev:
Improved concrete efficiency and security analysis of Reed-Solomon PCPPs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i65]Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev:
A security analysis of Probabilistically Checkable Proofs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i64]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. TR16 (2016) - [i63]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. Electron. Colloquium Comput. Complex. TR16 (2016) - [i62]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. Electron. Colloquium Comput. Complex. TR16 (2016) - [i61]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza:
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. IACR Cryptol. ePrint Arch. 2016: 21 (2016) - [i60]Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner:
Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2016: 116 (2016) - [i59]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptol. ePrint Arch. 2016: 324 (2016) - [i58]Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza:
Computational integrity with a public random string from quasi-linear PCPs. IACR Cryptol. ePrint Arch. 2016: 646 (2016) - [i57]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. 2016: 988 (2016) - 2015
- [j24]Eli Ben-Sasson, Michael Viderman:
Composition of semi-LTCs by two-wise tensor products. Comput. Complex. 24(3): 601-643 (2015) - [j23]Eli Ben-Sasson, Noga Ron-Zewi:
From Affine to Two-Source Extractors via Approximate Duality. SIAM J. Comput. 44(6): 1670-1697 (2015) - [c50]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace polynomials and cyclic subspace codes. ISIT 2015: 586-590 - [c49]Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza:
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs. IEEE Symposium on Security and Privacy 2015: 287-304 - [i56]Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. Electron. Colloquium Comput. Complex. TR15 (2015) - [i55]Eli Ben-Sasson, Gal Maor:
Lower bound for communication complexity with no public randomness. Electron. Colloquium Comput. Complex. TR15 (2015) - [i54]Eli Ben-Sasson, Gal Maor:
On the information leakage of public-output protocols. Electron. Colloquium Comput. Complex. TR15 (2015) - [i53]Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi:
On Public Key Encryption from Noisy Codewords. IACR Cryptol. ePrint Arch. 2015: 572 (2015) - 2014
- [j22]Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi:
An Additive Combinatorics Approach Relating Rank to Communication Complexity. J. ACM 61(4): 22:1-22:18 (2014) - [j21]Eli Ben-Sasson, Rafail Ostrovsky:
Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011). SIAM J. Comput. 43(2): 654 (2014) - [c48]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge via Cycles of Elliptic Curves. CRYPTO (2) 2014: 276-294 - [c47]Eli Ben-Sasson, Emanuele Viola:
Short PCPs with Projection Queries. ICALP (1) 2014: 163-173 - [c46]Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf:
Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. ICALP (1) 2014: 955-966 - [c45]Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza:
Zerocash: Decentralized Anonymous Payments from Bitcoin. IEEE Symposium on Security and Privacy 2014: 459-474 - [c44]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. USENIX Security Symposium 2014: 781-796 - [i52]Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv:
Subspace Polynomials and Cyclic Subspace Codes. CoRR abs/1404.7739 (2014) - [i51]Eli Ben-Sasson, Emanuele Viola:
Short PCPs with projection queries. Electron. Colloquium Comput. Complex. TR14 (2014) - [i50]Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza:
Zerocash: Decentralized Anonymous Payments from Bitcoin. IACR Cryptol. ePrint Arch. 2014: 349 (2014) - [i49]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Scalable Zero Knowledge via Cycles of Elliptic Curves. IACR Cryptol. ePrint Arch. 2014: 595 (2014) - 2013
- [j20]Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic. Theory Comput. 9: 665-683 (2013) - [c43]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza:
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. CRYPTO (2) 2013: 90-108 - [c42]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS 2013: 320-329 - [c41]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. ITCS 2013: 401-414 - [c40]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
On the concrete efficiency of probabilistically-checkable proofs. STOC 2013: 585-594 - [c39]Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf:
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC 2013: 833-842 - [i48]Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth:
Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. TR13 (2013) - [i47]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza:
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. IACR Cryptol. ePrint Arch. 2013: 507 (2013) - [i46]Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza:
Succinct Non-Interactive Arguments for a von Neumann Architecture. IACR Cryptol. ePrint Arch. 2013: 879 (2013) - 2012
- [j19]Eli Ben-Sasson, Michael Viderman:
Towards lower bounds on locally testable codes via density arguments. Comput. Complex. 21(2): 267-309 (2012) - [j18]Eli Ben-Sasson, Swastik Kopparty:
Affine Dispersers from Subspace Polynomials. SIAM J. Comput. 41(4): 880-914 (2012) - [c38]Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. APPROX-RANDOM 2012: 399-410 - [c37]Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. CRYPTO 2012: 663-680 - [c36]Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi:
An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS 2012: 177-186 - [c35]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse Affine-Invariant Linear Codes Are Locally Testable. FOCS 2012: 561-570 - [i45]Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf:
Sampling-based proofs of almost-periodicity results and algorithmic applications. CoRR abs/1210.6917 (2012) - [i44]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electron. Colloquium Comput. Complex. TR12 (2012) - [i43]Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf:
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. TR12 (2012) - [i42]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse affine-invariant linear codes are locally testable. Electron. Colloquium Comput. Complex. TR12 (2012) - [i41]Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf:
Sampling-based proofs of almost-periodicity results and algorithmic applications. Electron. Colloquium Comput. Complex. TR12 (2012) - [i40]Eli Ben-Sasson, Michael Viderman:
A Combinatorial Characterization of smooth LTCs and Applications. Electron. Colloquium Comput. Complex. TR12 (2012) - [i39]Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer:
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. IACR Cryptol. ePrint Arch. 2012: 71 (2012) - 2011
- [c34]Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM 2011: 400-411 - [c33]Eli Ben-Sasson, Madhu Sudan:
Limits on the Rate of Locally Testable Affine-Invariant Codes. APPROX-RANDOM 2011: 412-423 - [c32]Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
Symmetric LDPC Codes are not Necessarily Locally Testable. CCC 2011: 55-65 - [c31]Eli Ben-Sasson, Michael Viderman:
Towards Lower Bounds on Locally Testable Codes via Density Arguments. CCC 2011: 66-76 - [c30]Eli Ben-Sasson, Jan Johannsen:
Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. IJCAI 2011: 2570-2575 - [c29]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. ICS 2011: 401-416 - [c28]Noga Zewi, Eli Ben-Sasson:
From affine to two-source extractors via approximate duality. STOC 2011: 177-186 - [i38]Eli Ben-Sasson, Shachar Lovett, Noga Zewi:
An additive combinatorics approach to the log-rank conjecture in communication complexity. CoRR abs/1111.5884 (2011) - [i37]Eli Ben-Sasson, Ariel Gabizon:
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. Electron. Colloquium Comput. Complex. TR11 (2011) - [i36]Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. Electron. Colloquium Comput. Complex. TR11 (2011) - [i35]Eli Ben-Sasson, Shachar Lovett, Noga Zewi:
An additive combinatorics approach to the log-rank conjecture in communication complexity. Electron. Colloquium Comput. Complex. TR11 (2011) - [i34]Eli Ben-Sasson, Michael Viderman:
Composition of semi-LTCs by two-wise Tensor Products. Electron. Colloquium Comput. Complex. TR11 (2011) - [i33]Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky:
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. IACR Cryptol. ePrint Arch. 2011: 629 (2011) - 2010
- [j17]Eli Ben-Sasson, Russell Impagliazzo:
Random Cnf's are Hard for the Polynomial Calculus. Comput. Complex. 19(4): 501-519 (2010) - [j16]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. SIAM J. Comput. 39(7): 3230-3247 (2010) - [j15]Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 56(1): 113-120 (2010) - [j14]Eli Ben-Sasson, Prahladh Harsha:
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games. ACM Trans. Comput. Log. 11(3): 19:1-19:17 (2010) - [c27]Eli Ben-Sasson, Michael Viderman:
Low Rate Is Insufficient for Local Testability. APPROX-RANDOM 2010: 420-433 - [c26]Eli Ben-Sasson, Jan Johannsen:
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. SAT 2010: 16-29 - [p1]Eli Ben-Sasson:
Limitation on the Rate of Families of Locally Testable Codes. Property Testing 2010: 13-31 - [i32]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. CoRR abs/1008.1789 (2010) - [i31]Shir Ben-Israel, Eli Ben-Sasson, David R. Karger:
Breaking local symmetries can dramatically reduce the length of propositional refutations. Electron. Colloquium Comput. Complex. TR10 (2010) - [i30]Eli Ben-Sasson:
Limitation on the rate of families of locally testable codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i29]Eli Ben-Sasson, Jan Johannsen:
Lower bounds for width-restricted clause learning on small width formulas. Electron. Colloquium Comput. Complex. TR10 (2010) - [i28]Eli Ben-Sasson, Swastik Kopparty:
Affine Dispersers from Subspace Polynomials. Electron. Colloquium Comput. Complex. TR10 (2010) - [i27]Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
Symmetric LDPC codes are not necessarily locally testable. Electron. Colloquium Comput. Complex. TR10 (2010) - [i26]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions. Electron. Colloquium Comput. Complex. TR10 (2010) - [i25]Eli Ben-Sasson, Madhu Sudan:
Limits on the rate of locally testable affine-invariant codes. Electron. Colloquium Comput. Complex. TR10 (2010) - [i24]Eli Ben-Sasson, Michael Viderman:
Low Rate Is Insufficient for Local Testability. Electron. Colloquium Comput. Complex. TR10 (2010) - [i23]Eli Ben-Sasson, Michael Viderman:
Towards lower bounds on locally testable codes via density arguments. Electron. Colloquium Comput. Complex. TR10 (2010) - [i22]Eli Ben-Sasson, Noga Zewi:
From Affine to Two-Source Extractors via Approximate Duality. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j13]Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes are Robust. Theory Comput. 5(1): 239-255 (2009) - [j12]Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah:
Sound 3-Query PCPPs Are Long. ACM Trans. Comput. Theory 1(2): 7:1-7:49 (2009) - [c25]Eli Ben-Sasson, Michael Viderman:
Composition of Semi-LTCs by Two-Wise Tensor Products. APPROX-RANDOM 2009: 378-391 - [c24]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. CCC 2009: 52-61 - [c23]Eli Ben-Sasson, Swastik Kopparty:
Affine dispersers from subspace polynomials. STOC 2009: 65-74 - [i21]Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman:
Locally Testable Codes Require Redundant Testers. Electron. Colloquium Comput. Complex. TR09 (2009) - [i20]Eli Ben-Sasson, Jakob Nordström:
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. Electron. Colloquium Comput. Complex. TR09 (2009) - [i19]Eli Ben-Sasson, Jakob Nordström:
Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs. Electron. Colloquium Comput. Complex. TR09 (2009) - [i18]Eli Ben-Sasson, Jakob Nordström:
A Space Hierarchy for k-DNF Resolution. Electron. Colloquium Comput. Complex. TR09 (2009) - [i17]Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes are Robust. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j11]Eli Ben-Sasson, Madhu Sudan:
Short PCPs with Polylog Query Complexity. SIAM J. Comput. 38(2): 551-607 (2008) - [c22]Eli Ben-Sasson, Michael Viderman:
Tensor Products of Weakly Smooth Codes Are Robust. APPROX-RANDOM 2008: 290-302 - [c21]Eli Ben-Sasson, Jakob Nordström:
Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. FOCS 2008: 709-718 - [c20]Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah:
Sound 3-Query PCPPs Are Long. ICALP (1) 2008: 686-697 - [i16]Eli Ben-Sasson, Jakob Nordström:
Understanding space in resolution: optimal lower bounds and exponential trade-offs. Computational Complexity of Discrete Problems 2008 - 2007
- [j10]Mikhail Alekhnovich, Eli Ben-Sasson:
Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. SIAM J. Comput. 36(5): 1248-1263 (2007) - [i15]Arie Matsliah, Eli Ben-Sasson, Prahladh Harsha, Oded Lachish:
Sound 3-query PCPPs are Long. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j9]Eli Ben-Sasson, Madhu Sudan:
Robust locally testable codes and products of codes. Random Struct. Algorithms 28(4): 387-402 (2006) - [j8]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. 36(4): 889-974 (2006) - [c19]Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan:
Subspace Polynomials and List Decoding of Reed-Solomon Codes. FOCS 2006: 207-216 - [c18]Eli Ben-Sasson, Adam Tauman Kalai, Ehud Kalai:
An Approach to Bounded Rationality. NIPS 2006: 145-152 - 2005
- [j7]Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova:
Some 3CNF Properties Are Hard to Test. SIAM J. Comput. 35(1): 1-21 (2005) - [c17]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Short PCPs Verifiable in Polylogarithmic Time. CCC 2005: 120-134 - [c16]Eli Ben-Sasson, Madhu Sudan:
Simple PCPs with poly-log rate and query complexity. STOC 2005: 266-275 - 2004
- [j6]Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson:
Near Optimal Separation Of Tree-Like And General Resolution. Comb. 24(4): 585-603 (2004) - [j5]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Pseudorandom Generators in Propositional Proof Complexity. SIAM J. Comput. 34(1): 67-88 (2004) - [c15]Eli Ben-Sasson, Madhu Sudan:
Robust Locally Testable Codes and Products of Codes. APPROX-RANDOM 2004: 286-297 - [c14]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust pcps of proximity, shorter pcps and applications to coding. STOC 2004: 1-10 - [i14]Eli Ben-Sasson, Madhu Sudan:
Robust Locally Testable Codes and Products of Codes. CoRR cs.IT/0408066 (2004) - [i13]Michael Alekhnovich, Eli Ben-Sasson:
Linear Upper Bounds for Random Walk on Small Density Random 3CNFs. Electron. Colloquium Comput. Complex. TR04 (2004) - [i12]Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan:
Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. Electron. Colloquium Comput. Complex. TR04 (2004) - [i11]Eli Ben-Sasson, Madhu Sudan:
Robust Locally Testable Codes and Products of Codes. Electron. Colloquium Comput. Complex. TR04 (2004) - [i10]Eli Ben-Sasson, Madhu Sudan:
Simple PCPs with Poly-log Rate and Query Complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j4]Eli Ben-Sasson, Nicola Galesi:
Space complexity of random formulae in resolution. Random Struct. Algorithms 23(1): 92-109 (2003) - [c13]Michael Alekhnovich, Eli Ben-Sasson:
Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. FOCS 2003: 352-361 - [c12]Eli Ben-Sasson, Oded Goldreich, Madhu Sudan:
Bounds on 2-Query Codeword Testing. RANDOM-APPROX 2003: 216-227 - [c11]Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova:
Some 3CNF properties are hard to test. STOC 2003: 345-354 - [c10]Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson:
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. STOC 2003: 612-621 - [i9]Eli Ben-Sasson, Prahladh Harsha:
Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games. Electron. Colloquium Comput. Complex. TR03 (2003) - [i8]Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova:
3CNF Properties are Hard to Test. Electron. Colloquium Comput. Complex. TR03 (2003) - [i7]Eli Ben-Sasson, Oded Goldreich, Madhu Sudan:
Bounds on 2-Query Codeword Testing. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j3]Eli Ben-Sasson:
Hard examples for the bounded depth Frege proof system. Comput. Complex. 11(3-4): 109-136 (2002) - [j2]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space Complexity in Propositional Calculus. SIAM J. Comput. 31(4): 1184-1211 (2002) - [c9]Eli Ben-Sasson:
Hard Examples for Bounded Depth Frege. CCC 2002: 4 - [c8]Eli Ben-Sasson:
Size space tradeoffs for resolution. STOC 2002: 457-464 - [c7]Eli Ben-Sasson:
Hard examples for bounded depth frege. STOC 2002: 563-572 - [i6]Eli Ben-Sasson, Yonatan Bilu:
A Gap in Average Proof Complexity. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [b1]Eli Ben-Sasson:
Expansion in proof complexity. (הרחבה ומורכבות הוכחות.). Hebrew University of Jerusalem, Israel, 2001 - [j1]Eli Ben-Sasson, Avi Wigderson:
Short proofs are narrow - resolution made simple. J. ACM 48(2): 149-169 (2001) - [c6]Eli Ben-Sasson, Nicola Galesi:
Space Complexity of Random Formulae in Resolution. CCC 2001: 42-51 - [i5]Eli Ben-Sasson, Nicola Galesi:
Space Complexity of Random Formulae in Resolution. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c5]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Pseudorandom Generators in Propositional Proof Complexity. FOCS 2000: 43-53 - [c4]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space complexity in propositional calculus. STOC 2000: 358-367 - [i4]Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson:
Near-Optimal Separation of Treelike and General Resolution. Electron. Colloquium Comput. Complex. TR00 (2000) - [i3]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Pseudorandom Generators in Propositional Proof Complexity. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c3]Eli Ben-Sasson, Avi Wigderson:
Short Proofs Are Narrow - Resolution Made Simple (Abstract). CCC 1999: 2 - [c2]Eli Ben-Sasson, Russell Impagliazzo:
Random CNF's are Hard for the Polynomial Calculus. FOCS 1999: 415-421 - [c1]Eli Ben-Sasson, Avi Wigderson:
Short Proofs are Narrow - Resolution Made Simple. STOC 1999: 517-526 - [i2]Eli Ben-Sasson, Avi Wigderson:
Short Proofs are Narrow - Resolution made Simple. Electron. Colloquium Comput. Complex. TR99 (1999) - [i1]Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson:
Space Complexity in Propositional Calculus. Electron. Colloquium Comput. Complex. TR99 (1999)
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-08-05 20:23 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:
