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.
Boosting and Differential Privacy
2010380 citationsCynthia Dwork, Guy N. Rothblum et al.profile →
Citations per year, relative to Guy N. Rothblum Guy N. Rothblum (= 1×)
peers
Sofya Raskhodnikova
Countries citing papers authored by Guy N. Rothblum
Since
Specialization
Citations
This map shows the geographic impact of Guy N. Rothblum'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 Guy N. Rothblum with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Guy N. Rothblum more than expected).
This network shows the impact of papers produced by Guy N. Rothblum. 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 Guy N. Rothblum. The network helps show where Guy N. Rothblum may publish in the future.
Co-authorship network of co-authors of Guy N. Rothblum
This figure shows the co-authorship network connecting the top 25 collaborators of Guy N. Rothblum.
A scholar is included among the top collaborators of Guy N. Rothblum 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 Guy N. Rothblum. Guy N. Rothblum is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kim, Michael P., Omer Reingold, & Guy N. Rothblum. (2018). Fairness Through Computationally-Bounded Awareness. Neural Information Processing Systems. 31. 4842–4852.17 indexed citations
7.
Yona, Gal & Guy N. Rothblum. (2018). Probably Approximately Metric-Fair Learning. International Conference on Machine Learning. 5680–5688.3 indexed citations
8.
Reingold, Omer, et al.. (2018). Multicalibration: Calibration for the (Computationally-Identifiable) Masses. International Conference on Machine Learning. 1939–1948.45 indexed citations
9.
Goldreich, Oded & Guy N. Rothblum. (2018). Counting t -cliques: Worst-case to average-case reductions and Direct interactive proof systems.. 25. 46.1 indexed citations
10.
Reingold, Omer, Guy N. Rothblum, & Ron D. Rothblum. (2018). Efficient Batch Verification for UP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 25. 22.1 indexed citations
11.
Goldwasser, Shafi, Guy N. Rothblum, & Yael Tauman Kalai. (2017). Delegating Computation: Interactive Proofs for Muggles.. 24. 108.14 indexed citations
12.
Goldwasser, Shafi, Yael Tauman Kalai, & Guy N. Rothblum. (2015). Delegating Computation. Journal of the ACM. 62(4). 1–64.89 indexed citations
13.
Meka, Raghu, Omer Reingold, Guy N. Rothblum, & Ron D. Rothblum. (2014). Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).. International Colloquium on Automata, Languages and Programming. 859–870.2 indexed citations
14.
Goldwasser, Shafi & Guy N. Rothblum. (2013). On Best-Possible Obfuscation. DSpace@MIT (Massachusetts Institute of Technology).2 indexed citations
15.
Canetti, Ran, Ben Riva, & Guy N. Rothblum. (2013). Refereed delegation of computation. Information and Computation. 226. 16–36.12 indexed citations
Rothblum, Guy N.. (2012). How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware.. 552–569.1 indexed citations
18.
Goldwasser, Shafi & Guy N. Rothblum. (2012). How to Compute in the Presence of Leakage.. Electronic colloquium on computational complexity. 19. 10.1 indexed citations
19.
Dwork, Cynthia, Moni Naor, Toniann Pitassi, Guy N. Rothblum, & Sergey Yekhanin. (2010). Pan-Private Streaming Algorithms. 66–80.65 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.