Stefan Milius

1.3k total citations
78 papers, 484 citations indexed

About

Stefan Milius is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Mathematical Physics. According to data from OpenAlex, Stefan Milius has authored 78 papers receiving a total of 484 indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Artificial Intelligence, 47 papers in Computational Theory and Mathematics and 27 papers in Mathematical Physics. Recurrent topics in Stefan Milius's work include Logic, programming, and type systems (59 papers), Logic, Reasoning, and Knowledge (37 papers) and Homotopy and Cohomology in Algebraic Topology (27 papers). Stefan Milius is often cited by papers focused on Logic, programming, and type systems (59 papers), Logic, Reasoning, and Knowledge (37 papers) and Homotopy and Cohomology in Algebraic Topology (27 papers). Stefan Milius collaborates with scholars based in Germany, Czechia and United States. Stefan Milius's co-authors include Jiřı́ Adámek, Jiřı́ Velebil, Peter Aczel, Lawrence S. Moss, Lutz Schröder, Paul Blain Levy, Alexandra Silva, Dirk Pattinson, Daniel Lohmann and S. A. Goncharov and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Stefan Milius

67 papers receiving 456 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Stefan Milius Germany	11	446	289	171	45	33	78	484
Giuseppe Rosolini Italy	13	324 0.7×	237 0.8×	142 0.8×	78 1.7×	35 1.1×	35	417
Martin Hyland United Kingdom	16	542 1.2×	382 1.3×	134 0.8×	101 2.2×	50 1.5×	28	627
Thomas Streicher Germany	12	331 0.7×	278 1.0×	72 0.4×	55 1.2×	16 0.5×	53	394
Alessandro Berarducci Italy	12	211 0.5×	233 0.8×	164 1.0×	193 4.3×	76 2.3×	40	467
Alexander Kurz United Kingdom	14	528 1.2×	418 1.4×	106 0.6×	42 0.9×	34 1.0×	67	617
Andrej Bauer Slovenia	10	187 0.4×	202 0.7×	45 0.3×	52 1.2×	17 0.5×	41	277
H. Peter Gumm Germany	14	246 0.6×	397 1.4×	115 0.7×	82 1.8×	128 3.9×	30	514
Laurent Régnier France	11	444 1.0×	350 1.2×	44 0.3×	33 0.7×	17 0.5×	15	482
Paul-André Melliès France	11	377 0.8×	269 0.9×	40 0.2×	28 0.6×	17 0.5×	35	416
Marc Bezem Norway	10	400 0.9×	299 1.0×	32 0.2×	33 0.7×	10 0.3×	44	480

Countries citing papers authored by Stefan Milius

Since Specialization

Citations

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

Fields of papers citing papers by Stefan Milius

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stefan Milius

This figure shows the co-authorship network connecting the top 25 collaborators of Stefan Milius. A scholar is included among the top collaborators of Stefan Milius 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 Stefan Milius. Stefan Milius 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:

20 of 20 papers shown

Milius, Stefan, et al.. (2024). Algebraic Reasoning over Relational Structures. Volume 4 - Proceedings of.... 1 indexed citations

Milius, Stefan, et al.. (2021). Monads on Categories of Relational Structures.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 2 indexed citations

Milius, Stefan, et al.. (2020). Efficient and Modular Coalgebraic Partition Refinement. SHILAP Revista de lepidopterología. 2 indexed citations

Milius, Stefan, et al.. (2020). A coalgebraic view on reachability. Commentationes Mathematicae Universitatis Carolinae. 60(4). 605–638.

Milius, Stefan. (2018). Proper Functors and Fixed Points for Finite Behaviour. SHILAP Revista de lepidopterología. 1 indexed citations

Milius, Stefan, et al.. (2017). A Coalgebraic Paige-Tarjan Algorithm.. arXiv (Cornell University).

Milius, Stefan, et al.. (2017). Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. Fundamenta Informaticae. 150(3-4). 407–449. 3 indexed citations

Adámek, Jiřı́, et al.. (2015). Syntactic Monoids in a Category. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Milius, Stefan & Lawrence S. Moss. (2015). EQUATIONAL PROPERTIES OF RECURSIVE PROGRAM SCHEME SOLUTIONS. French digital mathematics library (Numdam).

10.

Milius, Stefan, et al.. (2013). Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. Logical Methods in Computer Science. Volume 9, Issue 3. 10 indexed citations

11.

Adámek, Jiřı́, et al.. (2013). Well-Pointed Coalgebras. Logical Methods in Computer Science. Volume 9, Issue 3. 8 indexed citations

12.

Bonsangue, Marcello, Stefan Milius, & Jurriaan Rot. (2012). On the specification of operations on the rational behaviour of systems. SHILAP Revista de lepidopterología. 89. 3–18. 1 indexed citations

13.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2011). Semantics of Higher-Order Recursion Schemes. Logical Methods in Computer Science. Volume 7, Issue 1. 4 indexed citations

14.

Adámek, Jiřı́, et al.. (2011). Power-Set Functors and Saturated Trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 19. 2 indexed citations

15.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2008). Bases for parametrized iterativity. Information and Computation. 206(8). 966–1002. 2 indexed citations

16.

Adámek, Jiřı́ & Stefan Milius. (2006). Terminal coalgebras and free iterative theories. Information and Computation. 204(7). 1139–1172. 14 indexed citations

17.

Adámek, Jiřı́ & Stefan Milius. (2006). Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. Information and Computation. 204(4). 435–436. 1 indexed citations

18.

Milius, Stefan. (2004). Completely iterative algebras and completely iterative monads. Information and Computation. 196(1). 1–41. 41 indexed citations

19.

Adámek, Jiřı́, Stefan Milius, & Jiřı́ Velebil. (2004). On coalgebra based on classes. Theoretical Computer Science. 316(1-3). 3–23. 12 indexed citations

20.

Aczel, Peter, Jiřı́ Adámek, Stefan Milius, & Jiřı́ Velebil. (2003). Infinite trees and completely iterative theories: a coalgebraic view. Theoretical Computer Science. 300(1-3). 1–45. 69 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