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.
This map shows the geographic impact of Kobbi Nissim'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 Kobbi Nissim with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kobbi Nissim more than expected).
This network shows the impact of papers produced by Kobbi Nissim. 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 Kobbi Nissim. The network helps show where Kobbi Nissim may publish in the future.
Co-authorship network of co-authors of Kobbi Nissim
This figure shows the co-authorship network connecting the top 25 collaborators of Kobbi Nissim.
A scholar is included among the top collaborators of Kobbi Nissim 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 Kobbi Nissim. Kobbi Nissim is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Gaboardi, Marco, et al.. (2019). The Complexity of Verifying Circuits as Differentially Private.. arXiv (Cornell University).1 indexed citations
6.
Beimel, Amos, Kobbi Nissim, & Uri Stemmer. (2019). Characterizing the Sample Complexity of Pure Private Learners. Journal of Machine Learning Research. 20(146). 1–33.3 indexed citations
7.
Nissim, Kobbi, Alexandra Wood, Mark Bun, et al.. (2018). Bridging the Gap between Computer Science and Legal Approaches to Privacy. Digital Access to Scholarship at Harvard (DASH) (Harvard University). 31(2). 687.24 indexed citations
8.
Ullman, Jonathan, Adam Smith, Kobbi Nissim, Uri Stemmer, & Thomas Steinke. (2018). The Limits of Post-Selection Generalization. Neural Information Processing Systems. 31. 6400–6409.2 indexed citations
9.
Nissim, Kobbi & Uri Stemmer. (2018). Clustering Algorithms for the Centralized and Local Models. 619–653.12 indexed citations
Wood, Alexandra, Micah Altman, Mark Bun, et al.. (2018). Differential Privacy: A Primer for a Non-Technical Audience. Digital Access to Scholarship at Harvard (DASH) (Harvard University). 21(1). 209.13 indexed citations
12.
Beimel, Amos, Kobbi Nissim, & Uri Stemmer. (2016). . Theory of Computing. 12(1). 1–61.22 indexed citations
Chen, Yiling, Kobbi Nissim, & Bo Waggoner. (2015). Fair Information Sharing for Treasure Hunting. Proceedings of the AAAI Conference on Artificial Intelligence. 29(1).1 indexed citations
Freedman, Michael J., Kobbi Nissim, & Benny Pinkas. (2004). Efficient private matching and set intersection. Lecture notes in computer science. 3027. 1–19.3 indexed citations
20.
Feige, Uriel, Michael Langberg, & Kobbi Nissim. (2000). On the hardness of approximating N P witnesses. 120–131.2 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.