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.
This map shows the geographic impact of Hao Chen'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 Hao Chen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hao Chen more than expected).
This network shows the impact of papers produced by Hao Chen. 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 Hao Chen. The network helps show where Hao Chen may publish in the future.
Co-authorship network of co-authors of Hao Chen
This figure shows the co-authorship network connecting the top 25 collaborators of Hao Chen.
A scholar is included among the top collaborators of Hao Chen 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 Hao Chen. Hao Chen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sun, Jianhua, et al.. (2013). KERNEL CODE INTEGRITY PROTECTION BASED ON A VIRTUALIZED MEMORY ARCHITECTURE. Computing and Informatics / Computers and Artificial Intelligence. 32(2). 295–311.2 indexed citations
Zeng, Kai, et al.. (2011). Good Neighbor: Ad hoc Pairing of Nearby Wireless Devices by Multiple Antennas.. Network and Distributed System Security Symposium.40 indexed citations
15.
Chen, Hao, et al.. (2010). DBTaint: cross-application information flow tracking via databases. 12–12.25 indexed citations
16.
Chen, Hao, et al.. (2009). Noncespaces: Using Randomization to Enforce Information Flow Tracking and Thwart Cross-Site Scripting Attacks.. Network and Distributed System Security Symposium.97 indexed citations
17.
Chen, Hao, et al.. (2008). Exploiting Opportunistic Scheduling in Cellular Data Networks.. Network and Distributed System Security Symposium.11 indexed citations
Chen, Hao, Drew Dean, & David Wagner. (2004). Model Checking One Million Lines of C Code.. Network and Distributed System Security Symposium.99 indexed citations
20.
Chen, Hao & David Wagner. (2002). MOPS. 235–244.257 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.