This map shows the geographic impact of Matthew Hertz'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 Matthew Hertz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthew Hertz more than expected).
This network shows the impact of papers produced by Matthew Hertz. 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 Matthew Hertz. The network helps show where Matthew Hertz may publish in the future.
Co-authorship network of co-authors of Matthew Hertz
This figure shows the co-authorship network connecting the top 25 collaborators of Matthew Hertz.
A scholar is included among the top collaborators of Matthew Hertz 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 Matthew Hertz. Matthew Hertz is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Hertz, Matthew, et al.. (2022). Who is Failing CS1?. 1104–1104.1 indexed citations
2.
Ding, Chen, et al.. (2014). Safe Parallel Programming in an Interpreted Language. UR Research (University of Rochester).2 indexed citations
Berger, Emery D. & Matthew Hertz. (2008). Quantifying and Improving the Performance of Garbage Collection.2 indexed citations
8.
Blackburn, Stephen M., Matthew Hertz, Kathryn S. McKinley, J. Eliot B. Moss, & Ting Yang. (2007). Profile-based pretenuring. ACM Transactions on Programming Languages and Systems. 29(1). 2–2.25 indexed citations
Hertz, Matthew, Stephen M. Blackburn, J. Eliot B. Moss, Kathryn S. McKinley, & Darko Stefanović. (2006). Generating object lifetime traces with Merlin. ACM Transactions on Programming Languages and Systems. 28(3). 476–516.47 indexed citations
Hertz, Matthew, Stephen M. Blackburn, J. Eliot B. Moss, Kathryn S. McKinley, & Darko Stefanović. (2002). Error-free garbage collection traces. ACM SIGMETRICS Performance Evaluation Review. 30(1). 140–151.6 indexed citations
17.
Stefanović, Darko, Matthew Hertz, Stephen M. Blackburn, Kathryn S. McKinley, & J. Eliot B. Moss. (2002). Older-first garbage collection in practice. ACM SIGPLAN Notices. 38(2 supplement). 25–36.24 indexed citations
18.
Hertz, Matthew, Stephen M. Blackburn, J. Eliot B. Moss, Kathryn S. McKinley, & Darko Stefanović. (2002). Error-free garbage collection traces. 140–151.42 indexed citations
19.
Blackburn, Stephen M., et al.. (2001). Pretenuring for Java. 342–352.73 indexed citations
20.
Blackburn, Stephen M., et al.. (2001). Pretenuring for Java. ACM SIGPLAN Notices. 36(11). 342–352.5 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.