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.
Countries citing papers authored by Umesh Vazirani
Since
Specialization
Citations
This map shows the geographic impact of Umesh Vazirani'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 Umesh Vazirani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Umesh Vazirani more than expected).
This network shows the impact of papers produced by Umesh Vazirani. 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 Umesh Vazirani. The network helps show where Umesh Vazirani may publish in the future.
Co-authorship network of co-authors of Umesh Vazirani
This figure shows the co-authorship network connecting the top 25 collaborators of Umesh Vazirani.
A scholar is included among the top collaborators of Umesh Vazirani 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 Umesh Vazirani. Umesh Vazirani is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Zhu, Daiwei, Crystal Noel, Andrew Risinger, et al.. (2021). Demonstration of Interactive Protocols for Classically-Verifiable Quantum Advantage. Bulletin of the American Physical Society.2 indexed citations
Vazirani, Umesh & Thomas Vidick. (2012). Certifiable quantum dice. Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences. 370(1971). 3432–3448.24 indexed citations
Vazirani, Umesh. (1987). Efficiency Considerations in Using Semi-random Sources (Extended Abstract). 160–168.3 indexed citations
15.
Kozen, Dexter, Umesh Vazirani, & Vijay V. Vazirani. (1985). NC Algorithms for Comparability Graphs, Interval Gaphs, and Testing for Unique Perfect Matching. 496–503.11 indexed citations
16.
Vazirani, Umesh. (1985). Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract). 366–378.10 indexed citations
17.
Vazirani, Umesh & Vijay V. Vazirani. (1985). Efficient and secure pseudo-random number generation. 193–202.9 indexed citations
18.
Sántha, Miklós & Umesh Vazirani. (1984). Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract). 434–440.4 indexed citations
19.
Vazirani, Umesh & Vijay V. Vazirani. (1983). RSA Bits are 732+epsilon Secure.. 369–375.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.