Cezar Câmpeanu

584 total citations
28 papers, 211 citations indexed

About

Cezar Câmpeanu is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Cezar Câmpeanu has authored 28 papers receiving a total of 211 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computational Theory and Mathematics, 19 papers in Artificial Intelligence and 17 papers in Molecular Biology. Recurrent topics in Cezar Câmpeanu's work include semigroups and automata theory (23 papers), DNA and Biological Computing (17 papers) and Machine Learning and Algorithms (8 papers). Cezar Câmpeanu is often cited by papers focused on semigroups and automata theory (23 papers), DNA and Biological Computing (17 papers) and Machine Learning and Algorithms (8 papers). Cezar Câmpeanu collaborates with scholars based in Canada, United States and Romania. Cezar Câmpeanu's co-authors include Sheng Yü, Kai Salomaa, Andrei Păun, S. Yu, Shengsheng Yu, Cristian S. Calude, Rogério Reis, Nelma Moreira, Lila Kari and Sándor Vágvölgyi and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Complexity.

In The Last Decade

Cezar Câmpeanu

25 papers receiving 194 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Cezar Câmpeanu Canada 8 175 172 93 19 16 28 211
Valentin M. Antimirov France 2 124 0.7× 120 0.7× 39 0.4× 17 0.9× 11 0.7× 5 148
Djelloul Ziadi France 8 138 0.8× 157 0.9× 67 0.7× 10 0.5× 12 0.8× 37 211
Marc Zeitoun France 8 147 0.8× 103 0.6× 29 0.3× 8 0.4× 8 0.5× 35 174
Géraud Sénizergues France 10 259 1.5× 204 1.2× 64 0.7× 13 0.7× 10 0.6× 26 300
Rogério Reis Portugal 7 129 0.7× 109 0.6× 72 0.8× 12 0.6× 7 0.4× 55 167
Jean-Marc Champarnaud France 10 228 1.3× 196 1.1× 96 1.0× 5 0.3× 5 0.3× 44 262
Didier Caucal France 5 122 0.7× 91 0.5× 22 0.2× 16 0.8× 9 0.6× 11 139
H. C. M. Kleijn Netherlands 9 205 1.2× 97 0.6× 101 1.1× 16 0.8× 18 1.1× 29 230
Johannes Waldmann Germany 7 141 0.8× 179 1.0× 21 0.2× 18 0.9× 12 0.8× 17 194
Stefan Kiefer United Kingdom 9 165 0.9× 144 0.8× 22 0.2× 44 2.3× 8 0.5× 41 210

Countries citing papers authored by Cezar Câmpeanu

Since Specialization
Citations

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

Fields of papers citing papers by Cezar Câmpeanu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Cezar Câmpeanu

This figure shows the co-authorship network connecting the top 25 collaborators of Cezar Câmpeanu. A scholar is included among the top collaborators of Cezar Câmpeanu 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 Cezar Câmpeanu. Cezar Câmpeanu 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.
Câmpeanu, Cezar, Nelma Moreira, & Rogério Reis. (2016). On the dissimilarity operation on finite languages. Open Repository of the University of Porto (University of Porto). 105–120. 2 indexed citations
2.
Câmpeanu, Cezar, Nelma Moreira, & Rogério Reis. (2016). Distinguishability Operations and Closures. Fundamenta Informaticae. 148(3-4). 243–266. 2 indexed citations
3.
Câmpeanu, Cezar, Nelma Moreira, & Rogério Reis. (2014). The Distinguishability Operation On Regular Languages. arXiv (Cornell University). 85–100. 2 indexed citations
4.
Câmpeanu, Cezar. (2012). Randomness in Blum Universal Static Complexity Spaces. Journal of automata, languages and combinatorics. 17. 107–122.
5.
Câmpeanu, Cezar, et al.. (2009). On the intersection of regex languages with regular languages. Theoretical Computer Science. 410(24-25). 2336–2344. 10 indexed citations
6.
Câmpeanu, Cezar & Stavros Konstantinidis. (2008). STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING. International Journal of Foundations of Computer Science. 19(5). 1099–1112.
7.
Câmpeanu, Cezar, et al.. (2006). Tight Bounds for the State Complexity of Deterministic Cover Automata.. 223–231. 2 indexed citations
8.
Calude, Cristian S., et al.. (2006). Automata Recognizing No Words: A Statistical Approach. Fundamenta Informaticae. 73(1). 1–18. 4 indexed citations
9.
Câmpeanu, Cezar, et al.. (2006). Incremental construction of minimal deterministic finite cover automata. Theoretical Computer Science. 363(2). 135–148. 5 indexed citations
10.
Câmpeanu, Cezar, et al.. (2006). On Pattern Expression Languages. 2 indexed citations
11.
Câmpeanu, Cezar, Lila Kari, & Andrei Păun. (2004). Results on Transforming NFA into DFCA. Fundamenta Informaticae. 64(1). 53–63. 3 indexed citations
12.
Câmpeanu, Cezar, et al.. (2004). Mergible states in large NFA. Theoretical Computer Science. 330(1). 23–34. 12 indexed citations
13.
Câmpeanu, Cezar & Sheng Yü. (2004). Pattern expressions and pattern automata. Information Processing Letters. 92(6). 267–274. 9 indexed citations
14.
Biletskiy, Yevgen, et al.. (2004). Meta-context mediation to attain semantic interoperability. 2002. 238–243.
15.
Câmpeanu, Cezar, Kai Salomaa, & Sheng Yü. (2003). A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS. International Journal of Foundations of Computer Science. 14(6). 1007–1018. 49 indexed citations
16.
Câmpeanu, Cezar & Andrei Păun. (2002). The number of similarity relations and the number of minimal deterministic finite cover automata. 67–76. 1 indexed citations
17.
Câmpeanu, Cezar, et al.. (2001). Minimal cover-automata for finite languages. Theoretical Computer Science. 267(1-2). 3–16. 31 indexed citations
18.
Câmpeanu, Cezar, et al.. (1999). State Complexity of Basic Operations on Finite Languages. 7 indexed citations
19.
Câmpeanu, Cezar, et al.. (1999). Minimal Cover-Automata for Finite Languages. 3 indexed citations
20.
Calude, Cristian S. & Cezar Câmpeanu. (1996). Are binary codings universal?. Complexity. 1(5). 47–50. 2 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