Michaël Rusinowitch

3.1k total citations
79 papers, 710 citations indexed

About

Michaël Rusinowitch is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Michaël Rusinowitch has authored 79 papers receiving a total of 710 indexed citations (citations by other indexed papers that have themselves been cited), including 53 papers in Artificial Intelligence, 45 papers in Computer Networks and Communications and 28 papers in Computational Theory and Mathematics. Recurrent topics in Michaël Rusinowitch's work include Logic, programming, and type systems (22 papers), Advanced Authentication Protocols Security (20 papers) and Formal Methods in Verification (17 papers). Michaël Rusinowitch is often cited by papers focused on Logic, programming, and type systems (22 papers), Advanced Authentication Protocols Security (20 papers) and Formal Methods in Verification (17 papers). Michaël Rusinowitch collaborates with scholars based in France, United States and Germany. Michaël Rusinowitch's co-authors include Mathieu Turuani, Adel Bouhoula, Yannick Chevalier, Jieh Hsiang, Claude Kirchner, Alessandro Armando, Grégory Kucherov, Emmanuel Kounalis, Silvio Ranise and Tarek Abbes and has published in prestigious journals such as Journal of the ACM, Future Generation Computer Systems and Theoretical Computer Science.

In The Last Decade

Michaël Rusinowitch

74 papers receiving 630 citations

Peers

Michaël Rusinowitch

CTM

CNC

Lenore D. Zuck United States

Mario Bravetti Italy

Marco Bernardo Italy

Jérôme Vouillon France

Luı́s Caires Portugal

Stephen Brookes United States

Iliano Cervesato United States

Ivan Lanese Italy

Christine Paulin-Mohring France

Olaf Owe Norway

Lenore D. Zuck United States

Michaël Rusinowitch

389 ×0.7

366 ×1.2

CTM

212 ×0.7

CNC

94 ×0.5

121 ×1.7

Citations per year, relative to Michaël Rusinowitch Michaël Rusinowitch (= 1×) peers Lenore D. Zuck

Countries citing papers authored by Michaël Rusinowitch

Since Specialization

Citations

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

Fields of papers citing papers by Michaël Rusinowitch

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Michaël Rusinowitch

This figure shows the co-authorship network connecting the top 25 collaborators of Michaël Rusinowitch. A scholar is included among the top collaborators of Michaël Rusinowitch 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 Michaël Rusinowitch. Michaël Rusinowitch 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

Lahmadi, Abdelkader, et al.. (2023). Automated Placement of In-Network ACL Rules. SPIRE - Sciences Po Institutional REpository.

Jacquemard, Florent & Michaël Rusinowitch. (2016). One-variable context-free hedge automata. Journal of Computer and System Sciences. 104. 278–296.

Chevalier, Yannick, et al.. (2016). Intruder deducibility constraints with negation. Decidability and application to secured service compositions. Journal of Symbolic Computation. 80. 4–26. 2 indexed citations

Chevalier, Yannick, et al.. (2014). Parametrized automata simulation and application to service composition. Journal of Symbolic Computation. 69. 40–60. 1 indexed citations

Narendran, Paliath, et al.. (2014). Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. Logical Methods in Computer Science. Volume 10, Issue 1. 1 indexed citations

Chevalier, Yannick & Michaël Rusinowitch. (2009). Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures. Theoretical Computer Science. 411(10). 1261–1282. 3 indexed citations

Turuani, Mathieu, et al.. (2008). Towards a Constrained-based Verification of Parameterized Cryptographic Protocols. HAL (Le Centre pour la Communication Scientifique Directe). 191–206. 1 indexed citations

Chevalier, Yannick & Michaël Rusinowitch. (2007). Hierarchical combination of intruder theories. Information and Computation. 206(2-4). 352–377. 5 indexed citations

Chevalier, Yannick, Ralf Küsters, Michaël Rusinowitch, & Mathieu Turuani. (2005). An NP decision procedure for protocol insecurity with XOR. Theoretical Computer Science. 338(1-3). 247–274. 16 indexed citations

10.

Armando, Alessandro, Silvio Ranise, & Michaël Rusinowitch. (2003). A rewriting approach to satisfiability procedures. Information and Computation. 183(2). 140–164. 49 indexed citations

11.

Rusinowitch, Michaël & Mathieu Turuani. (2003). Protocol insecurity with a finite number of sessions and composed keys is NP-complete. Theoretical Computer Science. 299(1-3). 451–475. 62 indexed citations

12.

Armando, Alessandro, et al.. (2002). Incorporating Decision Procedures in Implicit Induction. Journal of Symbolic Computation. 34(4). 241–258. 10 indexed citations

13.

Narendran, Paliath & Michaël Rusinowitch. (1999). Rewriting Techniques & Applications. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

14.

Bouhoula, Adel & Michaël Rusinowitch. (1993). Automatic case analysis in proof by induction. OpenGrey (Institut de l'Information Scientifique et Technique). 88–94. 9 indexed citations

15.

Kounalis, Emmanuel & Michaël Rusinowitch. (1991). Studies on the Ground Convergence Property of Conditional Theories. 54(12). 363–376. 3 indexed citations

16.

Kounalis, Emmanuel & Michaël Rusinowitch. (1991). On word problems in horn theories. Journal of Symbolic Computation. 11(1-2). 113–127. 9 indexed citations

17.

Rusinowitch, Michaël. (1991). Theorem-proving with resolution and superposition. Journal of Symbolic Computation. 11(1-2). 21–49. 24 indexed citations

18.

Kounalis, Emmanuel & Michaël Rusinowitch. (1990). Mechanizing inductive reasoning. Bulletin of the European Association for Theoretical Computer Science. 41. 216–226. 4 indexed citations

19.

Rusinowitch, Michaël. (1988). Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules.. Future Generation Computer Systems. 524–531. 5 indexed citations

20.

Rusinowitch, Michaël. (1987). Path of subterms ordering and recursive decomposition ordering revisited. Journal of Symbolic Computation. 3(1-2). 117–131. 10 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