Cătălin Dima

564 total citations
14 papers, 65 citations indexed

About

Cătălin Dima is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Cătălin Dima has authored 14 papers receiving a total of 65 indexed citations (citations by other indexed papers that have themselves been cited), including 12 papers in Computational Theory and Mathematics, 9 papers in Artificial Intelligence and 2 papers in Software. Recurrent topics in Cătălin Dima's work include Formal Methods in Verification (10 papers), Logic, programming, and type systems (8 papers) and Logic, Reasoning, and Knowledge (8 papers). Cătălin Dima is often cited by papers focused on Formal Methods in Verification (10 papers), Logic, programming, and type systems (8 papers) and Logic, Reasoning, and Knowledge (8 papers). Cătălin Dima collaborates with scholars based in France, Italy and Bulgaria. Cătălin Dima's co-authors include Dimitar P. Guelev, Constantin Enea, Eugène Asarin, Marie-Pierre Béal, Ruggero Lanotte, Aniello Murano, Francesco Belardinelli, Frédéric Lang, Wojciech Jamroga and Sophie Pinchinat and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Information and Computation.

In The Last Decade

Cătălin Dima

11 papers receiving 62 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Cătălin Dima France	5	53	50	5	5	3	14	65
Jurriaan Rot Netherlands	5	60 1.1×	71 1.4×	5 1.0×	8 1.6×	8 2.7×	30	81
Russell Harmer United Kingdom	3	53 1.0×	73 1.5×	2 0.4×	8 1.6×	7 2.3×	4	78
Cyril Nicaud France	4	49 0.9×	41 0.8×	9 1.8×	2 0.4×	5 1.7×	19	63
Russell O’Connor Netherlands	5	35 0.7×	38 0.8×	6 1.2×	3 0.6×	1 0.3×	8	49
Manfred Kufleitner Germany	6	84 1.6×	75 1.5×	3 0.6×		4 1.3×	30	98
Anders Mörtberg Sweden	5	28 0.5×	47 0.9×	16 3.2×	3 0.6×	8 2.7×	12	67
Harald Zankl Austria	4	41 0.8×	50 1.0×		8 1.6×	6 2.0×	19	51
Nathanaël Fijalkow France	5	55 1.0×	57 1.1×		4 0.8×	4 1.3×	24	66
Olivier Finkel France	8	151 2.8×	43 0.9×	11 2.2×	2 0.4×	3 1.0×	38	160
Cyril Cohen France	3	34 0.6×	37 0.7×		3 0.6×	1 0.3×	6	45

Countries citing papers authored by Cătălin Dima

Since Specialization

Citations

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

Fields of papers citing papers by Cătălin Dima

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Cătălin Dima. 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 Cătălin Dima. The network helps show where Cătălin Dima may publish in the future.

Co-authorship network of co-authors of Cătălin Dima

This figure shows the co-authorship network connecting the top 25 collaborators of Cătălin Dima. A scholar is included among the top collaborators of Cătălin Dima 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 Cătălin Dima. Cătălin Dima 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:

14 of 14 papers shown

Dima, Cătălin, et al.. (2021). Rational Synthesis in the Commons with Careless and Careful Agents. View. 368–376.

Belardinelli, Francesco, et al.. (2020). Bisimulations for verifying strategic abilities with an application to the ThreeBallot voting protocol. Information and Computation. 276. 104552–104552. 2 indexed citations

Belardinelli, Francesco, Cătălin Dima, & Aniello Murano. (2018). Bisimulations for Logics of Strategies: A Study in Expressiveness and Verification. Spiral (Imperial College London). 3 indexed citations

Dima, Cătălin, et al.. (2018). Relating Paths in Transition Systems. ACM Transactions on Computational Logic. 19(3). 1–33.

Lang, Frédéric, et al.. (2016). Verification of EB3 specifications using CADP. Formal Aspects of Computing. 28(1). 145–178.

Asarin, Eugène, et al.. (2015). Entropy Games. arXiv (Cornell University). 1 indexed citations

Béal, Marie-Pierre, et al.. (2015). Sofic-Dyck shifts. Theoretical Computer Science. 609. 226–244. 5 indexed citations

Dima, Cătălin, et al.. (2012). MODEL-CHECKING ALTERNATING-TIME TEMPORAL LOGIC WITH STRATEGIES BASED ON COMMON KNOWLEDGE IS UNDECIDABLE. Applied Artificial Intelligence. 26(4). 331–348. 2 indexed citations

Guelev, Dimitar P., Cătălin Dima, & Constantin Enea. (2011). An alternating-time temporal logic with knowledge, perfect recall and past: axiomatisation and model-checking. Journal of Applied Non-Classical Logics. 21(1). 93–131. 17 indexed citations

10.

Dima, Cătălin & Ruggero Lanotte. (2011). A study on shuffle, stopwatches and independently evolving clocks. Distributed Computing. 25(1). 5–33. 1 indexed citations

11.

Dima, Cătălin. (2010). Non-axiomatizability for the linear temporal logic of knowledge with concrete observability. Journal of Logic and Computation. 21(6). 939–958. 1 indexed citations

12.

Dima, Cătălin, Constantin Enea, & Dimitar P. Guelev. (2010). Model-Checking an Alternating-time Temporal Logic with Knowledge, Imperfect Information, Perfect Recall and Communicating Coalitions. SHILAP Revista de lepidopterología. 25. 103–117. 11 indexed citations

13.

Asarin, Eugène & Cătălin Dima. (2003). Balanced timed regular expressions1 1Partially supported by the European community project IST-2001-35304 AMETIST. Electronic Notes in Theoretical Computer Science. 68(5). 16–33. 7 indexed citations

14.

Dima, Cătălin. (2001). Real-time automata. Journal of automata, languages and combinatorics. 6(1). 3–23. 15 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