Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Eli Ben-Sasson
@article{DBLP:journals/hij/BenSassonJB23, author = {Ayelet Ben{-}Sasson and Kayla Jacobs and Eli Ben{-}Sasson}, title = {Early childhood tracking application: Correspondence between crowd-based developmental percentiles and clinical tools}, journal = {Health Informatics J.}, volume = {29}, number = {1}, pages = {146045822311646}, year = {2023}, url = {https://doi.org/10.1177/14604582231164695}, doi = {10.1177/14604582231164695}, timestamp = {Sun, 16 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/hij/BenSassonJB23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BenSassonCIKS23, author = {Eli Ben{-}Sasson and Dan Carmon and Yuval Ishai and Swastik Kopparty and Shubhangi Saraf}, title = {Proximity Gaps for Reed-Solomon Codes}, journal = {J. {ACM}}, volume = {70}, number = {5}, pages = {31:1--31:57}, year = {2023}, url = {https://doi.org/10.1145/3614423}, doi = {10.1145/3614423}, timestamp = {Tue, 28 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BenSassonCIKS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Ben-SassonCKL23, author = {Eli Ben{-}Sasson and Dan Carmon and Swastik Kopparty and David Levit}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Elliptic Curve Fast Fourier Transform {(ECFFT)} Part {I:} Low-degree Extension in Time \emph{O(n} log \emph{n}) over all Finite Fields}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {700--737}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch30}, doi = {10.1137/1.9781611977554.CH30}, timestamp = {Fri, 17 Feb 2023 09:28:57 +0100}, biburl = {https://dblp.org/rec/conf/soda/Ben-SassonCKL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/Ben-SassonCKL22, author = {Eli Ben{-}Sasson and Dan Carmon and Swastik Kopparty and David Levit}, editor = {Eike Kiltz and Vinod Vaikuntanathan}, title = {Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - {(ECFFT} Part {II)}}, booktitle = {Theory of Cryptography - 20th International Conference, {TCC} 2022, Chicago, IL, USA, November 7-10, 2022, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {13747}, pages = {467--496}, publisher = {Springer}, year = {2022}, url = {https://doi.org/10.1007/978-3-031-22318-1\_17}, doi = {10.1007/978-3-031-22318-1\_17}, timestamp = {Sun, 25 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tcc/Ben-SassonCKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCKL22, author = {Eli Ben{-}Sasson and Dan Carmon and Swastik Kopparty and David Levit}, title = {Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR22-110}}, year = {2022}, url = {https://eccc.weizmann.ac.il/report/2022/110}, eprinttype = {ECCC}, eprint = {TR22-110}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCKL22, author = {Eli Ben{-}Sasson and Dan Carmon and Swastik Kopparty and David Levit}, title = {Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves {(ECFFT} part {II)}}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1542}, year = {2022}, url = {https://eprint.iacr.org/2022/1542}, timestamp = {Wed, 23 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-08473, author = {Eli Ben{-}Sasson and Dan Carmon and Swastik Kopparty and David Levit}, title = {Elliptic Curve Fast Fourier Transform {(ECFFT)} Part {I:} Fast Polynomial Algorithms over all Finite Fields}, journal = {CoRR}, volume = {abs/2107.08473}, year = {2021}, url = {https://arxiv.org/abs/2107.08473}, eprinttype = {arXiv}, eprint = {2107.08473}, timestamp = {Thu, 22 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-08473.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCKL21, author = {Eli Ben{-}Sasson and Dan Carmon and Swastik Kopparty and David Levit}, title = {Elliptic Curve Fast Fourier Transform {(ECFFT)} Part {I:} Fast Polynomial Algorithms over all Finite Fields}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-103}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/103}, eprinttype = {ECCC}, eprint = {TR21-103}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tosc/AlyABDS20, author = {Abdelrahaman Aly and Tomer Ashur and Eli Ben{-}Sasson and Siemen Dhooghe and Alan Szepieniec}, title = {Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols}, journal = {{IACR} Trans. Symmetric Cryptol.}, volume = {2020}, number = {3}, pages = {1--45}, year = {2020}, url = {https://doi.org/10.13154/tosc.v2020.i3.1-45}, doi = {10.13154/TOSC.V2020.I3.1-45}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tosc/AlyABDS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonCIKS20, author = {Eli Ben{-}Sasson and Dan Carmon and Yuval Ishai and Swastik Kopparty and Shubhangi Saraf}, editor = {Sandy Irani}, title = {Proximity Gaps for Reed-Solomon Codes}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {900--909}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00088}, doi = {10.1109/FOCS46700.2020.00088}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonCIKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Ben-SassonGKS20, author = {Eli Ben{-}Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf}, editor = {Thomas Vidick}, title = {{DEEP-FRI:} Sampling Outside the Box Improves Soundness}, booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS} 2020, January 12-14, 2020, Seattle, Washington, {USA}}, series = {LIPIcs}, volume = {151}, pages = {5:1--5:32}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.5}, doi = {10.4230/LIPICS.ITCS.2020.5}, timestamp = {Wed, 15 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Ben-SassonGKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCIKS20, author = {Eli Ben{-}Sasson and Dan Carmon and Yuval Ishai and Swastik Kopparty and Shubhangi Saraf}, title = {Proximity Gaps for Reed-Solomon Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-083}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/083}, eprinttype = {ECCC}, eprint = {TR20-083}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCIKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCIKS20, author = {Eli Ben{-}Sasson and Dan Carmon and Yuval Ishai and Swastik Kopparty and Shubhangi Saraf}, title = {Proximity Gaps for Reed-Solomon Codes}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {654}, year = {2020}, url = {https://eprint.iacr.org/2020/654}, timestamp = {Tue, 30 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCIKS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonGL20, author = {Eli Ben{-}Sasson and Lior Goldberg and David Levit}, title = {{STARK} Friendly Hash - Survey and Recommendation}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {948}, year = {2020}, url = {https://eprint.iacr.org/2020/948}, timestamp = {Wed, 02 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonGL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/chi/Ben-SassonBJAS19, author = {Ayelet Ben{-}Sasson and Eli Ben{-}Sasson and Kayla Jacobs and Elisheva Rotman Argaman and Eden Saig}, editor = {Stephen A. Brewster and Geraldine Fitzpatrick and Anna L. Cox and Vassilis Kostakos}, title = {Evaluating Expert Curation in a Baby Milestone Tracking App}, booktitle = {Proceedings of the 2019 {CHI} Conference on Human Factors in Computing Systems, {CHI} 2019, Glasgow, Scotland, UK, May 04-09, 2019}, pages = {553}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3290605.3300783}, doi = {10.1145/3290605.3300783}, timestamp = {Sun, 02 Jun 2019 21:13:35 +0200}, biburl = {https://dblp.org/rec/conf/chi/Ben-SassonBJAS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/Ben-SassonBHR19, author = {Eli Ben{-}Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev}, editor = {Alexandra Boldyreva and Daniele Micciancio}, title = {Scalable Zero Knowledge with No Trusted Setup}, booktitle = {Advances in Cryptology - {CRYPTO} 2019 - 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2019, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {11694}, pages = {701--732}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-26954-8\_23}, doi = {10.1007/978-3-030-26954-8\_23}, timestamp = {Fri, 09 Aug 2019 14:27:02 +0200}, biburl = {https://dblp.org/rec/conf/crypto/Ben-SassonBHR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/eurocrypt/Ben-SassonCRSVW19, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Michael Riabzev and Nicholas Spooner and Madars Virza and Nicholas P. Ward}, editor = {Yuval Ishai and Vincent Rijmen}, title = {Aurora: Transparent Succinct Arguments for {R1CS}}, booktitle = {Advances in Cryptology - {EUROCRYPT} 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {11476}, pages = {103--128}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-17653-2\_4}, doi = {10.1007/978-3-030-17653-2\_4}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/eurocrypt/Ben-SassonCRSVW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Ben-SassonS19, author = {Eli Ben{-}Sasson and Eden Saig}, editor = {Avrim Blum}, title = {The Complexity of User Retention}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {12:1--12:30}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.12}, doi = {10.4230/LIPICS.ITCS.2019.12}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Ben-SassonS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/Ben-SassonCGGRS19, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Lior Goldberg and Tom Gur and Michael Riabzev and Nicholas Spooner}, editor = {Dennis Hofheinz and Alon Rosen}, title = {Linear-Size Constant-Query IOPs for Delegating Computation}, booktitle = {Theory of Cryptography - 17th International Conference, {TCC} 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {11892}, pages = {494--521}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-36033-7\_19}, doi = {10.1007/978-3-030-36033-7\_19}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tcc/Ben-SassonCGGRS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1903-12243, author = {Eli Ben{-}Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf}, title = {{DEEP-FRI:} Sampling outside the box improves soundness}, journal = {CoRR}, volume = {abs/1903.12243}, year = {2019}, url = {http://arxiv.org/abs/1903.12243}, eprinttype = {arXiv}, eprint = {1903.12243}, timestamp = {Tue, 02 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1903-12243.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonGKS19, author = {Eli Ben{-}Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf}, title = {{DEEP-FRI:} Sampling Outside the Box Improves Soundness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-044}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/044}, eprinttype = {ECCC}, eprint = {TR19-044}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGKS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonGKS19, author = {Eli Ben{-}Sasson and Lior Goldberg and Swastik Kopparty and Shubhangi Saraf}, title = {{DEEP-FRI:} Sampling Outside the Box Improves Soundness}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {336}, year = {2019}, url = {https://eprint.iacr.org/2019/336}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonGKS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/AlyABDS19, author = {Abdelrahaman Aly and Tomer Ashur and Eli Ben{-}Sasson and Siemen Dhooghe and Alan Szepieniec}, title = {Efficient Symmetric Primitives for Advanced Cryptographic Protocols {(A} Marvellous Contribution)}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {426}, year = {2019}, url = {https://eprint.iacr.org/2019/426}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/AlyABDS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCGGRS19, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Lior Goldberg and Tom Gur and Michael Riabzev and Nicholas Spooner}, title = {Linear-Size Constant-Query IOPs for Delegating Computation}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {1230}, year = {2019}, url = {https://eprint.iacr.org/2019/1230}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCGGRS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonKS18, author = {Eli Ben{-}Sasson and Swastik Kopparty and Shubhangi Saraf}, editor = {Rocco A. Servedio}, title = {Worst-Case to Average Case Reductions for the Distance to a Code}, booktitle = {33rd Computational Complexity Conference, {CCC} 2018, June 22-24, 2018, San Diego, CA, {USA}}, series = {LIPIcs}, volume = {102}, pages = {24:1--24:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.CCC.2018.24}, doi = {10.4230/LIPICS.CCC.2018.24}, timestamp = {Thu, 02 Feb 2023 13:27:04 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonBHR18, author = {Eli Ben{-}Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Fast Reed-Solomon Interactive Oracle Proofs of Proximity}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {14:1--14:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.14}, doi = {10.4230/LIPICS.ICALP.2018.14}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonBHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonS18, author = {Eli Ben{-}Sasson and Eden Saig}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Brief Announcement: Towards an Abstract Model of User Retention Dynamics}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {164:1--164:4}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.164}, doi = {10.4230/LIPICS.ICALP.2018.164}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonKS18, author = {Eli Ben{-}Sasson and Swastik Kopparty and Shubhangi Saraf}, title = {Worst-case to average case reductions for the distance to a code}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-090}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/090}, eprinttype = {ECCC}, eprint = {TR18-090}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonBHR18, author = {Eli Ben{-}Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev}, title = {Scalable, transparent, and post-quantum secure computational integrity}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {46}, year = {2018}, url = {http://eprint.iacr.org/2018/046}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonBHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCRSVW18, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Michael Riabzev and Nicholas Spooner and Madars Virza and Nicholas P. Ward}, title = {Aurora: Transparent Succinct Arguments for {R1CS}}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {828}, year = {2018}, url = {https://eprint.iacr.org/2018/828}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCRSVW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Ben-SassonCTV17, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, title = {Scalable Zero Knowledge Via Cycles of Elliptic Curves}, journal = {Algorithmica}, volume = {79}, number = {4}, pages = {1102--1160}, year = {2017}, url = {https://doi.org/10.1007/s00453-016-0221-0}, doi = {10.1007/S00453-016-0221-0}, timestamp = {Wed, 11 Oct 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Ben-SassonCTV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-SassonRS17, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi and Madhu Sudan}, title = {Sparse affine-invariant linear codes are locally testable}, journal = {Comput. Complex.}, volume = {26}, number = {1}, pages = {37--77}, year = {2017}, url = {https://doi.org/10.1007/s00037-015-0115-6}, doi = {10.1007/S00037-015-0115-6}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/Ben-SassonRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/eurocrypt/Ben-SassonBCGGH17, author = {Eli Ben{-}Sasson and Iddo Bentov and Alessandro Chiesa and Ariel Gabizon and Daniel Genkin and Matan Hamilis and Evgenya Pergament and Michael Riabzev and Mark Silberstein and Eran Tromer and Madars Virza}, editor = {Jean{-}S{\'{e}}bastien Coron and Jesper Buus Nielsen}, title = {Computational Integrity with a Public Random String from Quasi-Linear PCPs}, booktitle = {Advances in Cryptology - {EUROCRYPT} 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part {III}}, series = {Lecture Notes in Computer Science}, volume = {10212}, pages = {551--579}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-56617-7\_19}, doi = {10.1007/978-3-319-56617-7\_19}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/eurocrypt/Ben-SassonBCGGH17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonCGRS17, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, title = {Interactive Oracle Proofs with Constant Rate and Query Complexity}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, pages = {40:1--40:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.40}, doi = {10.4230/LIPICS.ICALP.2017.40}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonCGRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ph/Ben-SassonBJS17, author = {Ayelet Ben{-}Sasson and Eli Ben{-}Sasson and Kayla Jacobs and Eden Saig}, editor = {Nuria Oliver and Mary Czerwinski}, title = {Baby {CROINC:} an online, crowd-based, expert-curated system for monitoring child development}, booktitle = {Proceedings of the 11th {EAI} International Conference on Pervasive Computing Technologies for Healthcare, PervasiveHealth 2017, Barcelona, Spain, May 23-26, 2017}, pages = {110--119}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3154862.3154887}, doi = {10.1145/3154862.3154887}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ph/Ben-SassonBJS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/Ben-SassonCFGRS17, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Michael A. Forbes and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, editor = {Yael Kalai and Leonid Reyzin}, title = {Zero Knowledge Protocols from Succinct Constraint Detection}, booktitle = {Theory of Cryptography - 15th International Conference, {TCC} 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {10678}, pages = {172--206}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-70503-3\_6}, doi = {10.1007/978-3-319-70503-3\_6}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tcc/Ben-SassonCFGRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonBHR17, author = {Eli Ben{-}Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev}, title = {Fast Reed-Solomon Interactive Oracle Proofs of Proximity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-134}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/134}, eprinttype = {ECCC}, eprint = {TR17-134}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonBHR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonS17, author = {Eli Ben{-}Sasson and Eden Saig}, title = {Collaborative Discovery: {A} study of Guru-follower dynamics}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-160}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/160}, eprinttype = {ECCC}, eprint = {TR17-160}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Ben-SassonKKMS16, author = {Eli Ben{-}Sasson and Yohay Kaplan and Swastik Kopparty and Or Meir and Henning Stichtenoth}, title = {Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity}, journal = {J. {ACM}}, volume = {63}, number = {4}, pages = {32:1--32:57}, year = {2016}, url = {https://doi.org/10.1145/2901294}, doi = {10.1145/2901294}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonKKMS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Ben-SassonV16, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {A combinatorial characterization of smooth LTCs and applications}, journal = {Random Struct. Algorithms}, volume = {49}, number = {2}, pages = {280--307}, year = {2016}, url = {https://doi.org/10.1002/rsa.20637}, doi = {10.1002/RSA.20637}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Ben-SassonV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Ben-SassonEGR16, author = {Eli Ben{-}Sasson and Tuvi Etzion and Ariel Gabizon and Netanel Raviv}, title = {Subspace Polynomials and Cyclic Subspace Codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {62}, number = {3}, pages = {1157--1165}, year = {2016}, url = {https://doi.org/10.1109/TIT.2016.2520479}, doi = {10.1109/TIT.2016.2520479}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Ben-SassonEGR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ics/Ben-SassonHST16, author = {Eli Ben{-}Sasson and Matan Hamilis and Mark Silberstein and Eran Tromer}, editor = {Ozcan Ozturk and Kemal Ebcioglu and Mahmut T. Kandemir and Onur Mutlu}, title = {Fast Multiplication in Binary Fields on GPUs via Register Cache}, booktitle = {Proceedings of the 2016 International Conference on Supercomputing, {ICS} 2016, Istanbul, Turkey, June 1-3, 2016}, pages = {35:1--35:12}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2925426.2926259}, doi = {10.1145/2925426.2926259}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ics/Ben-SassonHST16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/pkc/Ben-SassonBDIR16, author = {Eli Ben{-}Sasson and Iddo Bentov and Ivan Damg{\aa}rd and Yuval Ishai and Noga Ron{-}Zewi}, editor = {Chen{-}Mou Cheng and Kai{-}Min Chung and Giuseppe Persiano and Bo{-}Yin Yang}, title = {On Public Key Encryption from Noisy Codewords}, booktitle = {Public-Key Cryptography - {PKC} 2016 - 19th {IACR} International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {9615}, pages = {417--446}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49387-8\_16}, doi = {10.1007/978-3-662-49387-8\_16}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/pkc/Ben-SassonBDIR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/Ben-SassonCS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Nicholas Spooner}, editor = {Martin Hirt and Adam D. Smith}, title = {Interactive Oracle Proofs}, booktitle = {Theory of Cryptography - 14th International Conference, {TCC} 2016-B, Beijing, China, October 31 - November 3, 2016, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {9986}, pages = {31--60}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-53644-5\_2}, doi = {10.1007/978-3-662-53644-5\_2}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tcc/Ben-SassonCS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tcc/Ben-SassonCGV16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Ariel Gabizon and Madars Virza}, editor = {Eyal Kushilevitz and Tal Malkin}, title = {Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs}, booktitle = {Theory of Cryptography - 13th International Conference, {TCC} 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {9563}, pages = {33--64}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49099-0\_2}, doi = {10.1007/978-3-662-49099-0\_2}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/tcc/Ben-SassonCGV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Ben-SassonCFGRS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Michael A. Forbes and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, title = {On Probabilistic Checking in Perfect Zero Knowledge}, journal = {CoRR}, volume = {abs/1610.03798}, year = {2016}, url = {http://arxiv.org/abs/1610.03798}, eprinttype = {arXiv}, eprint = {1610.03798}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Ben-SassonCFGRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonBGR16, author = {Eli Ben{-}Sasson and Iddo Bentov and Ariel Gabizon and Michael Riabzev}, title = {Improved concrete efficiency and security analysis of Reed-Solomon PCPPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-073}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/073}, eprinttype = {ECCC}, eprint = {TR16-073}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonBGR16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonBGR16a, author = {Eli Ben{-}Sasson and Iddo Bentov and Ariel Gabizon and Michael Riabzev}, title = {A security analysis of Probabilistically Checkable Proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-149}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/149}, eprinttype = {ECCC}, eprint = {TR16-149}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonBGR16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCFGRS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Michael A. Forbes and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, title = {On Probabilistic Checking in Perfect Zero Knowledge}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-156}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/156}, eprinttype = {ECCC}, eprint = {TR16-156}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCFGRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCGRS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, title = {Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-046}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/046}, eprinttype = {ECCC}, eprint = {TR16-046}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCGRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCGV16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Ariel Gabizon and Madars Virza}, title = {Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR16-001}}, year = {2016}, url = {https://eccc.weizmann.ac.il/report/2016/001}, eprinttype = {ECCC}, eprint = {TR16-001}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCGV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCGV16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Ariel Gabizon and Madars Virza}, title = {Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {21}, year = {2016}, url = {http://eprint.iacr.org/2016/021}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCGV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Nicholas Spooner}, title = {Interactive Oracle Proofs}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {116}, year = {2016}, url = {http://eprint.iacr.org/2016/116}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCGRS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, title = {Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {324}, year = {2016}, url = {http://eprint.iacr.org/2016/324}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCGRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonBCGGH16, author = {Eli Ben{-}Sasson and Iddo Bentov and Alessandro Chiesa and Ariel Gabizon and Daniel Genkin and Matan Hamilis and Evgenya Pergament and Michael Riabzev and Mark Silberstein and Eran Tromer and Madars Virza}, title = {Computational integrity with a public random string from quasi-linear PCPs}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {646}, year = {2016}, url = {http://eprint.iacr.org/2016/646}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonBCGGH16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCFGRS16, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Michael A. Forbes and Ariel Gabizon and Michael Riabzev and Nicholas Spooner}, title = {On Probabilistic Checking in Perfect Zero Knowledge}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {988}, year = {2016}, url = {http://eprint.iacr.org/2016/988}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCFGRS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-SassonV15, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Composition of semi-LTCs by two-wise tensor products}, journal = {Comput. Complex.}, volume = {24}, number = {3}, pages = {601--643}, year = {2015}, url = {https://doi.org/10.1007/s00037-013-0074-8}, doi = {10.1007/S00037-013-0074-8}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Ben-SassonV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonR15, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi}, title = {From Affine to Two-Source Extractors via Approximate Duality}, journal = {{SIAM} J. Comput.}, volume = {44}, number = {6}, pages = {1670--1697}, year = {2015}, url = {https://doi.org/10.1137/12089003X}, doi = {10.1137/12089003X}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/Ben-SassonEGR15, author = {Eli Ben{-}Sasson and Tuvi Etzion and Ariel Gabizon and Netanel Raviv}, title = {Subspace polynomials and cyclic subspace codes}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2015, Hong Kong, China, June 14-19, 2015}, pages = {586--590}, publisher = {{IEEE}}, year = {2015}, url = {https://doi.org/10.1109/ISIT.2015.7282522}, doi = {10.1109/ISIT.2015.7282522}, timestamp = {Wed, 16 Oct 2019 14:14:48 +0200}, biburl = {https://dblp.org/rec/conf/isit/Ben-SassonEGR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sp/Ben-SassonC0TV15, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Matthew Green and Eran Tromer and Madars Virza}, title = {Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs}, booktitle = {2015 {IEEE} Symposium on Security and Privacy, {SP} 2015, San Jose, CA, USA, May 17-21, 2015}, pages = {287--304}, publisher = {{IEEE} Computer Society}, year = {2015}, url = {https://doi.org/10.1109/SP.2015.25}, doi = {10.1109/SP.2015.25}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sp/Ben-SassonC0TV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonBDIR15, author = {Eli Ben{-}Sasson and Iddo Bentov and Ivan Bjerre Damg{\aa}rd and Yuval Ishai and Noga Ron{-}Zewi}, title = {On Public Key Encryption from Noisy Codewords}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-094}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/094}, eprinttype = {ECCC}, eprint = {TR15-094}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonBDIR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonM15, author = {Eli Ben{-}Sasson and Gal Maor}, title = {Lower bound for communication complexity with no public randomness}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-139}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/139}, eprinttype = {ECCC}, eprint = {TR15-139}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonM15a, author = {Eli Ben{-}Sasson and Gal Maor}, title = {On the information leakage of public-output protocols}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR15-209}}, year = {2015}, url = {https://eccc.weizmann.ac.il/report/2015/209}, eprinttype = {ECCC}, eprint = {TR15-209}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonM15a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonBDIR15, author = {Eli Ben{-}Sasson and Iddo Bentov and Ivan Damg{\aa}rd and Yuval Ishai and Noga Ron{-}Zewi}, title = {On Public Key Encryption from Noisy Codewords}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {572}, year = {2015}, url = {http://eprint.iacr.org/2015/572}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonBDIR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Ben-SassonLR14, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Ron{-}Zewi}, title = {An Additive Combinatorics Approach Relating Rank to Communication Complexity}, journal = {J. {ACM}}, volume = {61}, number = {4}, pages = {22:1--22:18}, year = {2014}, url = {https://doi.org/10.1145/2629598}, doi = {10.1145/2629598}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonLR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonO14, title = {Special Section on the Fifty-Second {IEEE} Annual Symposium on Foundations of Computer Science {(FOCS} 2011)}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {2}, pages = {654}, year = {2014}, url = {https://doi.org/10.1137/14097361X}, doi = {10.1137/14097361X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonO14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/Ben-SassonCTV14, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, editor = {Juan A. Garay and Rosario Gennaro}, title = {Scalable Zero Knowledge via Cycles of Elliptic Curves}, booktitle = {Advances in Cryptology - {CRYPTO} 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8617}, pages = {276--294}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44381-1\_16}, doi = {10.1007/978-3-662-44381-1\_16}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/crypto/Ben-SassonCTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonV14, author = {Eli Ben{-}Sasson and Emanuele Viola}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Short PCPs with Projection Queries}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {163--173}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_14}, doi = {10.1007/978-3-662-43948-7\_14}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonRTW14, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi and Madhur Tulsiani and Julia Wolf}, editor = {Javier Esparza and Pierre Fraigniaud and Thore Husfeldt and Elias Koutsoupias}, title = {Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications}, booktitle = {Automata, Languages, and Programming - 41st International Colloquium, {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part {I}}, series = {Lecture Notes in Computer Science}, volume = {8572}, pages = {955--966}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-43948-7\_79}, doi = {10.1007/978-3-662-43948-7\_79}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonRTW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sp/Ben-SassonCG0MTV14, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Christina Garman and Matthew Green and Ian Miers and Eran Tromer and Madars Virza}, title = {Zerocash: Decentralized Anonymous Payments from Bitcoin}, booktitle = {2014 {IEEE} Symposium on Security and Privacy, {SP} 2014, Berkeley, CA, USA, May 18-21, 2014}, pages = {459--474}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/SP.2014.36}, doi = {10.1109/SP.2014.36}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sp/Ben-SassonCG0MTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/uss/Ben-SassonCTV14, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, editor = {Kevin Fu and Jaeyeon Jung}, title = {Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture}, booktitle = {Proceedings of the 23rd {USENIX} Security Symposium, San Diego, CA, USA, August 20-22, 2014}, pages = {781--796}, publisher = {{USENIX} Association}, year = {2014}, url = {https://www.usenix.org/conference/usenixsecurity14/technical-sessions/presentation/ben-sasson}, timestamp = {Mon, 01 Feb 2021 08:43:04 +0100}, biburl = {https://dblp.org/rec/conf/uss/Ben-SassonCTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Ben-SassonEGR14, author = {Eli Ben{-}Sasson and Tuvi Etzion and Ariel Gabizon and Netanel Raviv}, title = {Subspace Polynomials and Cyclic Subspace Codes}, journal = {CoRR}, volume = {abs/1404.7739}, year = {2014}, url = {http://arxiv.org/abs/1404.7739}, eprinttype = {arXiv}, eprint = {1404.7739}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Ben-SassonEGR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV14, author = {Eli Ben{-}Sasson and Emanuele Viola}, title = {Short PCPs with projection queries}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR14-017}}, year = {2014}, url = {https://eccc.weizmann.ac.il/report/2014/017}, eprinttype = {ECCC}, eprint = {TR14-017}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCG0MTV14, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Christina Garman and Matthew Green and Ian Miers and Eran Tromer and Madars Virza}, title = {Zerocash: Decentralized Anonymous Payments from Bitcoin}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {349}, year = {2014}, url = {http://eprint.iacr.org/2014/349}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCG0MTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCTV14, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, title = {Scalable Zero Knowledge via Cycles of Elliptic Curves}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {595}, year = {2014}, url = {http://eprint.iacr.org/2014/595}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCTV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Ben-SassonG13, author = {Eli Ben{-}Sasson and Ariel Gabizon}, title = {Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic}, journal = {Theory Comput.}, volume = {9}, pages = {665--683}, year = {2013}, url = {https://doi.org/10.4086/toc.2013.v009a021}, doi = {10.4086/TOC.2013.V009A021}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Ben-SassonG13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/Ben-SassonCGTV13, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer and Madars Virza}, editor = {Ran Canetti and Juan A. Garay}, title = {SNARKs for {C:} Verifying Program Executions Succinctly and in Zero Knowledge}, booktitle = {Advances in Cryptology - {CRYPTO} 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part {II}}, series = {Lecture Notes in Computer Science}, volume = {8043}, pages = {90--108}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40084-1\_6}, doi = {10.1007/978-3-642-40084-1\_6}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/crypto/Ben-SassonCGTV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonKKMS13, author = {Eli Ben{-}Sasson and Yohay Kaplan and Swastik Kopparty and Or Meir and Henning Stichtenoth}, title = {Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity}, booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2013, 26-29 October, 2013, Berkeley, CA, {USA}}, pages = {320--329}, publisher = {{IEEE} Computer Society}, year = {2013}, url = {https://doi.org/10.1109/FOCS.2013.42}, doi = {10.1109/FOCS.2013.42}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonKKMS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Ben-SassonCGT13, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer}, editor = {Robert D. Kleinberg}, title = {Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract}, booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley, CA, USA, January 9-12, 2013}, pages = {401--414}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2422436.2422481}, doi = {10.1145/2422436.2422481}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Ben-SassonCGT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonCGT13, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {On the concrete efficiency of probabilistically-checkable proofs}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {585--594}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488681}, doi = {10.1145/2488608.2488681}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonCGT13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonGKKS13, author = {Eli Ben{-}Sasson and Ariel Gabizon and Yohay Kaplan and Swastik Kopparty and Shubhangi Saraf}, editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum}, title = {A new family of locally correctable codes based on degree-lifted algebraic geometry codes}, booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013}, pages = {833--842}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2488608.2488714}, doi = {10.1145/2488608.2488714}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonGKKS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonKKMS13, author = {Eli Ben{-}Sasson and Yohay Kaplan and Swastik Kopparty and Or Meir and Henning Stichtenoth}, title = {Constant rate PCPs for circuit-SAT with sublinear query complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR13-085}}, year = {2013}, url = {https://eccc.weizmann.ac.il/report/2013/085}, eprinttype = {ECCC}, eprint = {TR13-085}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonKKMS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCGTV13, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer and Madars Virza}, title = {SNARKs for {C:} Verifying Program Executions Succinctly and in Zero Knowledge}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {507}, year = {2013}, url = {http://eprint.iacr.org/2013/507}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCGTV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCTV13, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Eran Tromer and Madars Virza}, title = {Succinct Non-Interactive Arguments for a von Neumann Architecture}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {879}, year = {2013}, url = {http://eprint.iacr.org/2013/879}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCTV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-SassonV12, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Towards lower bounds on locally testable codes via density arguments}, journal = {Comput. Complex.}, volume = {21}, number = {2}, pages = {267--309}, year = {2012}, url = {https://doi.org/10.1007/s00037-012-0042-8}, doi = {10.1007/S00037-012-0042-8}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Ben-SassonV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonK12, author = {Eli Ben{-}Sasson and Swastik Kopparty}, title = {Affine Dispersers from Subspace Polynomials}, journal = {{SIAM} J. Comput.}, volume = {41}, number = {4}, pages = {880--914}, year = {2012}, url = {https://doi.org/10.1137/110826254}, doi = {10.1137/110826254}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonG12, author = {Eli Ben{-}Sasson and Ariel Gabizon}, editor = {Anupam Gupta and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Rocco A. Servedio}, title = {Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, {APPROX} 2012, and 16th International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7408}, pages = {399--410}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32512-0\_34}, doi = {10.1007/978-3-642-32512-0\_34}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonG12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/crypto/Ben-SassonFO12, author = {Eli Ben{-}Sasson and Serge Fehr and Rafail Ostrovsky}, editor = {Reihaneh Safavi{-}Naini and Ran Canetti}, title = {Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority}, booktitle = {Advances in Cryptology - {CRYPTO} 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7417}, pages = {663--680}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-32009-5\_39}, doi = {10.1007/978-3-642-32009-5\_39}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/crypto/Ben-SassonFO12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonLR12, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Ron{-}Zewi}, title = {An Additive Combinatorics Approach Relating Rank to Communication Complexity}, booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2012, New Brunswick, NJ, USA, October 20-23, 2012}, pages = {177--186}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/FOCS.2012.39}, doi = {10.1109/FOCS.2012.39}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonLR12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonRS12, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi and Madhu Sudan}, title = {Sparse Affine-Invariant Linear Codes Are Locally Testable}, booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2012, New Brunswick, NJ, USA, October 20-23, 2012}, pages = {561--570}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/FOCS.2012.38}, doi = {10.1109/FOCS.2012.38}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1210-6917, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi and Madhur Tulsiani and Julia Wolf}, title = {Sampling-based proofs of almost-periodicity results and algorithmic applications}, journal = {CoRR}, volume = {abs/1210.6917}, year = {2012}, url = {http://arxiv.org/abs/1210.6917}, eprinttype = {arXiv}, eprint = {1210.6917}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1210-6917.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonCGT12, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer}, title = {On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-045}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/045}, eprinttype = {ECCC}, eprint = {TR12-045}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonCGT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonGKKS12, author = {Eli Ben{-}Sasson and Ariel Gabizon and Yohay Kaplan and Swastik Kopparty and Shubhangi Saraf}, title = {A new family of locally correctable codes based on degree-lifted algebraic geometry codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-148}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/148}, eprinttype = {ECCC}, eprint = {TR12-148}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGKKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonRS12, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi and Madhu Sudan}, title = {Sparse affine-invariant linear codes are locally testable}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-049}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/049}, eprinttype = {ECCC}, eprint = {TR12-049}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonRS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonRTW12, author = {Eli Ben{-}Sasson and Noga Ron{-}Zewi and Madhur Tulsiani and Julia Wolf}, title = {Sampling-based proofs of almost-periodicity results and algorithmic applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-135}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/135}, eprinttype = {ECCC}, eprint = {TR12-135}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonRTW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV12, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {A Combinatorial Characterization of smooth LTCs and Applications}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR12-159}}, year = {2012}, url = {https://eccc.weizmann.ac.il/report/2012/159}, eprinttype = {ECCC}, eprint = {TR12-159}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonCGT12, author = {Eli Ben{-}Sasson and Alessandro Chiesa and Daniel Genkin and Eran Tromer}, title = {Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {71}, year = {2012}, url = {http://eprint.iacr.org/2012/071}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonCGT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonGMSS11, author = {Eli Ben{-}Sasson and Elena Grigorescu and Ghid Maatouk and Amir Shpilka and Madhu Sudan}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {On Sums of Locally Testable Affine Invariant Properties}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, {APPROX} 2011, and 15th International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6845}, pages = {400--411}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_34}, doi = {10.1007/978-3-642-22935-0\_34}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonGMSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonS11, author = {Eli Ben{-}Sasson and Madhu Sudan}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {Limits on the Rate of Locally Testable Affine-Invariant Codes}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, {APPROX} 2011, and 15th International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6845}, pages = {412--423}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_35}, doi = {10.1007/978-3-642-22935-0\_35}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonMSS11, author = {Eli Ben{-}Sasson and Ghid Maatouk and Amir Shpilka and Madhu Sudan}, title = {Symmetric {LDPC} Codes are not Necessarily Locally Testable}, booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011}, pages = {55--65}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/CCC.2011.14}, doi = {10.1109/CCC.2011.14}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonMSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonV11, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Towards Lower Bounds on Locally Testable Codes via Density Arguments}, booktitle = {Proceedings of the 26th Annual {IEEE} Conference on Computational Complexity, {CCC} 2011, San Jose, California, USA, June 8-10, 2011}, pages = {66--76}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/CCC.2011.9}, doi = {10.1109/CCC.2011.9}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/Ben-SassonJ11, author = {Eli Ben{-}Sasson and Jan Johannsen}, editor = {Toby Walsh}, title = {Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width}, booktitle = {{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011}, pages = {2570--2575}, publisher = {{IJCAI/AAAI}}, year = {2011}, url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-428}, doi = {10.5591/978-1-57735-516-8/IJCAI11-428}, timestamp = {Tue, 20 Aug 2019 16:16:04 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/Ben-SassonJ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Ben-SassonN11, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, editor = {Bernard Chazelle}, title = {Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions}, booktitle = {Innovations in Computer Science - {ICS} 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings}, pages = {401--416}, publisher = {Tsinghua University Press}, year = {2011}, url = {http://conference.iiis.tsinghua.edu.cn/ICS2011/content/papers/3.html}, timestamp = {Mon, 23 Mar 2020 08:26:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Ben-SassonN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ZewiB11, author = {Noga Zewi and Eli Ben{-}Sasson}, editor = {Lance Fortnow and Salil P. Vadhan}, title = {From affine to two-source extractors via approximate duality}, booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC} 2011, San Jose, CA, USA, 6-8 June 2011}, pages = {177--186}, publisher = {{ACM}}, year = {2011}, url = {https://doi.org/10.1145/1993636.1993661}, doi = {10.1145/1993636.1993661}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ZewiB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-5884, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Zewi}, title = {An additive combinatorics approach to the log-rank conjecture in communication complexity}, journal = {CoRR}, volume = {abs/1111.5884}, year = {2011}, url = {http://arxiv.org/abs/1111.5884}, eprinttype = {arXiv}, eprint = {1111.5884}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-5884.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonG11, author = {Eli Ben{-}Sasson and Ariel Gabizon}, title = {Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-129}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/129}, eprinttype = {ECCC}, eprint = {TR11-129}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonGMSS11, author = {Eli Ben{-}Sasson and Elena Grigorescu and Ghid Maatouk and Amir Shpilka and Madhu Sudan}, title = {On Sums of Locally Testable Affine Invariant Properties}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-079}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/079}, eprinttype = {ECCC}, eprint = {TR11-079}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGMSS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonLZ11, author = {Eli Ben{-}Sasson and Shachar Lovett and Noga Zewi}, title = {An additive combinatorics approach to the log-rank conjecture in communication complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-157}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/157}, eprinttype = {ECCC}, eprint = {TR11-157}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonLZ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV11, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Composition of semi-LTCs by two-wise Tensor Products}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-070}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/070}, eprinttype = {ECCC}, eprint = {TR11-070}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iacr/Ben-SassonFO11, author = {Eli Ben{-}Sasson and Serge Fehr and Rafail Ostrovsky}, title = {Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority}, journal = {{IACR} Cryptol. ePrint Arch.}, pages = {629}, year = {2011}, url = {http://eprint.iacr.org/2011/629}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iacr/Ben-SassonFO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-SassonI10, author = {Eli Ben{-}Sasson and Russell Impagliazzo}, title = {Random Cnf's are Hard for the Polynomial Calculus}, journal = {Comput. Complex.}, volume = {19}, number = {4}, pages = {501--519}, year = {2010}, url = {https://doi.org/10.1007/s00037-010-0293-1}, doi = {10.1007/S00037-010-0293-1}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Ben-SassonI10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonGKSV10, author = {Eli Ben{-}Sasson and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan and Michael Viderman}, title = {Locally Testable Codes Require Redundant Testers}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {7}, pages = {3230--3247}, year = {2010}, url = {https://doi.org/10.1137/090779875}, doi = {10.1137/090779875}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonGKSV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Ben-SassonKR10, author = {Eli Ben{-}Sasson and Swastik Kopparty and Jaikumar Radhakrishnan}, title = {Subspace polynomials and limits to list decoding of Reed-Solomon codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {56}, number = {1}, pages = {113--120}, year = {2010}, url = {https://doi.org/10.1109/TIT.2009.2034780}, doi = {10.1109/TIT.2009.2034780}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Ben-SassonKR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tocl/Ben-SassonH10, author = {Eli Ben{-}Sasson and Prahladh Harsha}, title = {Lower bounds for bounded depth Frege proofs via Pudl{\'{a}}k-Buss games}, journal = {{ACM} Trans. Comput. Log.}, volume = {11}, number = {3}, pages = {19:1--19:17}, year = {2010}, url = {https://doi.org/10.1145/1740582.1740587}, doi = {10.1145/1740582.1740587}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tocl/Ben-SassonH10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonV10, author = {Eli Ben{-}Sasson and Michael Viderman}, editor = {Maria J. Serna and Ronen Shaltiel and Klaus Jansen and Jos{\'{e}} D. P. Rolim}, title = {Low Rate Is Insufficient for Local Testability}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, {APPROX} 2010, and 14th International Workshop, {RANDOM} 2010, Barcelona, Spain, September 1-3, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6302}, pages = {420--433}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15369-3\_32}, doi = {10.1007/978-3-642-15369-3\_32}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sat/Ben-SassonJ10, author = {Eli Ben{-}Sasson and Jan Johannsen}, editor = {Ofer Strichman and Stefan Szeider}, title = {Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas}, booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6175}, pages = {16--29}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14186-7\_4}, doi = {10.1007/978-3-642-14186-7\_4}, timestamp = {Sat, 19 Oct 2019 20:28:15 +0200}, biburl = {https://dblp.org/rec/conf/sat/Ben-SassonJ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/propertytesting/Ben-Sasson10, author = {Eli Ben{-}Sasson}, editor = {Oded Goldreich}, title = {Limitation on the Rate of Families of Locally Testable Codes}, booktitle = {Property Testing - Current Research and Surveys}, series = {Lecture Notes in Computer Science}, volume = {6390}, pages = {13--31}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16367-8\_3}, doi = {10.1007/978-3-642-16367-8\_3}, timestamp = {Tue, 01 Jun 2021 15:22:56 +0200}, biburl = {https://dblp.org/rec/conf/propertytesting/Ben-Sasson10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1008-1789, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions}, journal = {CoRR}, volume = {abs/1008.1789}, year = {2010}, url = {http://arxiv.org/abs/1008.1789}, eprinttype = {arXiv}, eprint = {1008.1789}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1008-1789.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-IsraelBK10, author = {Shir Ben{-}Israel and Eli Ben{-}Sasson and David R. Karger}, title = {Breaking local symmetries can dramatically reduce the length of propositional refutations}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-068}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/068}, eprinttype = {ECCC}, eprint = {TR10-068}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-IsraelBK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-Sasson10, author = {Eli Ben{-}Sasson}, title = {Limitation on the rate of families of locally testable codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-123}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/123}, eprinttype = {ECCC}, eprint = {TR10-123}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-Sasson10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonJ10, author = {Eli Ben{-}Sasson and Jan Johannsen}, title = {Lower bounds for width-restricted clause learning on small width formulas}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-085}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/085}, eprinttype = {ECCC}, eprint = {TR10-085}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonJ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonK10, author = {Eli Ben{-}Sasson and Swastik Kopparty}, title = {Affine Dispersers from Subspace Polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-044}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/044}, eprinttype = {ECCC}, eprint = {TR10-044}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonMSS10, author = {Eli Ben{-}Sasson and Ghid Maatouk and Amir Shpilka and Madhu Sudan}, title = {Symmetric {LDPC} codes are not necessarily locally testable}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-199}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/199}, eprinttype = {ECCC}, eprint = {TR10-199}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonMSS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonN10, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-125}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/125}, eprinttype = {ECCC}, eprint = {TR10-125}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonN10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonS10, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Limits on the rate of locally testable affine-invariant codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-108}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/108}, eprinttype = {ECCC}, eprint = {TR10-108}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV10, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Low Rate Is Insufficient for Local Testability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-004}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/004}, eprinttype = {ECCC}, eprint = {TR10-004}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonV10a, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Towards lower bounds on locally testable codes via density arguments}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-200}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/200}, eprinttype = {ECCC}, eprint = {TR10-200}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonV10a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonZ10, author = {Eli Ben{-}Sasson and Noga Zewi}, title = {From Affine to Two-Source Extractors via Approximate Duality}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-144}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/144}, eprinttype = {ECCC}, eprint = {TR10-144}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonZ10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Ben-SassonV09, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Tensor Products of Weakly Smooth Codes are Robust}, journal = {Theory Comput.}, volume = {5}, number = {1}, pages = {239--255}, year = {2009}, url = {https://doi.org/10.4086/toc.2009.v005a012}, doi = {10.4086/TOC.2009.V005A012}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Ben-SassonV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/Ben-SassonHLM09, author = {Eli Ben{-}Sasson and Prahladh Harsha and Oded Lachish and Arie Matsliah}, title = {Sound 3-Query PCPPs Are Long}, journal = {{ACM} Trans. Comput. Theory}, volume = {1}, number = {2}, pages = {7:1--7:49}, year = {2009}, url = {https://doi.org/10.1145/1595391.1595394}, doi = {10.1145/1595391.1595394}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/Ben-SassonHLM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonV09, author = {Eli Ben{-}Sasson and Michael Viderman}, editor = {Irit Dinur and Klaus Jansen and Joseph Naor and Jos{\'{e}} D. P. Rolim}, title = {Composition of Semi-LTCs by Two-Wise Tensor Products}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, {APPROX} 2009, and 13th International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5687}, pages = {378--391}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03685-9\_29}, doi = {10.1007/978-3-642-03685-9\_29}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonGKSV09, author = {Eli Ben{-}Sasson and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan and Michael Viderman}, title = {Locally Testable Codes Require Redundant Testers}, booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational Complexity, {CCC} 2009, Paris, France, 15-18 July 2009}, pages = {52--61}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/CCC.2009.6}, doi = {10.1109/CCC.2009.6}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonGKSV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonK09, author = {Eli Ben{-}Sasson and Swastik Kopparty}, editor = {Michael Mitzenmacher}, title = {Affine dispersers from subspace polynomials}, booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing, {STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009}, pages = {65--74}, publisher = {{ACM}}, year = {2009}, url = {https://doi.org/10.1145/1536414.1536426}, doi = {10.1145/1536414.1536426}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonGKSV09, author = {Eli Ben{-}Sasson and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan and Michael Viderman}, title = {Locally Testable Codes Require Redundant Testers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-126}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/126}, eprinttype = {ECCC}, eprint = {TR09-126}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGKSV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonN09, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-002}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/002}, eprinttype = {ECCC}, eprint = {TR09-002}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonN09a, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-034}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/034}, eprinttype = {ECCC}, eprint = {TR09-034}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonN09a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonN09b, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {A Space Hierarchy for k-DNF Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-047}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/047}, eprinttype = {ECCC}, eprint = {TR09-047}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonN09b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonVV09, author = {Eli Ben{-}Sasson and Michael Viderman}, title = {Tensor Products of Weakly Smooth Codes are Robust}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-007}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/007}, eprinttype = {ECCC}, eprint = {TR09-007}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonVV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonS08, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Short PCPs with Polylog Query Complexity}, journal = {{SIAM} J. Comput.}, volume = {38}, number = {2}, pages = {551--607}, year = {2008}, url = {https://doi.org/10.1137/050646445}, doi = {10.1137/050646445}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonV08, author = {Eli Ben{-}Sasson and Michael Viderman}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Tensor Products of Weakly Smooth Codes Are Robust}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {290--302}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_24}, doi = {10.1007/978-3-540-85363-3\_24}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonN08, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, title = {Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {709--718}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.42}, doi = {10.1109/FOCS.2008.42}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ben-SassonHLM08, author = {Eli Ben{-}Sasson and Prahladh Harsha and Oded Lachish and Arie Matsliah}, editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and Magn{\'{u}}s M. Halld{\'{o}}rsson and Anna Ing{\'{o}}lfsd{\'{o}}ttir and Igor Walukiewicz}, title = {Sound 3-Query PCPPs Are Long}, booktitle = {Automata, Languages and Programming, 35th International Colloquium, {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part {I:} Tack {A:} Algorithms, Automata, Complexity, and Games}, series = {Lecture Notes in Computer Science}, volume = {5125}, pages = {686--697}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-70575-8\_56}, doi = {10.1007/978-3-540-70575-8\_56}, timestamp = {Fri, 27 Mar 2020 09:02:59 +0100}, biburl = {https://dblp.org/rec/conf/icalp/Ben-SassonHLM08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/Ben-SassonN08, author = {Eli Ben{-}Sasson and Jakob Nordstr{\"{o}}m}, editor = {Peter Bro Miltersen and R{\"{u}}diger Reischuk and Georg Schnitger and Dieter van Melkebeek}, title = {Understanding space in resolution: optimal lower bounds and exponential trade-offs}, booktitle = {Computational Complexity of Discrete Problems, 14.09. - 19.09.2008}, series = {Dagstuhl Seminar Proceedings}, volume = {08381}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {http://drops.dagstuhl.de/opus/volltexte/2008/1781/}, timestamp = {Thu, 10 Jun 2021 13:02:05 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/Ben-SassonN08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AlekhnovichB07, author = {Mikhail Alekhnovich and Eli Ben{-}Sasson}, title = {Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {5}, pages = {1248--1263}, year = {2007}, url = {https://doi.org/10.1137/S0097539704440107}, doi = {10.1137/S0097539704440107}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AlekhnovichB07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/MatsliahBHL07, author = {Arie Matsliah and Eli Ben{-}Sasson and Prahladh Harsha and Oded Lachish}, title = {Sound 3-query PCPPs are Long}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-127}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-127/index.html}, eprinttype = {ECCC}, eprint = {TR07-127}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/MatsliahBHL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Ben-SassonS06, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Robust locally testable codes and products of codes}, journal = {Random Struct. Algorithms}, volume = {28}, number = {4}, pages = {387--402}, year = {2006}, url = {https://doi.org/10.1002/rsa.20120}, doi = {10.1002/RSA.20120}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Ben-SassonS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonGHSV06, author = {Eli Ben{-}Sasson and Oded Goldreich and Prahladh Harsha and Madhu Sudan and Salil P. Vadhan}, title = {Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {4}, pages = {889--974}, year = {2006}, url = {https://doi.org/10.1137/S0097539705446810}, doi = {10.1137/S0097539705446810}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonGHSV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonKR06, author = {Eli Ben{-}Sasson and Swastik Kopparty and Jaikumar Radhakrishnan}, title = {Subspace Polynomials and List Decoding of Reed-Solomon Codes}, booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings}, pages = {207--216}, publisher = {{IEEE} Computer Society}, year = {2006}, url = {https://doi.org/10.1109/FOCS.2006.73}, doi = {10.1109/FOCS.2006.73}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonKR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/Ben-SassonKK06, author = {Eli Ben{-}Sasson and Adam Tauman Kalai and Ehud Kalai}, editor = {Bernhard Sch{\"{o}}lkopf and John C. Platt and Thomas Hofmann}, title = {An Approach to Bounded Rationality}, booktitle = {Advances in Neural Information Processing Systems 19, Proceedings of the Twentieth Annual Conference on Neural Information Processing Systems, Vancouver, British Columbia, Canada, December 4-7, 2006}, pages = {145--152}, publisher = {{MIT} Press}, year = {2006}, url = {https://proceedings.neurips.cc/paper/2006/hash/bd85282513da4089c441926e1975898c-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/Ben-SassonKK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonHR05, author = {Eli Ben{-}Sasson and Prahladh Harsha and Sofya Raskhodnikova}, title = {Some 3CNF Properties Are Hard to Test}, journal = {{SIAM} J. Comput.}, volume = {35}, number = {1}, pages = {1--21}, year = {2005}, url = {https://doi.org/10.1137/S0097539704445445}, doi = {10.1137/S0097539704445445}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonHR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonGHSV05, author = {Eli Ben{-}Sasson and Oded Goldreich and Prahladh Harsha and Madhu Sudan and Salil P. Vadhan}, title = {Short PCPs Verifiable in Polylogarithmic Time}, booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005), 11-15 June 2005, San Jose, CA, {USA}}, pages = {120--134}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/CCC.2005.27}, doi = {10.1109/CCC.2005.27}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonGHSV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonS05, author = {Eli Ben{-}Sasson and Madhu Sudan}, editor = {Harold N. Gabow and Ronald Fagin}, title = {Simple PCPs with poly-log rate and query complexity}, booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005}, pages = {266--275}, publisher = {{ACM}}, year = {2005}, url = {https://doi.org/10.1145/1060590.1060631}, doi = {10.1145/1060590.1060631}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/Ben-SassonIW04, author = {Eli Ben{-}Sasson and Russell Impagliazzo and Avi Wigderson}, title = {Near Optimal Separation Of Tree-Like And General Resolution}, journal = {Comb.}, volume = {24}, number = {4}, pages = {585--603}, year = {2004}, url = {https://doi.org/10.1007/s00493-004-0036-5}, doi = {10.1007/S00493-004-0036-5}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/Ben-SassonIW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AlekhnovichBRW04, author = {Michael Alekhnovich and Eli Ben{-}Sasson and Alexander A. Razborov and Avi Wigderson}, title = {Pseudorandom Generators in Propositional Proof Complexity}, journal = {{SIAM} J. Comput.}, volume = {34}, number = {1}, pages = {67--88}, year = {2004}, url = {https://doi.org/10.1137/S0097539701389944}, doi = {10.1137/S0097539701389944}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AlekhnovichBRW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/Ben-SassonS04, author = {Eli Ben{-}Sasson and Madhu Sudan}, editor = {Klaus Jansen and Sanjeev Khanna and Jos{\'{e}} D. P. Rolim and Dana Ron}, title = {Robust Locally Testable Codes and Products of Codes}, booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3122}, pages = {286--297}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27821-4\_26}, doi = {10.1007/978-3-540-27821-4\_26}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/Ben-SassonS04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonGHSV04, author = {Eli Ben{-}Sasson and Oded Goldreich and Prahladh Harsha and Madhu Sudan and Salil P. Vadhan}, editor = {L{\'{a}}szl{\'{o}} Babai}, title = {Robust pcps of proximity, shorter pcps and applications to coding}, booktitle = {Proceedings of the 36th Annual {ACM} Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004}, pages = {1--10}, publisher = {{ACM}}, year = {2004}, url = {https://doi.org/10.1145/1007352.1007361}, doi = {10.1145/1007352.1007361}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonGHSV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/cs-IT-0408066, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Robust Locally Testable Codes and Products of Codes}, journal = {CoRR}, volume = {cs.IT/0408066}, year = {2004}, url = {http://arxiv.org/abs/cs.IT/0408066}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/cs-IT-0408066.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-016, author = {Michael Alekhnovich and Eli Ben{-}Sasson}, title = {Linear Upper Bounds for Random Walk on Small Density Random 3CNFs}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-016}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-016/index.html}, eprinttype = {ECCC}, eprint = {TR04-016}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-016.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-021, author = {Eli Ben{-}Sasson and Oded Goldreich and Prahladh Harsha and Madhu Sudan and Salil P. Vadhan}, title = {Robust PCPs of Proximity, Shorter PCPs and Applications to Coding}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-021}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-021/index.html}, eprinttype = {ECCC}, eprint = {TR04-021}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-021.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-046, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Robust Locally Testable Codes and Products of Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-046}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-046/index.html}, eprinttype = {ECCC}, eprint = {TR04-046}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-046.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR04-060, author = {Eli Ben{-}Sasson and Madhu Sudan}, title = {Simple PCPs with Poly-log Rate and Query Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR04-060}}, year = {2004}, url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-060/index.html}, eprinttype = {ECCC}, eprint = {TR04-060}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-060.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/rsa/Ben-SassonG03, author = {Eli Ben{-}Sasson and Nicola Galesi}, title = {Space complexity of random formulae in resolution}, journal = {Random Struct. Algorithms}, volume = {23}, number = {1}, pages = {92--109}, year = {2003}, url = {https://doi.org/10.1002/rsa.10089}, doi = {10.1002/RSA.10089}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/rsa/Ben-SassonG03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AlekhnovichB03, author = {Michael Alekhnovich and Eli Ben{-}Sasson}, title = {Linear Upper Bounds for Random Walk on Small Density Random 3-CNF}, booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings}, pages = {352--361}, publisher = {{IEEE} Computer Society}, year = {2003}, url = {https://doi.org/10.1109/SFCS.2003.1238209}, doi = {10.1109/SFCS.2003.1238209}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/AlekhnovichB03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/Ben-SassonGS03, author = {Eli Ben{-}Sasson and Oded Goldreich and Madhu Sudan}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Bounds on 2-Query Codeword Testing}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {216--227}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_19}, doi = {10.1007/978-3-540-45198-3\_19}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/Ben-SassonGS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonHR03, author = {Eli Ben{-}Sasson and Prahladh Harsha and Sofya Raskhodnikova}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Some 3CNF properties are hard to test}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {345--354}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780594}, doi = {10.1145/780542.780594}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonHR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonSVW03, author = {Eli Ben{-}Sasson and Madhu Sudan and Salil P. Vadhan and Avi Wigderson}, editor = {Lawrence L. Larmore and Michel X. Goemans}, title = {Randomness-efficient low degree tests and short PCPs via epsilon-biased sets}, booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, {USA}}, pages = {612--621}, publisher = {{ACM}}, year = {2003}, url = {https://doi.org/10.1145/780542.780631}, doi = {10.1145/780542.780631}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonSVW03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR03-004, author = {Eli Ben{-}Sasson and Prahladh Harsha}, title = {Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR03-004}}, year = {2003}, url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-004/index.html}, eprinttype = {ECCC}, eprint = {TR03-004}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-004.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR03-006, author = {Eli Ben{-}Sasson and Prahladh Harsha and Sofya Raskhodnikova}, title = {3CNF Properties are Hard to Test}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR03-006}}, year = {2003}, url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-006/index.html}, eprinttype = {ECCC}, eprint = {TR03-006}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-006.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR03-019, author = {Eli Ben{-}Sasson and Oded Goldreich and Madhu Sudan}, title = {Bounds on 2-Query Codeword Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR03-019}}, year = {2003}, url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-019/index.html}, eprinttype = {ECCC}, eprint = {TR03-019}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-019.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-Sasson02, author = {Eli Ben{-}Sasson}, title = {Hard examples for the bounded depth Frege proof system}, journal = {Comput. Complex.}, volume = {11}, number = {3-4}, pages = {109--136}, year = {2002}, url = {https://doi.org/10.1007/s00037-002-0172-5}, doi = {10.1007/S00037-002-0172-5}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Ben-Sasson02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/AlekhnovichBRW02, author = {Michael Alekhnovich and Eli Ben{-}Sasson and Alexander A. Razborov and Avi Wigderson}, title = {Space Complexity in Propositional Calculus}, journal = {{SIAM} J. Comput.}, volume = {31}, number = {4}, pages = {1184--1211}, year = {2002}, url = {https://doi.org/10.1137/S0097539700366735}, doi = {10.1137/S0097539700366735}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/AlekhnovichBRW02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-Sasson02, author = {Eli Ben{-}Sasson}, title = {Hard Examples for Bounded Depth Frege}, booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24, 2002}, pages = {4}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/CCC.2002.1004323}, doi = {10.1109/CCC.2002.1004323}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-Sasson02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-Sasson02, author = {Eli Ben{-}Sasson}, editor = {John H. Reif}, title = {Size space tradeoffs for resolution}, booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing, May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {457--464}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/509907.509975}, doi = {10.1145/509907.509975}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-Sasson02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-Sasson02a, author = {Eli Ben{-}Sasson}, editor = {John H. Reif}, title = {Hard examples for bounded depth frege}, booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing, May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada}, pages = {563--572}, publisher = {{ACM}}, year = {2002}, url = {https://doi.org/10.1145/509907.509988}, doi = {10.1145/509907.509988}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-Sasson02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR02-003, author = {Eli Ben{-}Sasson and Yonatan Bilu}, title = {A Gap in Average Proof Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR02-003}}, year = {2002}, url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-003/index.html}, eprinttype = {ECCC}, eprint = {TR02-003}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-003.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/il/Ben-Sasson01, author = {Eli Ben{-}Sasson}, title = {Expansion in proof complexity. ({\unicode{1492}}{\unicode{1512}}{\unicode{1495}}{\unicode{1489}}{\unicode{1492}} {\unicode{1493}}{\unicode{1502}}{\unicode{1493}}{\unicode{1512}}{\unicode{1499}}{\unicode{1489}}{\unicode{1493}}{\unicode{1514}} {\unicode{1492}}{\unicode{1493}}{\unicode{1499}}{\unicode{1495}}{\unicode{1493}}{\unicode{1514}}.)}, school = {Hebrew University of Jerusalem, Israel}, year = {2001}, url = {https://huji-primo.hosted.exlibrisgroup.com/permalink/f/13ns5ae/972HUJI\_ALMA21159933340003701}, timestamp = {Wed, 14 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/phd/il/Ben-Sasson01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Ben-SassonW01, author = {Eli Ben{-}Sasson and Avi Wigderson}, title = {Short proofs are narrow - resolution made simple}, journal = {J. {ACM}}, volume = {48}, number = {2}, pages = {149--169}, year = {2001}, url = {https://doi.org/10.1145/375827.375835}, doi = {10.1145/375827.375835}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonG01, author = {Eli Ben{-}Sasson and Nicola Galesi}, title = {Space Complexity of Random Formulae in Resolution}, booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001}, pages = {42--51}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/CCC.2001.933871}, doi = {10.1109/CCC.2001.933871}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR01-031, author = {Eli Ben{-}Sasson and Nicola Galesi}, title = {Space Complexity of Random Formulae in Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR01-031}}, year = {2001}, url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-031/index.html}, eprinttype = {ECCC}, eprint = {TR01-031}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-031.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AlekhnovichBRW00, author = {Michael Alekhnovich and Eli Ben{-}Sasson and Alexander A. Razborov and Avi Wigderson}, title = {Pseudorandom Generators in Propositional Proof Complexity}, booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000, 12-14 November 2000, Redondo Beach, California, {USA}}, pages = {43--53}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/SFCS.2000.892064}, doi = {10.1109/SFCS.2000.892064}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/AlekhnovichBRW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlekhnovichBRW00, author = {Michael Alekhnovich and Eli Ben{-}Sasson and Alexander A. Razborov and Avi Wigderson}, editor = {F. Frances Yao and Eugene M. Luks}, title = {Space complexity in propositional calculus}, booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory of Computing, May 21-23, 2000, Portland, OR, {USA}}, pages = {358--367}, publisher = {{ACM}}, year = {2000}, url = {https://doi.org/10.1145/335305.335347}, doi = {10.1145/335305.335347}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AlekhnovichBRW00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR00-005, author = {Eli Ben{-}Sasson and Russell Impagliazzo and Avi Wigderson}, title = {Near-Optimal Separation of Treelike and General Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR00-005}}, year = {2000}, url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-005/index.html}, eprinttype = {ECCC}, eprint = {TR00-005}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR00-023, author = {Michael Alekhnovich and Eli Ben{-}Sasson and Alexander A. Razborov and Avi Wigderson}, title = {Pseudorandom Generators in Propositional Proof Complexity}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR00-023}}, year = {2000}, url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-023/index.html}, eprinttype = {ECCC}, eprint = {TR00-023}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonW99, author = {Eli Ben{-}Sasson and Avi Wigderson}, title = {Short Proofs Are Narrow - Resolution Made Simple (Abstract)}, booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999}, pages = {2}, publisher = {{IEEE} Computer Society}, year = {1999}, url = {https://doi.org/10.1109/CCC.1999.766251}, doi = {10.1109/CCC.1999.766251}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Ben-SassonI99, author = {Eli Ben{-}Sasson and Russell Impagliazzo}, title = {Random CNF's are Hard for the Polynomial Calculus}, booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99, 17-18 October, 1999, New York, NY, {USA}}, pages = {415--421}, publisher = {{IEEE} Computer Society}, year = {1999}, url = {https://doi.org/10.1109/SFFCS.1999.814613}, doi = {10.1109/SFFCS.1999.814613}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Ben-SassonI99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-SassonW99, author = {Eli Ben{-}Sasson and Avi Wigderson}, editor = {Jeffrey Scott Vitter and Lawrence L. Larmore and Frank Thomson Leighton}, title = {Short Proofs are Narrow - Resolution Made Simple}, booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of Computing, May 1-4, 1999, Atlanta, Georgia, {USA}}, pages = {517--526}, publisher = {{ACM}}, year = {1999}, url = {https://doi.org/10.1145/301250.301392}, doi = {10.1145/301250.301392}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Ben-SassonW99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-022, author = {Eli Ben{-}Sasson and Avi Wigderson}, title = {Short Proofs are Narrow - Resolution made Simple}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-022}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-022/index.html}, eprinttype = {ECCC}, eprint = {TR99-022}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR99-040, author = {Michael Alekhnovich and Eli Ben{-}Sasson and Alexander A. Razborov and Avi Wigderson}, title = {Space Complexity in Propositional Calculus}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR99-040}}, year = {1999}, url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-040/index.html}, eprinttype = {ECCC}, eprint = {TR99-040}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-040.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.