Jan Rutten

1.8k total citations
47 papers, 755 citations indexed

About

Jan Rutten is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Software. According to data from OpenAlex, Jan Rutten has authored 47 papers receiving a total of 755 indexed citations (citations by other indexed papers that have themselves been cited), including 34 papers in Artificial Intelligence, 30 papers in Computational Theory and Mathematics and 8 papers in Software. Recurrent topics in Jan Rutten's work include Logic, programming, and type systems (29 papers), Formal Methods in Verification (21 papers) and semigroups and automata theory (11 papers). Jan Rutten is often cited by papers focused on Logic, programming, and type systems (29 papers), Formal Methods in Verification (21 papers) and semigroups and automata theory (11 papers). Jan Rutten collaborates with scholars based in Netherlands, France and United Kingdom. Jan Rutten's co-authors include Farhad Arbab, Christel Baier, Marjan Sirjani, B.M.J. Smets, Marcello Bonsangue, Alexandra Silva, Daniele Turi, Filippo Bonchi, Frank de Boer and Helle Hvid Hansen and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of The Electrochemical Society and Materials Research Bulletin.

In The Last Decade

Jan Rutten

46 papers receiving 721 citations

Peers

Jan Rutten
Myla Archer United States
C. Strachey United Kingdom
Colin H. West Switzerland
Jan Rutten
Citations per year, relative to Jan Rutten Jan Rutten (= 1×) peers Saurabh Srivastava

Countries citing papers authored by Jan Rutten

Since Specialization
Citations

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

Fields of papers citing papers by Jan Rutten

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Jan Rutten

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

All Works

20 of 20 papers shown
1.
Hansen, Helle Hvid, Clemens Kupke, & Jan Rutten. (2017). \nSTREAM DIFFERENTIAL EQUATIONS: SPECIFICATION FORMATS AND SOLUTION METHODS. Radboud Repository (Radboud University). 5 indexed citations
2.
Hansen, Helle Hvid, Clemens Kupke, & Jan Rutten. (2017). Stream Differential Equations: Specification Formats and Solution Methods. Logical Methods in Computer Science. Volume 13, Issue 1(1). 1–51. 3 indexed citations
3.
Ballester‐Bolinches, A., et al.. (2015). Formations of Monoids, Congruences, and Formal Languages. SHILAP Revista de lepidopterología. 171–209. 6 indexed citations
4.
Ballester‐Bolinches, A., et al.. (2015). The dual equivalence of equations and coequations for automata. Information and Computation. 244. 49–75. 3 indexed citations
5.
Bonchi, Filippo, Marcello Bonsangue, Helle Hvid Hansen, et al.. (2014). Algebra-coalgebra duality in brzozowski's minimization algorithm. ACM Transactions on Computational Logic. 15(1). 1–29. 21 indexed citations
6.
Silva, Alexandra, Filippo Bonchi, Marcello Bonsangue, & Jan Rutten. (2013). Generalizing determinization from automata to coalgebras. Logical Methods in Computer Science. Volume 9, Issue 1. 50 indexed citations
7.
Winter, Joost de, Marcello Bonsangue, & Jan Rutten. (2011). Context-free languages, coalgebraically. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 2 indexed citations
8.
Kupke, Clemens & Jan Rutten. (2011). On the final coalgebra of automatic sequences. Data Archiving and Networked Services (DANS). 1–14. 1 indexed citations
9.
Sun, Meng, et al.. (2011). Connectors as designs: Modeling, refinement and test case generation. Science of Computer Programming. 77(7-8). 799–822. 13 indexed citations
10.
Jacobs, B., et al.. (2011). Preface. Theoretical Computer Science. 412(38). 4967–4968. 1 indexed citations
11.
Jacobs, B., et al.. (2010). CMCS'10 Short Contributions : 10th International Workshop on Coalgebraic Methods in Computer Science. Data Archiving and Networked Services (DANS). 1 indexed citations
12.
Kupke, Clemens & Jan Rutten. (2010). Complete sets of cooperations. Information and Computation. 208(12). 1398–1420. 3 indexed citations
13.
Silva, Alexandra & Jan Rutten. (2009). A coinductive calculus of binary trees. Information and Computation. 208(5). 578–593. 6 indexed citations
14.
Bonsangue, Marcello, Jan Rutten, & Alexandra Silva. (2007). Regular expressions for polynomial coalgebras. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1 indexed citations
15.
Bonsangue, Marcello, Jan Rutten, & Alexandra Silva. (2007). Coalgebraic logic and synthesis of Mealy machines. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–17.
16.
Baier, Christel, Marjan Sirjani, Farhad Arbab, & Jan Rutten. (2006). Modeling component connectors in Reo by constraint automata. Science of Computer Programming. 61(2). 75–113. 135 indexed citations
17.
Arbab, Farhad, Christel Baier, Frank de Boer, & Jan Rutten. (2004). Models and temporal logics for timed component connectors. 198–207. 28 indexed citations
18.
Arbab, Farhad, et al.. (2003). Modeling component connectors in Reo by constraint automata. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–15. 19 indexed citations
19.
Rutten, Jan. (1996). Elements of generalized ultrametric domain theory. Theoretical Computer Science. 170(1-2). 349–381. 57 indexed citations
20.
Kok, Joost N., et al.. (1990). From failure to succes: comparing a denotational and a declarative semantics for Horn Clause Logic. Department of Computer Science [CS]. 9019. 1–20. 4 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