Amir Shpilka

2.9k total citations
110 papers, 1.3k citations indexed

About

Amir Shpilka is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Amir Shpilka has authored 110 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 89 papers in Computational Theory and Mathematics, 88 papers in Artificial Intelligence and 21 papers in Computer Networks and Communications. Recurrent topics in Amir Shpilka's work include Complexity and Algorithms in Graphs (71 papers), Cryptography and Data Security (40 papers) and Coding theory and cryptography (37 papers). Amir Shpilka is often cited by papers focused on Complexity and Algorithms in Graphs (71 papers), Cryptography and Data Security (40 papers) and Coding theory and cryptography (37 papers). Amir Shpilka collaborates with scholars based in Israel, United States and Switzerland. Amir Shpilka's 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 and has published in prestigious journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Journal of Computer and System Sciences.

In The Last Decade

Amir Shpilka

104 papers receiving 1.1k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Amir Shpilka Israel	18	930	823	275	169	105	110	1.3k
Steven Rudich United States	19	927 1.0×	1.2k 1.4×	224 0.8×	165 1.0×	51 0.5×	36	1.6k
Eric Allender United States	20	1.2k 1.3×	802 1.0×	180 0.7×	88 0.5×	36 0.3×	117	1.4k
Ravi B. Boppana United States	13	744 0.8×	532 0.6×	216 0.8×	117 0.7×	49 0.5×	26	1.1k
Shachar Lovett United States	15	353 0.4×	402 0.5×	119 0.4×	125 0.7×	31 0.3×	103	680
Rod Downey New Zealand	19	1.2k 1.3×	344 0.4×	189 0.7×	64 0.4×	62 0.6×	110	1.3k
Michael J. Dinneen New Zealand	15	413 0.4×	361 0.4×	178 0.6×	96 0.6×	133 1.3×	80	791
Amir Yehudayoff Israel	15	514 0.6×	410 0.5×	90 0.3×	74 0.4×	23 0.2×	88	755
Adam R. Klivans United States	19	618 0.7×	831 1.0×	108 0.4×	78 0.5×	35 0.3×	56	1.0k
S. Goldwasser United States	15	726 0.8×	983 1.2×	234 0.9×	95 0.6×	26 0.2×	24	1.3k
Alex Samorodnitsky Israel	17	571 0.6×	419 0.5×	199 0.7×	88 0.5×	18 0.2×	44	857

Countries citing papers authored by Amir Shpilka

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Shpilka, Amir, et al.. (2024). Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions. IEEE Transactions on Information Theory. 70(7). 5012–5016. 3 indexed citations

Abbé, Emmanuel, et al.. (2023). Wireless Network Optimization by Perron-Frobenius Theory. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 20(1-2). 1–156. 9 indexed citations

Shpilka, Amir, et al.. (2023). Reed Solomon Codes Against Adversarial Insertions and Deletions. IEEE Transactions on Information Theory. 69(5). 2991–3000. 6 indexed citations

Peleg, Shir & Amir Shpilka. (2022). A generalized Sylvester–Gallai-type theorem for quadratic polynomials. Forum of Mathematics Sigma. 10.

Shpilka, Amir, et al.. (2022). Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions. IEEE Transactions on Information Theory. 68(10). 6516–6526. 2 indexed citations

Shpilka, Amir, et al.. (2022). Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel. IEEE Transactions on Information Theory. 68(5). 2920–2940. 6 indexed citations

Forbes, Michael A., et al.. (2021). . Theory of Computing. 17(1). 1–88. 3 indexed citations

Peleg, Shir & Amir Shpilka. (2021). Polynomial time deterministic identity testing algorithm for Σ ^[3] ΠΣΠ ^[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials. 259–271. 4 indexed citations

Abbé, Emmanuel, Amir Shpilka, & Min Ye. (2020). Reed–Muller Codes: Theory and Algorithms. IEEE Transactions on Information Theory. 67(6). 3251–3277. 43 indexed citations

10.

Forbes, Michael A., et al.. (2018). . Theory of Computing. 14(1). 1–45. 6 indexed citations

11.

Shpilka, Amir, et al.. (2014). . Theory of Computing. 10(1). 465–514. 5 indexed citations

12.

Ben‐Sasson, Eli, et al.. (2011). On Sums of Locally Testable Affine Invariant Properties.. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 18. 79. 1 indexed citations

13.

Dvir, Zeev & Amir Shpilka. (2011). . Theory of Computing. 7(1). 1–18. 4 indexed citations

14.

Raskhodnikova, Sofya, Dana Ron, Amir Shpilka, & Adam Smith. (2007). Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. 559–569. 13 indexed citations

15.

Raz, Ran, Amir Shpilka, & Amir Yehudayoff. (2007). A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. 438–448. 27 indexed citations

16.

Karnin, Zohar & Amir Shpilka. (2007). Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in. Electronic colloquium on computational complexity. 14. 2 indexed citations

17.

Klivans, Adam R. & Amir Shpilka. (2006). . Theory of Computing. 2(1). 185–206. 16 indexed citations

18.

Raskhodnikova, Sofya, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, & Adam Smith. (2005). Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size. Electronic colloquium on computational complexity. 1 indexed citations

19.

Raz, Ran & Amir Shpilka. (2004). Deterministic polynomial identity testing in non commutative models. 215–222. 8 indexed citations

20.

Mossel, Elchanan, Amir Shpilka, & Luca Trevisan. (2003). On epsilon-Biased Generators in NC0. Random Structures and Algorithms. 29. 56–81. 6 indexed citations

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.

Explore authors with similar magnitude of impact