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 Michael Rabbat
Since
Specialization
Citations
This map shows the geographic impact of Michael Rabbat'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 Michael Rabbat with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michael Rabbat more than expected).
This network shows the impact of papers produced by Michael Rabbat. 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 Michael Rabbat. The network helps show where Michael Rabbat may publish in the future.
Co-authorship network of co-authors of Michael Rabbat
This figure shows the co-authorship network connecting the top 25 collaborators of Michael Rabbat.
A scholar is included among the top collaborators of Michael Rabbat 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 Michael Rabbat. Michael Rabbat is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Wang, Jianyu, et al.. (2020). SloMo: Improving Communication-Efficient Distributed SGD with Slow Momentum. International Conference on Learning Representations.9 indexed citations
3.
Dong, Xiaowen, Dorina Thanou, Michael Rabbat, & Pascal Frossard. (2019). Learning Graphs From Data: A Signal Representation Perspective. IEEE Signal Processing Magazine. 36(3). 44–63.249 indexed citations breakdown →
4.
Assran, Mahmoud, Joshua Romoff, Nicolas Ballas, Joëlle Pineau, & Michael Rabbat. (2019). Gossip-based Actor-Learner Architectures for Deep Reinforcement Learning. arXiv (Cornell University). 32. 13299–13309.2 indexed citations
Tsianos, Konstantinos I. & Michael Rabbat. (2014). Efficient Distributed Online Prediction and Stochastic Optimization with Approximate Distributed Mini-Batches. arXiv (Cornell University).3 indexed citations
9.
Faghih-Imani, Ahmadreza, et al.. (2014). How Does Land-Use and Urban Form Impact Bicycle Flows--Evidence from the Bicycle-Sharing System (BIXI) in Montreal. Transportation Research Board 93rd Annual MeetingTransportation Research Board.13 indexed citations
Tsianos, Konstantinos I. & Michael Rabbat. (2013). Simple iteration-optimal distributed optimization. European Signal Processing Conference. 1–5.1 indexed citations
Chen, Xi, et al.. (2011). Sequential Monte Carlo for simultaneous passive device-free tracking and sensor localization using received signal strength measurements. Information Processing in Sensor Networks. 342–353.84 indexed citations
Üstebay, Deniz, Boris N. Oreshkin, Mark Coates, & Michael Rabbat. (2009). Multi-hop Greedy Gossip with Eavesdropping. International Conference on Information Fusion. 140–145.1 indexed citations
Zhu, Xiaojin, Andrew B. Goldberg, Michael Rabbat, & Robert Nowak. (2008). Learning Bigrams from Unigrams. Meeting of the Association for Computational Linguistics. 656–664.5 indexed citations
Rabbat, Michael. (2003). RICE UNIVERSITY Multiple Source Network Tomography.
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.