Christoph Matheja

752 total citations
12 papers, 185 citations indexed

About

Christoph Matheja is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Christoph Matheja has authored 12 papers receiving a total of 185 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Artificial Intelligence, 9 papers in Computational Theory and Mathematics and 2 papers in Computer Networks and Communications. Recurrent topics in Christoph Matheja's work include Logic, programming, and type systems (10 papers), Formal Methods in Verification (9 papers) and Logic, Reasoning, and Knowledge (4 papers). Christoph Matheja is often cited by papers focused on Logic, programming, and type systems (10 papers), Formal Methods in Verification (9 papers) and Logic, Reasoning, and Knowledge (4 papers). Christoph Matheja collaborates with scholars based in Germany, Switzerland and United Kingdom. Christoph Matheja's co-authors include Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Péter Müller, Alexander J. Summers, Thomas Noll and Florian Zuleger and has published in prestigious journals such as Journal of the ACM, Acta Informatica and Proceedings of the ACM on Programming Languages.

In The Last Decade

Christoph Matheja

12 papers receiving 184 citations

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Christoph Matheja	149	116	53	24	18	12	185
Federico Olmedo	211 1.4×	113 1.0×	33 0.6×	32 1.3×	19 1.1×	13	235
René Thiemann	267 1.8×	205 1.8×	44 0.8×	26 1.1×	39 2.2×	49	290
Rafael Caballero	115 0.8×	56 0.5×	65 1.2×	35 1.5×	45 2.5×	35	171
Stefan Berghofer	164 1.1×	120 1.0×	34 0.6×	22 0.9×	10 0.6×	19	181
Temur Kutsia	175 1.2×	105 0.9×	27 0.5×	47 2.0×	19 1.1×	53	205
Herman Geuvers	297 2.0×	228 2.0×	25 0.5×	37 1.5×	26 1.4×	51	343
Carroll Morgan	167 1.1×	144 1.2×	32 0.6×	29 1.2×	9 0.5×	17	200
Alberto Momigliano	247 1.7×	158 1.4×	26 0.5×	35 1.5×	27 1.5×	37	263
Dilian Gurov	91 0.6×	92 0.8×	47 0.9×	33 1.4×	23 1.3×	38	140
Anton Wijs	68 0.5×	112 1.0×	77 1.5×	23 1.0×	14 0.8×	37	176

Countries citing papers authored by Christoph Matheja

Since Specialization

Citations

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

Fields of papers citing papers by Christoph Matheja

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Christoph Matheja

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

All Works

Sort: Min cites: Since: Top N: Style:

12 of 12 papers shown

Kaminski, Benjamin Lucien, et al.. (2023). A Deductive Verification Infrastructure for Probabilistic Programs. Proceedings of the ACM on Programming Languages. 7(OOPSLA2). 2052–2082. 3 indexed citations

Kaminski, Benjamin Lucien, et al.. (2023). A Calculus for Amortized Expected Runtimes. Proceedings of the ACM on Programming Languages. 7(POPL). 1957–1986. 9 indexed citations

Matheja, Christoph, et al.. (2022). A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions. ACM Transactions on Computational Logic. 24(1). 1–76. 2 indexed citations

Matheja, Christoph, et al.. (2021). Modular specification and verification of closures in Rust. Proceedings of the ACM on Programming Languages. 5(OOPSLA). 1–29. 11 indexed citations

Kaminski, Benjamin Lucien, et al.. (2021). Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning. Proceedings of the ACM on Programming Languages. 5(POPL). 1–30. 11 indexed citations

Matheja, Christoph, et al.. (2020). How do programmers use unsafe rust?. Proceedings of the ACM on Programming Languages. 4(OOPSLA). 1–27. 37 indexed citations

Matheja, Christoph. (2020). Automated reasoning and randomization in separation logic. RWTH Publications (RWTH Aachen). 3 indexed citations

Kaminski, Benjamin Lucien, et al.. (2019). Quantitative separation logic: a logic for reasoning about probabilistic pointer programs. Proceedings of the ACM on Programming Languages. 3(POPL). 1–29. 24 indexed citations

Kaminski, Benjamin Lucien, Joost-Pieter Katoen, & Christoph Matheja. (2018). On the hardness of analyzing probabilistic programs. Acta Informatica. 56(3). 255–285. 16 indexed citations

10.

Kaminski, Benjamin Lucien, Joost-Pieter Katoen, Christoph Matheja, & Federico Olmedo. (2018). Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms. Journal of the ACM. 65(5). 1–68. 29 indexed citations

11.

Matheja, Christoph, et al.. (2018). Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic. 9. 23–8. 2 indexed citations

12.

Olmedo, Federico, Benjamin Lucien Kaminski, Joost-Pieter Katoen, & Christoph Matheja. (2016). Reasoning about Recursive Probabilistic Programs. 672–681. 38 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