Amir Shpilka
- Computational Theory and Mathematics top 0.5%
- Artificial Intelligence top 2%
- Computer Networks and Communications top 5%
- Electrical and Electronic Engineering
- Molecular Biology
- Co-authors
- Amir YehudayoffRan RazAvi WigdersonZeev DvirZohar KarninEmmanuel AbbéMichael A. ForbesMin Ye
- Topics
- Complexity and Algorithms in Graphs (71 papers)Cryptography and Data Security (40 papers)Coding theory and cryptography (37 papers)
- Journals
- IEEE Transactions on Information TheorySIAM Journal on ComputingJournal of Computer and System Sciences
- Partner nations
- IsraelUnited StatesSwitzerland
In The Last Decade
Amir Shpilka
104 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 56
- Computational Theory and Mathematics 930
- Artificial Intelligence 823
- Computer Networks and Communications 275
- Electrical and Electronic Engineering 169
- Molecular Biology 105
Countries citing papers authored by Amir Shpilka
This map shows the geographic impact of Amir Shpilka'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 Amir Shpilka with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amir Shpilka more than expected).
Fields of papers citing papers by Amir Shpilka
This network shows the impact of papers produced by Amir Shpilka. 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 Amir Shpilka. The network helps show where Amir Shpilka may publish in the future.
Co-authorship network of co-authors of Amir Shpilka
This figure shows the co-authorship network connecting the top 25 collaborators of Amir Shpilka. A scholar is included among the top collaborators of Amir Shpilka 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 Amir Shpilka. Amir Shpilka is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 6 | |
| 3 | 9 | |
| 4 | 0 | |
| 5 | 2 | |
| 6 | 6 | |
| 7 | 4 | |
| 8 | 3 | |
| 9 | 43 | |
| 10 | 6 | |
| 11 | 5 | |
| 12 | On Sums of Locally Testable Affine Invariant Properties. | 1 |
| 13 | 4 | |
| 14 | Symmetric LDPC codes are not necessarily locally testable. | 1 |
| 15 | Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. | 1 |
| 16 | Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in | 2 |
| 17 | 16 | |
| 18 | Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size | 1 |
| 19 | 15 | |
| 20 | On epsilon-Biased Generators in NC0 | 6 |
About Amir Shpilka
Amir Shpilka is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 110 papers that have together received 1.3k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (71 papers), Cryptography and Data Security (40 papers) and Coding theory and cryptography (37 papers). The work is most often cited by research in Computational Theory and Mathematics (930 citations), Computational Mathematics (19 citations) and Artificial Intelligence (823 citations). Amir Shpilka has collaborated with scholars based in Israel, United States and Switzerland. Frequent co-authors include Amir Yehudayoff, Ran Raz, Avi Wigderson, Zeev Dvir, Zohar Karnin, Emmanuel Abbé, Michael A. Forbes, Min Ye, Adam Smith and Dana Ron. Their work appears in journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Journal of Computer and System Sciences.
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.