Florent Jacquemard

2.1k total citations
27 papers, 153 citations indexed

About

Florent Jacquemard is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Florent Jacquemard has authored 27 papers receiving a total of 153 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 9 papers in Computer Networks and Communications. Recurrent topics in Florent Jacquemard's work include Formal Methods in Verification (14 papers), semigroups and automata theory (11 papers) and Logic, programming, and type systems (11 papers). Florent Jacquemard is often cited by papers focused on Formal Methods in Verification (14 papers), semigroups and automata theory (11 papers) and Logic, programming, and type systems (11 papers). Florent Jacquemard collaborates with scholars based in France, Germany and Tunisia. Florent Jacquemard's co-authors include Stéphanie Delaune, Hubert Comon, Michaël Rusinowitch, Adel Bouhoula, Adel Bouhoula, Jean‐Louis Giavitto, Margus Veanes, Harald Ganzinger, Arshia Cont and José I. Echeveste and has published in prestigious journals such as Journal of Computer and System Sciences, Lecture notes in computer science and Information and Computation.

In The Last Decade

Florent Jacquemard

23 papers receiving 139 citations

Peers

Florent Jacquemard

CTM

CNC

Christoph Sprenger Switzerland

Peter Schachte Australia

Nikos Gorogiannis United Kingdom

Musab A. Alturki United States

Qiwen Xu China

Michael Papathomas Switzerland

Dominique Méry France

Christiano Braga Brazil

Simona Orzan Netherlands

Andreas Lochbihler Switzerland

Christoph Sprenger Switzerland

Florent Jacquemard

102 ×0.9

39 ×0.6

CTM

89 ×1.5

CNC

54 ×1.4

9 ×0.5

Citations per year, relative to Florent Jacquemard Florent Jacquemard (= 1×) peers Christoph Sprenger

Countries citing papers authored by Florent Jacquemard

Since Specialization

Citations

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

Fields of papers citing papers by Florent Jacquemard

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Florent Jacquemard

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

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

Jacquemard, Florent, et al.. (2016). Model-based testing for building reliable realtime interactive music systems. Science of Computer Programming. 132. 143–172. 1 indexed citations

Echeveste, José I., Arshia Cont, Jean‐Louis Giavitto, & Florent Jacquemard. (2013). Operational semantics of a domain specific language for real time musician–computer interaction. Discrete Event Dynamic Systems. 23(4). 343–383. 10 indexed citations

Bouhoula, Adel & Florent Jacquemard. (2011). Sufficient completeness verification for conditional and constrained TRS. Journal of Applied Logic. 10(1). 127–143. 4 indexed citations

Abassi, Ryma, et al.. (2010). XML access control: from XACML to annotated schemas. HAL (Le Centre pour la Communication Scientifique Directe). 1–8. 5 indexed citations

Jacquemard, Florent, et al.. (2010). The Emptiness Problem for Tree Automata with Global Constraints. HAL (Le Centre pour la Communication Scientifique Directe). 263–272. 8 indexed citations

Jacquemard, Florent, et al.. (2010). Rigid tree automata and applications. Information and Computation. 209(3). 486–512. 9 indexed citations

Jacquemard, Florent & Michaël Rusinowitch. (2010). Rewrite-based verification of XML updates. HAL (Le Centre pour la Communication Scientifique Directe). 480. 119–130. 7 indexed citations

Bouhoula, Adel, et al.. (2009). Automatic verification of conformance of firewall configurations to security policies. HAL (Le Centre pour la Communication Scientifique Directe). 526–531. 17 indexed citations

10.

Gascón, Adrià, et al.. (2009). Closure of Tree Automata Languages under Innermost Rewriting. Electronic Notes in Theoretical Computer Science. 237. 23–38. 8 indexed citations

11.

Comon-Lundh, Hubert, Florent Jacquemard, & Nicolas Perrin. (2008). Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science. Volume 4, Issue 2. 3 indexed citations

12.

Jacquemard, Florent, Michaël Rusinowitch, & Laurent Vigneron. (2008). Tree automata with equality constraints modulo equational theories. The Journal of Logic and Algebraic Programming. 75(2). 182–208. 3 indexed citations

13.

Jacquemard, Florent, et al.. (2006). The Confluence Problem for Flat TRSs(New Trends in Theory of Computation and Algorithm). Kyoto University Research Information Repository (Kyoto University).

14.

Bouhoula, Adel & Florent Jacquemard. (2006). Automatic Verification of Sufficient Completeness for Conditional Constrained Term Rewriting Systems. HAL (Le Centre pour la Communication Scientifique Directe). 17. 2 indexed citations

15.

Delaune, Stéphanie & Florent Jacquemard. (2004). A theory of dictionary attacks and its complexity. 2–15. 20 indexed citations

16.

Delaune, Stéphanie & Florent Jacquemard. (2004). A decision procedure for the verification of security protocols with explicit destructors. 278–287. 12 indexed citations

17.

Michel, Olivier, Florent Jacquemard, & Jean‐Louis Giavitto. (2004). Three variations on the analysis of the Needham-Schroeder Public-Key Protocol with MGS.

18.

Comon, Hubert & Florent Jacquemard. (2003). Ground reducibility is EXPTIME-complete. Information and Computation. 187(1). 123–153. 10 indexed citations

19.

Jacquemard, Florent. (2003). Reachability and confluence are undecidable for flat term rewriting systems. Information Processing Letters. 87(5). 265–270. 7 indexed citations

20.

Ganzinger, Harald, Florent Jacquemard, & Margus Veanes. (2000). RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION. International Journal of Foundations of Computer Science. 11(1). 3–27. 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