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 Anand D. Sarwate
Since
Specialization
Citations
This map shows the geographic impact of Anand D. Sarwate'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 Anand D. Sarwate with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anand D. Sarwate more than expected).
Fields of papers citing papers by Anand D. Sarwate
This network shows the impact of papers produced by Anand D. Sarwate. 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 Anand D. Sarwate. The network helps show where Anand D. Sarwate may publish in the future.
Co-authorship network of co-authors of Anand D. Sarwate
This figure shows the co-authorship network connecting the top 25 collaborators of Anand D. Sarwate.
A scholar is included among the top collaborators of Anand D. Sarwate 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 Anand D. Sarwate. Anand D. Sarwate is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sarwate, Anand D., et al.. (2019). Learning Tree Structures from Noisy Data. International Conference on Artificial Intelligence and Statistics. 1771–1782.2 indexed citations
7.
Sarwate, Anand D., et al.. (2019). Non-Parametric Structure Learning on Hidden Tree-Shaped Distributions.. arXiv (Cornell University).1 indexed citations
Chaudhuri, Kamalika, Anand D. Sarwate, & K. P. Sinha. (2012). Near-optimal Differentially Private Principal Components. Neural Information Processing Systems. 25. 989–997.53 indexed citations
14.
Checkoway, Stephen, Anand D. Sarwate, & Hovav Shacham. (2010). Single-ballot risk-limiting audits using convex optimization. 1–13.5 indexed citations
15.
Sarwate, Anand D., Kamalika Chaudhuri, & Claire Monteleoni. (2009). Differentially Private Support Vector Machines. arXiv (Cornell University).5 indexed citations
16.
Sarwate, Anand D. & Michael Gastpar. (2007). Deterministic list codes for state-constrained arbitrarily varying channels. arXiv (Cornell University).3 indexed citations
17.
Eswaran, Krishnan, Anand D. Sarwate, Anant Sahai, & Michael Gastpar. (2007). Limited feedback achieves the empirical capacity. arXiv (Cornell University).3 indexed citations
18.
Sarwate, Anand D. & Michael Gastpar. (2006). Randomization for robust communication in networks, or Brother, can you spare a bit?. 978–986.1 indexed citations
Sarwate, Anand D. & Michael Gastpar. (2005). Estimation from misaligned observations with limited feedback.5 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.