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.
DNA-based programmable gate arrays for general-purpose DNA computing
2023117 citationsHui Lv, Nuli Xie et al.Natureprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Haibo 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 Haibo Chen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Haibo Chen more than expected).
This network shows the impact of papers produced by Haibo 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 Haibo Chen. The network helps show where Haibo Chen may publish in the future.
Co-authorship network of co-authors of Haibo Chen
This figure shows the co-authorship network connecting the top 25 collaborators of Haibo Chen.
A scholar is included among the top collaborators of Haibo 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 Haibo Chen. Haibo Chen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Wei, Xingda, et al.. (2021). Unifying Timestamp with Transaction Ordering for MVCC with Decentralized Scalar Timestamp.. Networked Systems Design and Implementation. 357–372.2 indexed citations
11.
Wei, Xingda, et al.. (2021). Characterizing and Optimizing Remote Persistent Memory with RDMA and NVM.. USENIX Annual Technical Conference. 523–536.2 indexed citations
12.
Wang, Xiayang, et al.. (2019). Pisces: A Scalable and Efficient Persistent Transactional Memory. USENIX Annual Technical Conference. 913–928.19 indexed citations
Du, Dong, et al.. (2018). EPTI: efficient defence against meltdown attack for unpatched VMs. USENIX Annual Technical Conference. 255–266.20 indexed citations
15.
Dong, Mingkai & Haibo Chen. (2017). Soft Updates Made Simple and Fast on Non-volatile Memory.. USENIX Annual Technical Conference. 719–731.20 indexed citations
16.
Dong, Mingkai, et al.. (2016). Efficient and available in-memory KV-store with hybrid erasure coding and replication. File and Storage Technologies. 167–180.40 indexed citations
17.
Liang, Liang, et al.. (2016). Mitigating sync amplification for copy-on-write virtual disk. File and Storage Technologies. 241–247.23 indexed citations
Chen, Jin, Haibo Chen, Erick Bauman, et al.. (2015). You shouldn't collect my secrets: thwarting sensitive keystroke leakage in mobile IME apps. USENIX Security Symposium. 675–690.8 indexed citations
20.
Chen, Haibo, Lorenzo Mussone, Frank Montgomery, & Susan Grant‐Muller. (1998). THE EFFECTS OF MISSING DATA ON NEURAL NETWORK PERFORMANCE IN FORECASTING FLOW. Virtual Community of Pathological Anatomy (University of Castilla La Mancha). 320–329.2 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.