André Arnold

2.6k total citations
63 papers, 1.2k citations indexed

About

André Arnold is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, André Arnold has authored 63 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 5 papers in Computer Networks and Communications. Recurrent topics in André Arnold's work include semigroups and automata theory (22 papers), Formal Methods in Verification (14 papers) and Logic, programming, and type systems (13 papers). André Arnold is often cited by papers focused on semigroups and automata theory (22 papers), Formal Methods in Verification (14 papers) and Logic, programming, and type systems (13 papers). André Arnold collaborates with scholars based in France, Poland and Canada. André Arnold's co-authors include Max Dauchet, Damian Niwiński, Maurice Nivat, John Plaice, Igor Walukiewicz, Mohamed Naïmi, Antoine Rauzy, Michel Latteux, Srečko Brlek and Rich S.W. Masters and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Journal of Parallel and Distributed Computing.

In The Last Decade

André Arnold

57 papers receiving 1.1k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
André Arnold France	18	930	653	181	156	131	63	1.2k
Luca Aceto Iceland	19	1.1k 1.2×	974 1.5×	200 1.1×	242 1.6×	120 0.9×	154	1.4k
Ernst-Rüdiger Olderog Germany	16	708 0.8×	654 1.0×	213 1.2×	178 1.1×	132 1.0×	56	959
Doron Peled United States	22	1.0k 1.1×	656 1.0×	287 1.6×	646 4.1×	237 1.8×	84	1.4k
Robert P. Kurshan United States	15	740 0.8×	290 0.4×	115 0.6×	356 2.3×	256 2.0×	51	984
Tommaso Bolognesi Italy	9	590 0.6×	451 0.7×	189 1.0×	294 1.9×	199 1.5×	36	909
Taylor L. Booth United States	11	241 0.3×	554 0.8×	132 0.7×	66 0.4×	73 0.6×	28	840
Andreas Podelski Germany	24	1.1k 1.2×	1.2k 1.8×	357 2.0×	625 4.0×	188 1.4×	113	1.7k
Tom Melham United Kingdom	11	658 0.7×	576 0.9×	130 0.7×	249 1.6×	295 2.3×	45	980
Rosaria Simone France	13	760 0.8×	338 0.5×	312 1.7×	192 1.2×	994 7.6×	54	1.4k
John Derrick United Kingdom	18	480 0.5×	628 1.0×	361 2.0×	535 3.4×	149 1.1×	106	1.2k

Countries citing papers authored by André Arnold

Since Specialization

Citations

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

Fields of papers citing papers by André Arnold

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of André Arnold

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

Arnold, André, Damian Niwiński, & Paweł Parys. (2021). A Quasi-Polynomial Black-Box Algorithm for Fixed Point Evaluation.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 23. 1 indexed citations

Raab, Markus, et al.. (2009). Discovery learning in sports: Implicit or explicit processes?. International Journal of Sport and Exercise Psychology. 7(4). 413–430. 22 indexed citations

Santocanale, Luigi & André Arnold. (2004). Ambiguous classes inμ-calculi hierarchies. Theoretical Computer Science. 333(1-2). 265–296. 8 indexed citations

Arnold, André. (2002). Nivat's processes and their synchronization. Theoretical Computer Science. 281(1-2). 31–36. 8 indexed citations

Arnold, André & Damian Niwiński. (2001). Rudiments of µ-calculus. CERN Document Server (European Organization for Nuclear Research). 30 indexed citations

Arnold, André & Damian Niwiński. (2001). Rudiments of μ-calculus. Elsevier eBooks. 47 indexed citations

Arnold, André, et al.. (1997). The embedded software of an electricity meter: An experience in using formal methods in an industrial project. Science of Computer Programming. 28(2-3). 93–110. 3 indexed citations

Arnold, André & Ilaria Castellani. (1996). An algebraic characterization of observational equivalence. Theoretical Computer Science. 156(1-2). 289–299. 3 indexed citations

Arnold, André. (1995). An initial semantics for the μ-calculus on trees and Rabin's complementation lemma. Theoretical Computer Science. 148(1). 121–132. 3 indexed citations

10.

Arnold, André & John Plaice. (1994). Finite transition systems: semantics of communicating systems. 109 indexed citations

11.

Arnold, André, et al.. (1992). A note about minimal non-deterministic automata.. Bulletin of the European Association for Theoretical Computer Science. 47. 166–169. 20 indexed citations

12.

Arnold, André. (1991). MEC: A System for Constructing and Analysis Transition Systems. 81–82.

13.

Arnold, André. (1990). Proceedings of the 15th Colloquium on Trees in Algebra and Programming. 2 indexed citations

14.

Arnold, André. (1989). Recognizable sets of finite bilabelled transition systems.. Acta Cybernetica. 38. 123–134. 1 indexed citations

15.

Arnold, André. (1988). Logical definability of fixed points. Theoretical Computer Science. 61(2-3). 289–297. 4 indexed citations

16.

Arnold, André, et al.. (1986). On semantics of nondeterministic recursive program schemes. Cambridge University Press eBooks. 1–33. 2 indexed citations

17.

Arnold, André. (1985). A syntactic congruence for rational ω-languages. Theoretical Computer Science. 39. 333–335. 33 indexed citations

18.

Arnold, André. (1983). Rational Ω-languages are non-ambiguous. Theoretical Computer Science. 26(1-2). 221–223. 8 indexed citations

19.

Arnold, André & Max Dauchet. (1982). Morphismes et bimorphismes d'arbres. Theoretical Computer Science. 20(1). 33–93. 40 indexed citations

20.

Arnold, André & Max Dauchet. (1976). Un théorème de duplication pour les forêts algébriques. Journal of Computer and System Sciences. 13(2). 223–244. 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