Matthew Harren
- Artificial Intelligence top 2%
- Computer Networks and Communications top 5%
- Hardware and Architecture top 5%
- Signal Processing top 5%
- Information Systems top 5%
- Co-authors
- George C. NeculaJeremy ConditScott McPeakWestley WeimerZachary AndersonFeng ZhouRob EnnalsOded Shmueli
- Topics
- Security and Verification in Computing (6 papers)Parallel Computing and Optimization Techniques (4 papers)Advanced Database Systems and Queries (3 papers)
- Journals
- ACM SIGPLAN NoticesACM Transactions on Programming Languages and SystemsOperating Systems Design and Implementation
- Partner nations
- United StatesIsrael
In The Last Decade
Matthew Harren
9 papers receiving 573 citations
Peers
Comparison fields: 5 of 29
- Artificial Intelligence 474
- Computer Networks and Communications 281
- Hardware and Architecture 225
- Signal Processing 202
- Information Systems 161
Countries citing papers authored by Matthew Harren
This map shows the geographic impact of Matthew Harren'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 Harren with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthew Harren more than expected).
Fields of papers citing papers by Matthew Harren
This network shows the impact of papers produced by Matthew Harren. 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 Harren. The network helps show where Matthew Harren may publish in the future.
Co-authorship network of co-authors of Matthew Harren
This figure shows the co-authorship network connecting the top 25 collaborators of Matthew Harren. A scholar is included among the top collaborators of Matthew Harren 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 Harren. Matthew Harren is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Beyond bug-finding: sound program analysis for Linux | 5 |
| 2 | 123 | |
| 3 | 256 | |
| 4 | 32 | |
| 5 | 2 | |
| 6 | 19 | |
| 7 | 2 | |
| 8 | 108 | |
| 9 | 73 |
About Matthew Harren
Matthew Harren is a scholar working on Software, Hardware and Architecture and Computer Networks and Communications, having authored 9 papers that have together received 620 indexed citations. Recurring topics across this work include Security and Verification in Computing (6 papers), Parallel Computing and Optimization Techniques (4 papers) and Advanced Database Systems and Queries (3 papers). The work is most often cited by research in Hardware and Architecture (225 citations), Software (122 citations) and Signal Processing (202 citations). Matthew Harren has collaborated with scholars based in United States and Israel. Frequent co-authors include George C. Necula, Jeremy Condit, Scott McPeak, Westley Weimer, Zachary Anderson, Feng Zhou, Rob Ennals, Oded Shmueli, Michael Burke and Rajesh Bordawekar. Their work appears in journals such as ACM SIGPLAN Notices, ACM Transactions on Programming Languages and Systems and Operating Systems Design and Implementation.
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.