Jan Hoffmann
- Artificial Intelligence top 5%
- Computational Theory and Mathematics top 1%
- Hardware and Architecture top 5%
- Computer Networks and Communications top 10%
- Software top 5%
- Co-authors
- Klaus AehligZhong ShaoMartin HofmannDi WangShu-Chun WengNick BentonTahina RamananandroNeelakantan R. Krishnaswami
- Topics
- Formal Methods in Verification (29 papers)Logic, programming, and type systems (23 papers)Parallel Computing and Optimization Techniques (12 papers)
- Journals
- Theoretical Computer ScienceACM SIGPLAN NoticesACM Transactions on Programming Languages and Systems
- Partner nations
- United StatesGermanyUnited Kingdom
In The Last Decade
Jan Hoffmann
39 papers receiving 559 citations
Peers
Comparison fields: 5 of 31
- Artificial Intelligence 451
- Computational Theory and Mathematics 362
- Hardware and Architecture 182
- Computer Networks and Communications 125
- Software 122
Countries citing papers authored by Jan Hoffmann
This map shows the geographic impact of Jan Hoffmann'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 Jan Hoffmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Hoffmann more than expected).
Fields of papers citing papers by Jan Hoffmann
This network shows the impact of papers produced by Jan Hoffmann. 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 Jan Hoffmann. The network helps show where Jan Hoffmann may publish in the future.
Co-authorship network of co-authors of Jan Hoffmann
This figure shows the co-authorship network connecting the top 25 collaborators of Jan Hoffmann. A scholar is included among the top collaborators of Jan Hoffmann 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 Jan Hoffmann. Jan Hoffmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 5 | |
| 4 | 7 | |
| 5 | 4 | |
| 6 | 2 | |
| 7 | 15 | |
| 8 | 33 | |
| 9 | 2 | |
| 10 | 6 | |
| 11 | 33 | |
| 12 | 5 | |
| 13 | 6 | |
| 14 | 41 | |
| 15 | 32 | |
| 16 | 18 | |
| 17 | 47 | |
| 18 | 1 | |
| 19 | 1 | |
| 20 | 2 |
About Jan Hoffmann
Jan Hoffmann is a scholar working on Software, Hardware and Architecture and Computational Theory and Mathematics, having authored 41 papers that have together received 578 indexed citations. Recurring topics across this work include Formal Methods in Verification (29 papers), Logic, programming, and type systems (23 papers) and Parallel Computing and Optimization Techniques (12 papers). The work is most often cited by research in Software (122 citations), Hardware and Architecture (182 citations) and Computational Theory and Mathematics (362 citations). Jan Hoffmann has collaborated with scholars based in United States, Germany and United Kingdom. Frequent co-authors include Klaus Aehlig, Zhong Shao, Martin Hofmann, Di Wang, Martin Hofmann, Shu-Chun Weng, Nick Benton, Tahina Ramananandro, Neelakantan R. Krishnaswami and Thomas Reps. Their work appears in journals such as Theoretical Computer Science, ACM SIGPLAN Notices and ACM Transactions on Programming Languages and Systems.
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.