Shachar Lovett
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 1%
- Discrete Mathematics and Combinatorics top 5%
- Electrical and Electronic Engineering
- Computer Networks and Communications top 10%
- Co-authors
- Tali KaufmanRaghu MekaYevgeniy DodisZeev DvirHamed HatamiYael Tauman KalaiEly PoratRoy Meshulam
- Topics
- Complexity and Algorithms in Graphs (44 papers)Coding theory and cryptography (34 papers)Limits and Structures in Graph Theory (29 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsArtificial Intelligence
- Journals
- SHILAP Revista de lepidopterologíaIEEE Transactions on Information TheoryJournal of the ACM
- Partner nations
- United StatesIsraelCanada
In The Last Decade
Shachar Lovett
97 papers receiving 608 citations
Peers
Comparison fields: 5 of 49
- Artificial Intelligence 402
- Computational Theory and Mathematics 353
- Discrete Mathematics and Combinatorics 151
- Electrical and Electronic Engineering 125
- Computer Networks and Communications 119
Countries citing papers authored by Shachar Lovett
This map shows the geographic impact of Shachar Lovett'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 Shachar Lovett with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Shachar Lovett more than expected).
Fields of papers citing papers by Shachar Lovett
This network shows the impact of papers produced by Shachar Lovett. 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 Shachar Lovett. The network helps show where Shachar Lovett may publish in the future.
Co-authorship network of co-authors of Shachar Lovett
This figure shows the co-authorship network connecting the top 25 collaborators of Shachar Lovett. A scholar is included among the top collaborators of Shachar Lovett based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Shachar Lovett. Shachar Lovett is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 1 | |
| 3 | Codes over integers, and the singularity of random matrices with large entries | 1 |
| 4 | 3 | |
| 5 | 2 | |
| 6 | 11 | |
| 7 | The analytic rank of tensors is subadditive, and its applications | 1 |
| 8 | 5 | |
| 9 | 3 | |
| 10 | 6 | |
| 11 | 11 | |
| 12 | 5 | |
| 13 | Linear systems over abelian groups. | 0 |
| 14 | Correlation bounds for poly-size AC 0 circuits with n 1-o(1) symmetric gates | 3 |
| 15 | 0 | |
| 16 | 8 | |
| 17 | Testing of exponentially large codes, by a new extension to Weil bound for character sums. | 4 |
| 18 | Explicit lower bound for fooling polynomials by the sum of small-bias generators. | 3 |
| 19 | 21 | |
| 20 | 25 |
About Shachar Lovett
Shachar Lovett is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Algebra and Number Theory, having authored 103 papers that have together received 680 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (44 papers), Coding theory and cryptography (34 papers) and Limits and Structures in Graph Theory (29 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (151 citations), Computational Theory and Mathematics (353 citations) and Artificial Intelligence (402 citations). Shachar Lovett has collaborated with scholars based in United States, Israel and Canada. Frequent co-authors include Tali Kaufman, Raghu Meka, Yevgeniy Dodis, Zeev Dvir, Hamed Hatami, Yael Tauman Kalai, Ely Porat, Roy Meshulam, Divesh Aggarwal and Alex Samorodnitsky. Their work appears in journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Journal of the ACM.
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.