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 Peter M. 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 Peter M. Chen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter M. Chen more than expected).
This network shows the impact of papers produced by Peter M. 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 Peter M. Chen. The network helps show where Peter M. Chen may publish in the future.
Co-authorship network of co-authors of Peter M. Chen
This figure shows the co-authorship network connecting the top 25 collaborators of Peter M. Chen.
A scholar is included among the top collaborators of Peter M. 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 Peter M. Chen. Peter M. Chen is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Wang, William Yang, Stephan Diestelhorst, Aasheesh Kolli, et al.. (2019). Software Wear Management for Persistent Memories. File and Storage Technologies. 45–63.20 indexed citations
Wester, Benjamin, James Cowling, Edmund B. Nightingale, et al.. (2009). Tolerating latency in replicated state machines through client speculation. Networked Systems Design and Implementation. 245–260.34 indexed citations
8.
Chow, Jim, Tal Garfinkel, & Peter M. Chen. (2008). Decoupling dynamic program analysis from execution in virtual environments. USENIX Annual Technical Conference. 1–14.118 indexed citations
9.
Nightingale, Edmund B., Kaushik Veeraraghavan, Peter M. Chen, & Jason Flinn. (2006). Rethink the sync. Operating Systems Design and Implementation. 1–1.97 indexed citations
King, Samuel T., George W. Dunlap, & Peter M. Chen. (2005). Debugging operating systems with time-traveling virtual machines. USENIX Annual Technical Conference. 1–1.243 indexed citations
12.
King, Samuel T., Z. Morley Mao, Dominic Lucchetti, & Peter M. Chen. (2005). Enriching Intrusion Alerts Through Multi-Host Causality.. Network and Distributed System Security Symposium.98 indexed citations
13.
King, Samuel T., George W. Dunlap, & Peter M. Chen. (2005). Debugging Operating Systems with Time-Traveling Virtual Machines (Awarded General Track Best Paper Award!).. USENIX Annual Technical Conference. 1–15.4 indexed citations
14.
King, Samuel T., George W. Dunlap, & Peter M. Chen. (2003). Operating system support for virtual machines. USENIX Annual Technical Conference. 6–6.87 indexed citations
Chen, Peter M., et al.. (2000). An evaluation of the recovery-related properties of software faults.. Deep Blue (University of Michigan).9 indexed citations
17.
Ng, Wee Teck & Peter M. Chen. (1999). Design and Implementation of Reliable Main Memory. Deep Blue (University of Michigan).3 indexed citations
18.
Lowell, David E. & Peter M. Chen. (1999). Theory and practice of failure transparency. Deep Blue (University of Michigan).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.