André Arnold
Impact in
- Computational Theory and Mathematics top 0.2%
- semigroups and automata theory
- Formal Methods in Verification
- Petri Nets in System Modeling
- Artificial Intelligence top 2%
- Logic, programming, and type systems
- Logic, Reasoning, and Knowledge
- Advanced Software Engineering Methodologies
Papers in
-
- semigroups and automata theory 53
- Formal Methods in Verification 22
- Petri Nets in System Modeling 10
- Advanced Algebra and Logic 4
- Complexity and Algorithms in Graphs 3
-
- Logic, programming, and type systems 27
- Logic, Reasoning, and Knowledge 6
- Co-authors
- Max Dauchet (10 shared papers)Damian Niwiński (11 shared papers)Maurice Nivat B (7 shared papers)John Plaice (1 shared paper)Igor Walukiewicz (2 shared papers)Mohamed Naïmi (1 shared paper)Antoine B. Rauzy (1 shared paper)Michel Latteux (2 shared papers)
In The Last Decade
André Arnold
72 papers receiving 1.9k citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 1.5k
- Artificial Intelligence 623
- Software 64
- Safety, Risk, Reliability and Quality 83
- Computer Networks and Communications 122
Countries citing papers authored by André Arnold
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
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-authors
The 25 scholars most cited alongside André Arnold, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 79 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Finite transition systems | 1994 | 241 |
| 2 | Finite transition systems: semantics of communicating systems | 1994 | 171 |
| 3 | 2003 | 150 | |
| 4 | 1999 | 125 | |
| 5 | 1996 | 112 | |
| 6 | 1980 | 81 | |
| 7 | Rudiments of μ-calculus | 2001 | 78 |
| 8 | 1980 | 74 | |
| 9 | 1985 | 65 | |
| 10 | 1999 | 65 | |
| 11 | 1982 | 64 | |
| 12 | 1988 | 54 | |
| 13 | Rudiments of µ-calculus | 2001 | 48 |
| 14 | 1990 | 41 | |
| 15 | 1979 | 32 | |
| 16 | A note about minimal non-deterministic automata. | 1992 | 31 |
| 17 | Fixed point characterization of weak monadic logic definable sets of trees. | 1992 | 30 |
| 18 | 1978 | 29 | |
| 19 | Bi-transductions de forêts. | 1976 | 28 |
| 20 | 1976 | 27 |
About André Arnold
André Arnold is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Modeling and Simulation and Geometry and Topology, having authored 79 papers that have together received 2k indexed citations. Recurring topics across this work include semigroups and automata theory (53 papers), Logic, programming, and type systems (27 papers), Formal Methods in Verification (22 papers), Petri Nets in System Modeling (10 papers), Logic, Reasoning, and Knowledge (6 papers), Advanced Algebra and Logic (4 papers), Complexity and Algorithms in Graphs (3 papers) and Advanced Combinatorial Mathematics (2 papers). The work is most often cited by research in Computational Theory and Mathematics (1.5k citations), Artificial Intelligence (623 citations), Software (64 citations), Safety, Risk, Reliability and Quality (83 citations) and Computer Networks and Communications (122 citations). André Arnold has collaborated with scholars based in France, Poland and Canada. Frequent co-authors include Max Dauchet, Damian Niwiński, Maurice Nivat B, John Plaice, Igor Walukiewicz, Mohamed Naïmi, Antoine B. Rauzy, Michel Latteux, Luigi Santocanale and Srečko Brlek. Their work appears in journals such as Theoretical Computer Science, Theory of Computing Systems, Information and Computation, CALCOLO and Lecture notes in computer science.
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.