Peter Lammich

65 papers receiving 703 citations

Peers

Peter Lammich
Comparison fields: 5 of 41
  • Software 178
  • Computational Theory and Mathematics 499
  • Hardware and Architecture 165
  • Artificial Intelligence 555
  • Computer Networks and Communications 127
Replace Leander Tentrup with:
Leander Tentrup Germany
Ken McMillan United States
Eli Singerman Israel
Oded Padon United States
Corneliu Popeea Germany
Deepak D’Souza India
Henrik Reif Andersen Denmark
Mohamed Nassim Seghir United Kingdom
Roberto Bruttomesso Italy
Steven M. German United States
Peter Lammich relative to Leander Tentrup Germany Leander Tentrup's profile →
Citations per field
00.5×3.6×
Leander Tentrup · 1×
Citations per year

Countries citing papers authored by Peter Lammich

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 19 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.

Border = papers with Peter Lammich Line = papers co-authored together Peter Lammich links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 69 papers — load more, or switch the sort, to bring in the rest.

#Work
1 201361
2 201245
3 201538
4 201337
5 201037
6 200927
7 201927
8 201425
9 201724
10 201823
11 201823
12 201422
13 201721
14 201619
15
Dijkstra's Shortest Path Algorithm.
201218
16 201117
17 201117
18 201617
19 201117
20 201515

About Peter Lammich

Peter Lammich is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Software and Hardware and Architecture, having authored 69 papers that have together received 734 indexed citations. Recurring topics across this work include Formal Methods in Verification (35 papers), Logic, programming, and type systems (32 papers), Software Testing and Debugging Techniques (13 papers), Parallel Computing and Optimization Techniques (11 papers), Security and Verification in Computing (11 papers), Advanced Database Systems and Queries (9 papers), Algorithms and Data Compression (8 papers) and Distributed systems and fault tolerance (8 papers). The work is most often cited by research in Software (178 citations), Computational Theory and Mathematics (499 citations), Hardware and Architecture (165 citations), Artificial Intelligence (555 citations) and Computer Networks and Communications (127 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, Javier Esparza, Andrei Popescu, Jasmin Christian Blanchette, Christoph Weidenbach and Thomas Reps. Their work appears in journals such as Journal of Automated Reasoning, Lecture notes in computer science, International Journal on Software Tools for Technology Transfer, ACM SIGPLAN Notices and Proceedings of the ACM on Programming Languages.

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.

Explore authors with similar magnitude of impact