Peter Lammich
Impact in
-
- Formal Methods in Verification
- semigroups and automata theory
- Artificial Intelligence top 2%
- Logic, programming, and type systems
- Security and Verification in Computing
- AI-based Problem Solving and Planning
Papers in
-
- Formal Methods in Verification 32
- Complexity and Algorithms in Graphs 5
-
- Logic, programming, and type systems 56
- Security and Verification in Computing 5
- Algorithms and Data Compression 4
- AI-based Problem Solving and Planning 2
- Logic, Reasoning, and Knowledge 1
- Co-authors
- Markus Müller-Olm (10 shared papers)Thomas Tuerk (1 shared paper)Andreas Lochbihler (2 shared papers)Helmut Seidl (5 shared papers)Tobias Nipkow (4 shared papers)Mathias Fleury (4 shared papers)Jasmin Christian Blanchette (3 shared papers)Javier Esparza (2 shared papers)
- Journals
- Journal of Automated Reasoning (7 papers)Lecture notes in computer science (26 papers)ACM Transactions on Programming Languages and Systems (1 paper)Proceedings of the ACM on Programming Languages (1 paper)ACM SIGPLAN Notices (1 paper)
- Partner nations
- GermanyUnited KingdomNetherlands
In The Last Decade
Peter Lammich
70 papers receiving 830 citations
Peers
Comparison fields: 5 of 27
- Computational Theory and Mathematics 421
- Artificial Intelligence 597
- Software 29
- Hardware and Architecture 24
- Computer Networks and Communications 36
Countries citing papers authored by Peter Lammich
This map shows the geographic impact of Peter Lammich'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 Lammich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter Lammich more than expected).
Fields of papers citing papers by Peter Lammich
This network shows the impact of papers produced by Peter Lammich. 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 Lammich. The network helps show where Peter Lammich may publish in the future.
Co-authors
The 17 scholars most cited alongside Peter Lammich, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 74 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 66 | |
| 2 | 2012 | 46 | |
| 3 | 2013 | 46 | |
| 4 | 2015 | 42 | |
| 5 | 2010 | 39 | |
| 6 | 2019 | 30 | |
| 7 | 2017 | 29 | |
| 8 | 2009 | 28 | |
| 9 | 2014 | 28 | |
| 10 | 2018 | 28 | |
| 11 | 2018 | 25 | |
| 12 | 2014 | 24 | |
| 13 | 2017 | 24 | |
| 14 | 2016 | 22 | |
| 15 | 2019 | 22 | |
| 16 | Dijkstra's Shortest Path Algorithm. | 2012 | 19 |
| 17 | 2011 | 18 | |
| 18 | 2011 | 18 | |
| 19 | 2011 | 18 | |
| 20 | 2016 | 17 |
About Peter Lammich
Peter Lammich is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Hardware and Architecture, Discrete Mathematics and Combinatorics and Nuclear Energy and Engineering, having authored 74 papers that have together received 854 indexed citations. Recurring topics across this work include Logic, programming, and type systems (56 papers), Formal Methods in Verification (32 papers), Complexity and Algorithms in Graphs (5 papers), Security and Verification in Computing (5 papers), Algorithms and Data Compression (4 papers), AI-based Problem Solving and Planning (2 papers), Real-Time Systems Scheduling (2 papers) and Logic, Reasoning, and Knowledge (1 paper). The work is most often cited by research in Computational Theory and Mathematics (421 citations), Artificial Intelligence (597 citations), Software (29 citations), Hardware and Architecture (24 citations) and Computer Networks and Communications (36 citations). Peter Lammich has collaborated with scholars based in Germany, United Kingdom and Netherlands. Frequent co-authors include Markus Müller-Olm, Thomas Tuerk, Andreas Lochbihler, Helmut Seidl, Tobias Nipkow, Mathias Fleury, Jasmin Christian Blanchette, Javier Esparza, Andrei Popescu and Vesal Vojdani. Their work appears in journals such as Journal of Automated Reasoning, Lecture notes in computer science, ACM Transactions on Programming Languages and Systems, Proceedings of the ACM on Programming Languages and ACM SIGPLAN Notices.
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.