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.
The Algorithmic Foundations of Differential Privacy
This map shows the geographic impact of Cynthia Dwork'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 Cynthia Dwork with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Cynthia Dwork more than expected).
This network shows the impact of papers produced by Cynthia Dwork. 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 Cynthia Dwork. The network helps show where Cynthia Dwork may publish in the future.
Co-authorship network of co-authors of Cynthia Dwork
This figure shows the co-authorship network connecting the top 25 collaborators of Cynthia Dwork.
A scholar is included among the top collaborators of Cynthia Dwork 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 Cynthia Dwork. Cynthia Dwork is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Dwork, Cynthia, et al.. (2012). Toward practicing privacy. Journal of the American Medical Informatics Association. 20(1). 102–108.30 indexed citations
Dwork, Cynthia, Moni Naor, Toniann Pitassi, Guy N. Rothblum, & Sergey Yekhanin. (2010). Pan-Private Streaming Algorithms. 66–80.65 indexed citations
10.
Ajtai, Miklós & Cynthia Dwork. (2007). The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case Equivalence. Electronic colloquium on computational complexity. 14.14 indexed citations
11.
Dwork, Cynthia. (2006). Advances in Cryptology - CRYPTO 2006: 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings (Lecture Notes in Computer Science). Springer eBooks.4 indexed citations
12.
Dwork, Cynthia, Krishnaram Kenthapadi, Frank McSherry, Ilya Mironov, & Moni Naor. (2006). Our Data, Ourselves: Privacy via Distributed Noise Generation.2 indexed citations
Dwork, Cynthia & Larry J. Stockmeyer. (1989). On the Power of 2-Way Probabilistic Finite State Automata (Extended Abstract). 480–485.1 indexed citations
18.
Coan, Brian, Danny Dolev, Cynthia Dwork, & Larry J. Stockmeyer. (1985). The Distributed Firing Squad Problem (Preliminary Version). 335–345.1 indexed citations
19.
Dwork, Cynthia, Paris C. Kanellakis, & John C. Mitchell. (1984). On the sequential nature of unification. The Journal of Logic Programming. 1(1). 35–50.122 indexed citations
20.
Dolev, Danny, Cynthia Dwork, Nicholas Pippenger, & Avi Wigderson. (1983). Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version). 42–51.11 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.