Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Parikshit Gopalan
Since
Specialization
Citations
This map shows the geographic impact of Parikshit Gopalan'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 Parikshit Gopalan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Parikshit Gopalan more than expected).
Fields of papers citing papers by Parikshit Gopalan
This network shows the impact of papers produced by Parikshit Gopalan. 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 Parikshit Gopalan. The network helps show where Parikshit Gopalan may publish in the future.
Co-authorship network of co-authors of Parikshit Gopalan
This figure shows the co-authorship network connecting the top 25 collaborators of Parikshit Gopalan.
A scholar is included among the top collaborators of Parikshit Gopalan 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 Parikshit Gopalan. Parikshit Gopalan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Wu, Yi, Ryan O’Donnell, David Zuckerman, & Parikshit Gopalan. (2010). Fooling functions of halfspaces under product distributions.. Electronic colloquium on computational complexity. 17. 6.
Gopalan, Parikshit & Jaikumar Radhakrishnan. (2009). Finding duplicates in a data stream. Symposium on Discrete Algorithms. 402–411.10 indexed citations
11.
Gopalan, Parikshit. (2009). A note on Efremenko's Locally Decodable Codes.. Electronic colloquium on computational complexity. 16. 69.4 indexed citations
12.
Gopalan, Parikshit, Adam Tauman Kalai, & Adam R. Klivans. (2008). A Query Algorithm for Agnostically Learning DNF. Conference on Learning Theory. 515–516.2 indexed citations
13.
Gopalan, Parikshit, T. S. Jayram, Robert Krauthgamer, & Ravi Kumar. (2007). Estimating the sortedness of a data stream. Symposium on Discrete Algorithms. 318–327.29 indexed citations
Gopalan, Parikshit, et al.. (2003). Symmetric Polynomials over \mathbb{Z}_m and Simultaneous Communication Protocols. 450.2 indexed citations
19.
Gopalan, Parikshit, et al.. (2003). Symmetric Polynomials over Z m and Simultaneous Communication Protocols. Electronic colloquium on computational complexity.4 indexed citations
20.
Gopalan, Parikshit, Howard Karloff, Aranyak Mehta, Milena Mihail, & Nisheeth K. Vishnoi. (2002). Caching with expiration times. Symposium on Discrete Algorithms. 540–547.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.