Jan Schwinghammer

636 total citations
19 papers, 238 citations indexed

About

Jan Schwinghammer is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Jan Schwinghammer has authored 19 papers receiving a total of 238 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 6 papers in Computer Networks and Communications. Recurrent topics in Jan Schwinghammer's work include Logic, programming, and type systems (18 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (8 papers). Jan Schwinghammer is often cited by papers focused on Logic, programming, and type systems (18 papers), Logic, Reasoning, and Knowledge (13 papers) and Formal Methods in Verification (8 papers). Jan Schwinghammer collaborates with scholars based in Germany, Denmark and United Kingdom. Jan Schwinghammer's co-authors include Lars Birkedal, Kristian Støvring, Rasmus Ejlers Møgelberg, Joachim Niehren, Bernhard Reus, Hongseok Yang, Gert Smolka, Manfred Schmidt-Schauß, Aleš Bizjak and Cătălin Hriţcu and has published in prestigious journals such as Theoretical Computer Science, ACM SIGPLAN Notices and Journal of Functional Programming.

In The Last Decade

Jan Schwinghammer

19 papers receiving 224 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Jan Schwinghammer Germany 9 219 123 80 42 10 19 238
Kristian Støvring Denmark 10 273 1.2× 157 1.3× 76 0.9× 36 0.9× 15 1.5× 23 288
Venanzio Capretta United Kingdom 6 195 0.9× 133 1.1× 47 0.6× 38 0.9× 6 0.6× 13 222
Shin-ya Katsumata Japan 8 178 0.8× 91 0.7× 25 0.3× 39 0.9× 9 0.9× 28 192
Aleš Bizjak Denmark 7 219 1.0× 115 0.9× 107 1.3× 50 1.2× 17 1.7× 9 242
Geoffrey Burn United Kingdom 7 179 0.8× 124 1.0× 41 0.5× 68 1.6× 18 1.8× 16 214
Hayo Thielecke United Kingdom 9 249 1.1× 155 1.3× 34 0.4× 45 1.1× 22 2.2× 22 264
Irène Guessarian France 7 155 0.7× 155 1.3× 29 0.4× 13 0.3× 11 1.1× 28 213
Hendrik Tews Germany 8 144 0.7× 88 0.7× 29 0.4× 42 1.0× 29 2.9× 18 167
Alceste Scalas United Kingdom 7 154 0.7× 109 0.9× 79 1.0× 54 1.3× 18 1.8× 26 187
Robert Dockins United States 6 133 0.6× 92 0.7× 34 0.4× 31 0.7× 8 0.8× 11 144

Countries citing papers authored by Jan Schwinghammer

Since Specialization
Citations

This map shows the geographic impact of Jan Schwinghammer'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 Schwinghammer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Schwinghammer more than expected).

Fields of papers citing papers by Jan Schwinghammer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jan Schwinghammer. 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 Schwinghammer. The network helps show where Jan Schwinghammer may publish in the future.

Co-authorship network of co-authors of Jan Schwinghammer

This figure shows the co-authorship network connecting the top 25 collaborators of Jan Schwinghammer. A scholar is included among the top collaborators of Jan Schwinghammer 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 Schwinghammer. Jan Schwinghammer is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

19 of 19 papers shown
1.
Niehren, Joachim, et al.. (2015). Observational program calculi and the correctness of translations. Theoretical Computer Science. 577. 98–124. 6 indexed citations
2.
Birkedal, Lars, Aleš Bizjak, & Jan Schwinghammer. (2013). Step-Indexed Relational Reasoning for Countable Nondeterminism. Logical Methods in Computer Science. Volume 9, Issue 4. 10 indexed citations
3.
Birkedal, Lars, Rasmus Ejlers Møgelberg, Jan Schwinghammer, & Kristian Støvring. (2012). First steps in synthetic guarded domain theory: step-indexing in the topos of trees. Logical Methods in Computer Science. Volume 8, Issue 4. 34 indexed citations
4.
Schwinghammer, Jan, Lars Birkedal, François Pottier, et al.. (2012). A step-indexed Kripke model of hidden state. Mathematical Structures in Computer Science. 23(1). 1–54. 4 indexed citations
5.
Schwinghammer, Jan, Lars Birkedal, Bernhard Reus, & Hongseok Yang. (2011). Nested Hoare Triples and Frame Rules for Higher-order Store. Logical Methods in Computer Science. Volume 7, Issue 3. 8 indexed citations
6.
Birkedal, Lars, et al.. (2011). Step-indexed kripke models over recursive worlds. 119–132. 32 indexed citations
7.
Schwinghammer, Jan & Lars Birkedal. (2011). Step-Indexed Relational Reasoning for Countable Nondeterminism. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations
8.
Birkedal, Lars, Rasmus Ejlers Møgelberg, Jan Schwinghammer, & Kristian Støvring. (2011). First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees. IT University Of Copenhagen (IT University of Copenhagen). 55–64. 37 indexed citations
9.
Birkedal, Lars, et al.. (2011). Step-indexed kripke models over recursive worlds. ACM SIGPLAN Notices. 46(1). 119–132. 27 indexed citations
10.
Birkedal, Lars, Jan Schwinghammer, & Kristian Støvring. (2010). A Metric Model of Lambda Calculus with Guarded Recursion.. Research at the University of Copenhagen (University of Copenhagen). 19–25. 9 indexed citations
11.
Birkedal, Lars, Jan Schwinghammer, & Kristian Støvring. (2010). A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces. Research at the University of Copenhagen (University of Copenhagen). 27–33. 1 indexed citations
12.
Schwinghammer, Jan, et al.. (2009). On Correctness of Buffer Implementations in a Concurrent Lambda Calculus with Futures. Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt). 1 indexed citations
13.
Hriţcu, Cătălin & Jan Schwinghammer. (2009). A Step-indexed Semantics of Imperative Objects. Logical Methods in Computer Science. Volume 5, Issue 4. 6 indexed citations
14.
Schwinghammer, Jan, et al.. (2009). Formalizing a strong normalization proof for Moggi's computational metalanguage. 57–63. 5 indexed citations
15.
Schwinghammer, Jan, et al.. (2009). Correctly translating concurrency primitives. 27–38. 3 indexed citations
16.
Schwinghammer, Jan. (2008). Coherence of subsumption for monadic types. Journal of Functional Programming. 19(2). 157–172. 2 indexed citations
17.
Niehren, Joachim, et al.. (2007). Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures. Electronic Notes in Theoretical Computer Science. 173. 313–337. 15 indexed citations
18.
Niehren, Joachim, Jan Schwinghammer, & Gert Smolka. (2006). A concurrent lambda calculus with futures. Theoretical Computer Science. 364(3). 338–356. 33 indexed citations
19.
Reus, Bernhard & Jan Schwinghammer. (2006). Denotational semantics for a program logic of objects. Mathematical Structures in Computer Science. 16(2). 313–358. 3 indexed citations

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

Rankless by CCL
2026