Matt Kaufmann
Impact in
- Software top 2%
- Software Testing and Debugging Techniques
- Computational Theory and Mathematics top 0.5%
- Formal Methods in Verification
- Computability, Logic, AI Algorithms
Papers in
-
- Formal Methods in Verification 29
- Computability, Logic, AI Algorithms 7
- Co-authors
- J Strother MoorePanagiotis ManoliosWarren A. HuntSaharon ShelahMichael MakkaiJon BarwiseJames H. SchmerlRuben Gamboa
- Journals
- Journal of Automated Reasoning (8 papers)Journal of Symbolic Logic (4 papers)Annals of Pure and Applied Logic (2 papers)Proceedings of the American Mathematical Society (2 papers)Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences (1 paper)
- Partner nations
- United StatesUnited KingdomCanada
In The Last Decade
Matt Kaufmann
69 papers receiving 812 citations
Peers
Comparison fields: 5 of 59
- Software 185
- Computational Theory and Mathematics 631
- Hardware and Architecture 213
- Artificial Intelligence 595
- Theoretical Computer Science 18
Countries citing papers authored by Matt Kaufmann
This map shows the geographic impact of Matt Kaufmann'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 Matt Kaufmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matt Kaufmann more than expected).
Fields of papers citing papers by Matt Kaufmann
This network shows the impact of papers produced by Matt Kaufmann. 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 Matt Kaufmann. The network helps show where Matt Kaufmann may publish in the future.
Co-authors
The 25 scholars most cited alongside Matt Kaufmann, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2018 | 2 | |
| 2 | 2017 | 4 | |
| 3 | 2017 | 1 | |
| 4 | A formal model of a large memory that supports efficient execution | 2012 | 3 |
| 5 | A Futures Library and Parallelism Abstractions for a Functional Subset of Lisp. | 2011 | 1 |
| 6 | 2010 | 2 | |
| 7 | Proceedings of the First international conference on Interactive Theorem Proving | 2010 | 1 |
| 8 | 2010 | 4 | |
| 9 | 2007 | 12 | |
| 10 | 2007 | 15 | |
| 11 | 2000 | 88 | |
| 12 | ACL2 Support for Verification Projects (Invited Talk) | 1998 | 4 |
| 13 | A Mechanically Checked Proof of the | 1998 | 0 |
| 14 | 1995 | 55 | |
| 15 | 1985 | 33 | |
| 16 | 1984 | 0 | |
| 17 | 1981 | 1 | |
| 18 | 1981 | 9 | |
| 19 | 1978 | 34 | |
| 20 | 1977 | 19 |
About Matt Kaufmann
Matt Kaufmann is a scholar working on Computational Theory and Mathematics, Theoretical Computer Science, Software, Hardware and Architecture and Artificial Intelligence, having authored 73 papers that have together received 935 indexed citations. Recurring topics across this work include Logic, programming, and type systems (32 papers), Formal Methods in Verification (29 papers), Logic, Reasoning, and Knowledge (11 papers), Advanced Topology and Set Theory (10 papers), Parallel Computing and Optimization Techniques (10 papers), Embedded Systems Design Techniques (9 papers), Software Testing and Debugging Techniques (9 papers) and Computability, Logic, AI Algorithms (7 papers). The work is most often cited by research in Software (185 citations), Computational Theory and Mathematics (631 citations), Hardware and Architecture (213 citations), Artificial Intelligence (595 citations) and Theoretical Computer Science (18 citations). Matt Kaufmann has collaborated with scholars based in United States, United Kingdom and Canada. Frequent co-authors include J Strother Moore, Panagiotis Manolios, Warren A. Hunt, Saharon Shelah, Michael Makkai, Jon Barwise, James H. Schmerl, Ruben Gamboa, Peter C. Dillinger and C. Ward Henson. Their work appears in journals such as Journal of Automated Reasoning, Journal of Symbolic Logic, Annals of Pure and Applied Logic, Proceedings of the American Mathematical Society and Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences.
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.