Eli Ben‐Sasson
Impact in
- Computational Theory and Mathematics top 0.5%
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Formal Methods in Verification
- Artificial Intelligence top 1%
- Cryptography and Data Security
- Logic, programming, and type systems
- Coding theory and cryptography
- Logic, Reasoning, and Knowledge
Papers in
-
- Complexity and Algorithms in Graphs 36
- semigroups and automata theory 13
- Formal Methods in Verification 13
- Advanced Graph Theory Research 10
-
- Cryptography and Data Security 30
- Coding theory and cryptography 15
- Logic, programming, and type systems 13
- Logic, Reasoning, and Knowledge 10
- Co-authors
- Avi WigdersonMadhu SudanAlessandro ChiesaEran TromerMadars VirzaPrahladh HarshaRussell ImpagliazzoSalil Vadhan
- Journals
- SIAM Journal on Computing (9 papers)Computational Complexity (3 papers)Theory of Computing (2 papers)Journal of the ACM (2 papers)IEEE Transactions on Information Theory (2 papers)
- Partner nations
- IsraelUnited StatesSwitzerland
In The Last Decade
Eli Ben‐Sasson
81 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 73
- Computational Theory and Mathematics 1.1k
- Artificial Intelligence 1.3k
- Discrete Mathematics and Combinatorics 81
- Computer Networks and Communications 360
- Computer Graphics and Computer-Aided Design 44
Countries citing papers authored by Eli Ben‐Sasson
This map shows the geographic impact of Eli Ben‐Sasson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eli Ben‐Sasson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eli Ben‐Sasson more than expected).
Fields of papers citing papers by Eli Ben‐Sasson
This network shows the impact of papers produced by Eli Ben‐Sasson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eli Ben‐Sasson. The network helps show where Eli Ben‐Sasson may publish in the future.
Co-authors
The 25 scholars most cited alongside Eli Ben‐Sasson, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. | 2016 | 3 |
| 2 | Improved concrete efficiency and security analysis of Reed-Solomon PCPPs. | 2016 | 0 |
| 3 | 2015 | 1 | |
| 4 | 2013 | 5 | |
| 5 | 2013 | 7 | |
| 6 | A new family of locally correctable codes based on degree-lifted algebraic geometry codes. | 2012 | 1 |
| 7 | Sparse affine-invariant linear codes are locally testable. | 2012 | 1 |
| 8 | On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs | 2012 | 8 |
| 9 | On Sums of Locally Testable Affine Invariant Properties. | 2011 | 1 |
| 10 | Limits on the Rate of Locally Testable Affine-Invariant Codes | 2010 | 8 |
| 11 | Symmetric LDPC codes are not necessarily locally testable. | 2010 | 1 |
| 12 | Breaking local symmetries can dramatically reduce the length of propositional refutations. | 2010 | 1 |
| 13 | A Space Hierarchy for k-DNF Resolution | 2009 | 5 |
| 14 | 2009 | 20 | |
| 15 | Sound 3-query PCPPs are Long. | 2007 | 3 |
| 16 | Bounds on 2-Query Codeword Testing. | 2003 | 3 |
| 17 | 3CNF Properties are Hard to Test | 2003 | 6 |
| 18 | Pseudorandom Generators in Propositional Proof Complexity | 2000 | 2 |
| 19 | 2000 | 41 | |
| 20 | 1999 | 64 |
About Eli Ben‐Sasson
Eli Ben‐Sasson is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Software and Computer Networks and Communications, having authored 85 papers that have together received 1.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (36 papers), Cryptography and Data Security (30 papers), Coding theory and cryptography (15 papers), semigroups and automata theory (13 papers), Logic, programming, and type systems (13 papers), Formal Methods in Verification (13 papers), Logic, Reasoning, and Knowledge (10 papers) and Advanced Graph Theory Research (10 papers). The work is most often cited by research in Computational Theory and Mathematics (1.1k citations), Artificial Intelligence (1.3k citations), Discrete Mathematics and Combinatorics (81 citations), Computer Networks and Communications (360 citations) and Computer Graphics and Computer-Aided Design (44 citations). Eli Ben‐Sasson has collaborated with scholars based in Israel, United States and Switzerland. Frequent co-authors include Avi Wigderson, Madhu Sudan, Alessandro Chiesa, Eran Tromer, Madars Virza, Prahladh Harsha, Russell Impagliazzo, Salil Vadhan, Oded Goldreich and Sofya Raskhodnikova. Their work appears in journals such as SIAM Journal on Computing, Computational Complexity, Theory of Computing, Journal of the ACM and IEEE Transactions on Information Theory.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.