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.
Demonstration of Blind Quantum Computing
2012274 citationsElham Kashefi, Anne Broadbent et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Elham Kashefi'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 Elham Kashefi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Elham Kashefi more than expected).
This network shows the impact of papers produced by Elham Kashefi. 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 Elham Kashefi. The network helps show where Elham Kashefi may publish in the future.
Co-authorship network of co-authors of Elham Kashefi
This figure shows the co-authorship network connecting the top 25 collaborators of Elham Kashefi.
A scholar is included among the top collaborators of Elham Kashefi 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 Elham Kashefi. Elham Kashefi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Wallden, Petros & Elham Kashefi. (2019). Cyber security in the quantum era. Communications of the ACM. 62(4). 120–120.37 indexed citations
14.
Kashefi, Elham, et al.. (2013). A Quantum-Theoretic Approach to Distributional Semantics. North American Chapter of the Association for Computational Linguistics. 847–857.17 indexed citations
15.
Kashefi, Elham, et al.. (2013). Human Language Technologies: Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, June 9-14, 2013, Westin Peachtree Plaza Hotel, Atlanta, Georgia, USA.17 indexed citations
16.
Fitzsimons, Joseph F. & Elham Kashefi. (2012). Universal Blind Quantum Computation. Bulletin of the American Physical Society. 2012.1 indexed citations
17.
Dunjko, Vedran, Elham Kashefi, & Anthony Leverrier. (2011). Universal Blind Quantum Computing with Coherent States. arXiv (Cornell University).3 indexed citations
Lieutier, André, et al.. (2001). The convex hull in a new model of computation. Canadian Conference on Computational Geometry. 93–96.10 indexed citations
20.
Kashefi, Elham & Maggie Mort. (2000). I'll tell you what I want, what I really really want!. Lancaster EPrints (Lancaster University).1 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.