This map shows the geographic impact of Hamed Hassani'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 Hamed Hassani with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hamed Hassani more than expected).
This network shows the impact of papers produced by Hamed Hassani. 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 Hamed Hassani. The network helps show where Hamed Hassani may publish in the future.
Co-authorship network of co-authors of Hamed Hassani
This figure shows the co-authorship network connecting the top 25 collaborators of Hamed Hassani.
A scholar is included among the top collaborators of Hamed Hassani 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 Hamed Hassani. Hamed Hassani is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chen, Xingran, Konstantinos Gatsis, Hamed Hassani, & Shirin Saeedi Bidokhti. (2022). Age of Information in Random Access Channels. IEEE Transactions on Information Theory. 68(10). 6548–6568.79 indexed citations
Zhang, Mingrui, Zebang Shen, Aryan Mokhtari, Hamed Hassani, & Amin Karbasi. (2020). One Sample Stochastic Frank-Wolfe.. International Conference on Artificial Intelligence and Statistics. 4012–4023.2 indexed citations
11.
Mokhtari, Aryan, et al.. (2020). Quantized Push-sum for Gossip and Decentralized Optimization over Directed Graphs.. arXiv (Cornell University).3 indexed citations
Karbasi, Amin, Hamed Hassani, Aryan Mokhtari, & Zebang Shen. (2019). Stochastic Continuous Greedy ++: When Upper and Lower Bounds Match. Neural Information Processing Systems. 32. 13066–13076.1 indexed citations
15.
Reisizadeh, Amirhossein, Aryan Mokhtari, Hamed Hassani, Ali Jadbabaie, & Ramtin Pedarsani. (2019). FedPAQ: A Communication-Efficient Federated Learning Method with Periodic Averaging and Quantization.. International Conference on Artificial Intelligence and Statistics. 2021–2031.48 indexed citations
Chen, Lin, Hamed Hassani, & Amin Karbasi. (2018). Online Continuous Submodular Maximization. International Conference on Artificial Intelligence and Statistics. 1896–1905.3 indexed citations
18.
Bachem, Olivier, Mario Lučić, Hamed Hassani, & Andreas Krause. (2016). Fast and Provably Good Seedings for k-Means. Neural Information Processing Systems. 29. 55–63.46 indexed citations
Zakerian, Seyed Abolfazl, et al.. (2013). Using Assessment Repetitive Task (ART) Tool in an Assembly Industry. SHILAP Revista de lepidopterología. 10(6). 1–15.6 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.