Haohui Mai

1.1k total citations · 1 hit paper
15 papers, 832 citations indexed

About

Haohui Mai is a scholar working on Computer Networks and Communications, Artificial Intelligence and Software. According to data from OpenAlex, Haohui Mai has authored 15 papers receiving a total of 832 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computer Networks and Communications, 5 papers in Artificial Intelligence and 5 papers in Software. Recurrent topics in Haohui Mai's work include Software System Performance and Reliability (7 papers), Software Testing and Debugging Techniques (5 papers) and Security and Verification in Computing (4 papers). Haohui Mai is often cited by papers focused on Software System Performance and Reliability (7 papers), Software Testing and Debugging Techniques (5 papers) and Security and Verification in Computing (4 papers). Haohui Mai collaborates with scholars based in United States, Canada and China. Haohui Mai's co-authors include Samuel T. King, Matthew Caesar, P. Brighten Godfrey, Ahmed Khurshid, Rachit Agarwal, Yuanyuan Zhou, Lin Tan, Ding Yuan, Shankar Pasupathy and Weiwei Xiong and has published in prestigious journals such as PLoS ONE, ACM SIGCOMM Computer Communication Review and ACM SIGPLAN Notices.

In The Last Decade

Haohui Mai

15 papers receiving 791 citations

Hit Papers

Debugging the data plane with anteater 2011 2026 2016 2021 2011 50 100 150 200 250

Peers

Haohui Mai
Wuu Yang Taiwan
Ahmed Khurshid United States
Wenxuan Zhou United States
Charles Killian United States
Rachit Agarwal United States
Jacob Burnim United States
Haohui Mai
Citations per year, relative to Haohui Mai Haohui Mai (= 1×) peers Pallavi Joshi

Countries citing papers authored by Haohui Mai

Since Specialization
Citations

This map shows the geographic impact of Haohui Mai'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 Haohui Mai with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Haohui Mai more than expected).

Fields of papers citing papers by Haohui Mai

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Haohui Mai. 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 Haohui Mai. The network helps show where Haohui Mai may publish in the future.

Co-authorship network of co-authors of Haohui Mai

This figure shows the co-authorship network connecting the top 25 collaborators of Haohui Mai. A scholar is included among the top collaborators of Haohui Mai 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 Haohui Mai. Haohui Mai is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

15 of 15 papers shown
1.
Yang, Gui Fen, et al.. (2022). Clinical Outcomes Associated With His-Purkinje System Pacing vs. Biventricular Pacing, in Cardiac Resynchronization Therapy: A Meta-Analysis. Frontiers in Cardiovascular Medicine. 9. 707148–707148. 16 indexed citations
2.
Yan, Qiqi, et al.. (2022). Does the Geriatric Nutritional Risk Index Play a Predictive Role in Postoperative Atrial Fibrillation and Outcomes in Cardiac Surgery?. Journal of Cardiothoracic and Vascular Anesthesia. 37(1). 58–64. 4 indexed citations
3.
Li, Andy C. Y., et al.. (2020). Boxer: Preventing fraud by scanning credit cards. 1571–1588. 5 indexed citations
4.
Mai, Haohui, et al.. (2013). Verifying security invariants in ExpressOS. ACM SIGPLAN Notices. 48(4). 293–304. 2 indexed citations
5.
Mai, Haohui, et al.. (2013). Verifying security invariants in ExpressOS. 293–304. 27 indexed citations
6.
Mai, Haohui, et al.. (2013). Verifying security invariants in ExpressOS. ACM SIGARCH Computer Architecture News. 41(1). 293–304. 1 indexed citations
7.
Mai, Haohui, Shuo Tang, Samuel T. King, Cǎlin Caşcaval, & Pablo Montesinos. (2012). A case for parallelizing web pages. 2–2. 20 indexed citations
8.
Mai, Haohui. (2011). Diagnose network failures via data-plane analysis. Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign). 2 indexed citations
9.
Mai, Haohui, Ahmed Khurshid, Rachit Agarwal, et al.. (2011). Debugging the data plane with anteater. ACM SIGCOMM Computer Communication Review. 41(4). 290–301. 117 indexed citations
10.
Mai, Haohui, Ahmed Khurshid, Rachit Agarwal, et al.. (2011). Debugging the data plane with anteater. 290–301. 254 indexed citations breakdown →
11.
Tang, Shuo, Haohui Mai, & Samuel T. King. (2010). Trust and protection in the Illinois browser operating system. Operating Systems Design and Implementation. 17–31. 59 indexed citations
12.
Yuan, Ding, et al.. (2010). SherLog. ACM SIGARCH Computer Architecture News. 38(1). 143–154. 167 indexed citations
13.
Yuan, Ding, Haohui Mai, Weiwei Xiong, et al.. (2010). SherLog. 143–154. 143 indexed citations
14.
Yuan, Ding, Haohui Mai, Weiwei Xiong, et al.. (2010). SherLog. ACM SIGPLAN Notices. 45(3). 143–154. 14 indexed citations
15.
Mai, Haohui, Chong Gao, Xuezheng Liu, Xi Wang, & Geoffrey M. Voelker. (2008). Towards automatic inference of task hierarchies in complex systems. PLoS ONE. 9(11). 7–7. 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026