Swastik Kopparty

1.4k total citations
50 papers, 652 citations indexed

About

Swastik Kopparty is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Swastik Kopparty has authored 50 papers receiving a total of 652 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Artificial Intelligence, 24 papers in Computational Theory and Mathematics and 20 papers in Computer Networks and Communications. Recurrent topics in Swastik Kopparty's work include Coding theory and cryptography (32 papers), Complexity and Algorithms in Graphs (14 papers) and graph theory and CDMA systems (12 papers). Swastik Kopparty is often cited by papers focused on Coding theory and cryptography (32 papers), Complexity and Algorithms in Graphs (14 papers) and graph theory and CDMA systems (12 papers). Swastik Kopparty collaborates with scholars based in United States, Israel and India. Swastik Kopparty's co-authors include Madhu Sudan, Shubhangi Saraf, Chinya V. Ravishankar, Michalis Faloutsos, Srikanth V. Krishnamurthy, Satish K. Tripathi, Venkatesan Guruswami, Zeev Dvir, Eli Ben‐Sasson and Jaikumar Radhakrishnan and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Swastik Kopparty

47 papers receiving 588 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Swastik Kopparty United States	13	387	316	226	194	52	50	652
Hong‐Yeop Song South Korea	16	451 1.2×	349 1.1×	189 0.8×	528 2.7×	32 0.6×	128	703
Agnes Chan United States	12	375 1.0×	205 0.6×	128 0.6×	257 1.3×	55 1.1×	33	558
Tian Tian China	11	515 1.3×	161 0.5×	87 0.4×	129 0.7×	49 0.9×	72	601
Michele Elia Italy	13	339 0.9×	244 0.8×	104 0.5×	361 1.9×	32 0.6×	74	596
Arya Mazumdar United States	11	328 0.8×	362 1.1×	165 0.7×	144 0.7×	36 0.7×	66	589
J. Justesen Denmark	17	671 1.7×	341 1.1×	348 1.5×	436 2.2×	48 0.9×	46	874
Bernhard Haeupler United States	13	194 0.5×	455 1.4×	229 1.0×	132 0.7×	22 0.4×	79	659
Serdar Boztaş Australia	11	364 0.9×	254 0.8×	84 0.4×	338 1.7×	22 0.4×	45	559
Kyeongcheol Yang South Korea	20	644 1.7×	821 2.6×	135 0.6×	1.1k 5.7×	40 0.8×	72	1.3k
M.U. Siddiqi Malaysia	11	334 0.9×	178 0.6×	92 0.4×	265 1.4×	54 1.0×	44	469

Countries citing papers authored by Swastik Kopparty

Since Specialization

Citations

This map shows the geographic impact of Swastik Kopparty'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 Swastik Kopparty with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Swastik Kopparty more than expected).

Fields of papers citing papers by Swastik Kopparty

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Swastik Kopparty. 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 Swastik Kopparty. The network helps show where Swastik Kopparty may publish in the future.

Co-authorship network of co-authors of Swastik Kopparty

This figure shows the co-authorship network connecting the top 25 collaborators of Swastik Kopparty. A scholar is included among the top collaborators of Swastik Kopparty 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 Swastik Kopparty. Swastik Kopparty 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

Kopparty, Swastik, et al.. (2023). Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM Journal on Computing. 52(3). 794–840. 5 indexed citations

Kopparty, Swastik, et al.. (2020). On List Recovery of High-Rate Tensor Codes. IEEE Transactions on Information Theory. 67(1). 296–316. 4 indexed citations

Kopparty, Swastik, et al.. (2019). Quasilinear Time List-Decodable Codes for Space Bounded Channels. 302–333. 5 indexed citations

Kopparty, Swastik & Srikanth Srinivasan. (2018). . Theory of Computing. 14(1). 1–24. 2 indexed citations

Gopi, Sivakanth, et al.. (2018). Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Transactions on Information Theory. 64(8). 5813–5831. 11 indexed citations

Kopparty, Swastik & Shubhangi Saraf. (2017). Local Testing and Decoding of High-Rate Error-Correcting Codes.. 24. 126. 1 indexed citations

Kopparty, Swastik, et al.. (2017). . Theory of Computing. 13(1). 1–38. 3 indexed citations

Kopparty, Swastik, Mrinal Kumar, & Michael J. Saks. (2016). . Theory of Computing. 12(1). 1–27. 4 indexed citations

Gilmer, Justin & Swastik Kopparty. (2016). A local central limit theorem for triangles in a random graph. Random Structures and Algorithms. 48(4). 732–750. 4 indexed citations

10.

Kopparty, Swastik, et al.. (2016). Decoding Reed-Muller Codes Over Product Sets. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

11.

Kopparty, Swastik. (2015). . Theory of Computing. 11(1). 149–182. 37 indexed citations

12.

Kopparty, Swastik & Qiang Wang. (2014). Roots and coefficients of polynomials over finite fields. Finite Fields and Their Applications. 29. 198–201. 1 indexed citations

13.

Kopparty, Swastik, Shubhangi Saraf, & Amir Shpilka. (2014). Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. 169–180. 11 indexed citations

14.

Ben‐Sasson, Eli, et al.. (2013). A new family of locally correctable codes based on degree-lifted algebraic geometry codes. 833–842. 7 indexed citations

15.

Ben‐Sasson, Eli, et al.. (2012). A new family of locally correctable codes based on degree-lifted algebraic geometry codes.. Electronic colloquium on computational complexity. 19. 148. 1 indexed citations

16.

Kopparty, Swastik & Srikanth Srinivasan. (2012). Certifying polynomials for AC^0(parity) circuits, with applications. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18. 36–47. 10 indexed citations

17.

Kopparty, Swastik & Benjamin Rossman. (2011). The homomorphism domination exponent. European Journal of Combinatorics. 32(7). 1097–1114. 13 indexed citations

18.

Kolaitis, Phokion G. & Swastik Kopparty. (2009). Random graphs and the parity quantifier. 705–714. 1 indexed citations

19.

Dinur, Irit, Elena Grigorescu, Swastik Kopparty, & Madhu Sudan. (2008). Decodability of group homomorphisms beyond the johnson bound. Electronic colloquium on computational complexity. 15. 275–284. 3 indexed citations

20.

Kopparty, Swastik & K. P. S. Bhaskara Rao. (2007). The minimum rank problem: A counterexample. Linear Algebra and its Applications. 428(7). 1761–1765. 10 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