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.
Private information retrieval
1998824 citationsOded Goldreich, Madhu Sudan et al.profile →
Proof verification and the hardness of approximation problems
This map shows the geographic impact of Madhu Sudan'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 Madhu Sudan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Madhu Sudan more than expected).
This network shows the impact of papers produced by Madhu Sudan. 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 Madhu Sudan. The network helps show where Madhu Sudan may publish in the future.
Co-authorship network of co-authors of Madhu Sudan
This figure shows the co-authorship network connecting the top 25 collaborators of Madhu Sudan.
A scholar is included among the top collaborators of Madhu Sudan 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 Madhu Sudan. Madhu Sudan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Bavarian, Mohammad, et al.. (2020). . Theory of Computing. 16(1). 1–18.
2.
Sudan, Madhu, et al.. (2015). . Theory of Computing. 11(1). 299–338.3 indexed citations
3.
Sudan, Madhu, et al.. (2015). Robust testing of lifted codes with applications to low-degree testing.. Electronic colloquium on computational complexity. 22. 43.2 indexed citations
4.
Sudan, Madhu, et al.. (2015). Impact of weather factors on population dynamics of Anosia chrysippus Infesting Calotropis procera, A Medicinal plant in Jammu region of Jammu and Kashmir, India. Journal of Entomology and Zoology Studies. 3(5). 254–257.1 indexed citations
Sudan, Madhu, et al.. (2013). . Theory of Computing. 9(1). 783–807.2 indexed citations
7.
Sudan, Madhu, et al.. (2011). Insect pests infesting Calotropis procera (Ait.) Ait. F. (Asclepiadaceae), a medicinal plant in district Rajouri of Jammu region (J&K).. UTTAR PRADESH JOURNAL OF ZOOLOGY. 31(2). 177–184.1 indexed citations
8.
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
9.
Chen, Victor, et al.. (2011). . Theory of Computing. 7(1). 75–99.12 indexed citations
Juba, Brendan & Madhu Sudan. (2008). Universal Semantic Communication II: A Theory of Goal-Oriented Communication. Electronic colloquium on computational complexity. 15.9 indexed citations
Guruswami, Venkatesan & Madhu Sudan. (1998). Improved decoding of Reed-Solomon and algebraic-geometric codes.. Electronic colloquium on computational complexity. 5.9 indexed citations
18.
Trevisan, Luca, Gregory B. Sorkin, Madhu Sudan, & David P. Williamson. (1996). Gadgets, Approximation, and Linear Programming (extended abstract).. 617–626.6 indexed citations
19.
Khanna, Sanjeev & Madhu Sudan. (1995). The Optimization Complexity of Constraint Satisfaction Problems. Electronic colloquium on computational complexity. 3.2 indexed citations
20.
Rubinfeld, Ronitt & Madhu Sudan. (1992). Self-testing polynomial functions efficiently and over rational domains. Symposium on Discrete Algorithms. 23–32.20 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.