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.
Smooth sensitivity and sampling in private data analysis
2007522 citationsSofya Raskhodnikova, Adam Smith et al.profile →
What Can We Learn Privately?
2011458 citationsSofya Raskhodnikova, Adam Smith et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Sofya Raskhodnikova
Since
Specialization
Citations
This map shows the geographic impact of Sofya Raskhodnikova'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 Sofya Raskhodnikova with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sofya Raskhodnikova more than expected).
Fields of papers citing papers by Sofya Raskhodnikova
This network shows the impact of papers produced by Sofya Raskhodnikova. 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 Sofya Raskhodnikova. The network helps show where Sofya Raskhodnikova may publish in the future.
Co-authorship network of co-authors of Sofya Raskhodnikova
This figure shows the co-authorship network connecting the top 25 collaborators of Sofya Raskhodnikova.
A scholar is included among the top collaborators of Sofya Raskhodnikova 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 Sofya Raskhodnikova. Sofya Raskhodnikova is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-Closure Spanners of the Hypercube and the Hypergrid.. Electronic colloquium on computational complexity. 16. 46.4 indexed citations
16.
Bhattacharyya, Arnab, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, & David P. Woodruff. (2009). Transitive-closure spanners. arXiv (Cornell University). 932–941.21 indexed citations
Raskhodnikova, Sofya & Adam Smith. (2006). A Note on Adaptivity in Testing Properties of Bounded Degree Graphs. Electronic colloquium on computational complexity. 13.10 indexed citations
19.
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
20.
Ben‐Sasson, Eli, Prahladh Harsha, & Sofya Raskhodnikova. (2003). 3CNF Properties are Hard to Test. Electronic colloquium on computational complexity. 10.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.