Laure Gonnord

630 total citations
22 papers, 93 citations indexed

About

Laure Gonnord is a scholar working on Hardware and Architecture, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Laure Gonnord has authored 22 papers receiving a total of 93 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Hardware and Architecture, 12 papers in Artificial Intelligence and 11 papers in Computational Theory and Mathematics. Recurrent topics in Laure Gonnord's work include Formal Methods in Verification (11 papers), Parallel Computing and Optimization Techniques (8 papers) and Logic, programming, and type systems (8 papers). Laure Gonnord is often cited by papers focused on Formal Methods in Verification (11 papers), Parallel Computing and Optimization Techniques (8 papers) and Logic, programming, and type systems (8 papers). Laure Gonnord collaborates with scholars based in France, United Kingdom and Brazil. Laure Gonnord's co-authors include Nicolas Halbwachs, Peter Schrammel, Paul Feautrier, Abdoulaye Gamatié, Fernando Magno Quintão Pereira, Jean‐Philippe Babau, David Monniaux, Alain Darte, Ludovic Henrio and Brijesh Dongol and has published in prestigious journals such as ACM Computing Surveys, ACM SIGPLAN Notices and Lecture notes in computer science.

In The Last Decade

Laure Gonnord

21 papers receiving 88 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Laure Gonnord France 7 63 57 43 35 11 22 93
David Déharbe Brazil 8 73 1.2× 78 1.4× 25 0.6× 47 1.3× 24 2.2× 28 126
Amar Bouali France 5 82 1.3× 41 0.7× 33 0.8× 47 1.3× 10 0.9× 7 106
Daron Vroon United States 7 66 1.0× 78 1.4× 29 0.7× 46 1.3× 22 2.0× 13 120
Jim Grundy United States 7 103 1.6× 108 1.9× 56 1.3× 39 1.1× 17 1.5× 21 157
Alexander Nadel Israel 7 50 0.8× 54 0.9× 14 0.3× 36 1.0× 23 2.1× 14 88
Bruno Pagano France 6 102 1.6× 74 1.3× 87 2.0× 19 0.5× 16 1.5× 9 159
Bertrand Jeannet France 8 125 2.0× 74 1.3× 63 1.5× 68 1.9× 19 1.7× 14 165
Dang Van Hung Spain 6 70 1.1× 52 0.9× 28 0.7× 24 0.7× 24 2.2× 31 110
Markus Dahlweid Germany 3 28 0.4× 49 0.9× 18 0.4× 44 1.3× 18 1.6× 6 77
Gilles Audemard France 6 51 0.8× 78 1.4× 10 0.2× 25 0.7× 24 2.2× 14 119

Countries citing papers authored by Laure Gonnord

Since Specialization
Citations

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

Fields of papers citing papers by Laure Gonnord

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Laure Gonnord

This figure shows the co-authorship network connecting the top 25 collaborators of Laure Gonnord. A scholar is included among the top collaborators of Laure Gonnord 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 Laure Gonnord. Laure Gonnord 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.
Gonnord, Laure, et al.. (2024). From Low-Level Fault Modeling (of a Pipeline Attack) to a Proven Hardening Scheme. SPIRE - Sciences Po Institutional REpository. 174–185. 1 indexed citations
2.
Gonnord, Laure, et al.. (2023). Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types. Proceedings of the ACM on Programming Languages. 7(ICFP). 813–846. 4 indexed citations
3.
Gonnord, Laure, et al.. (2022). A Survey on Parallelism and Determinism. ACM Computing Surveys. 55(10). 1–28. 4 indexed citations
4.
Sekerinski, Emil, Nelma Moreira, Daniel Ratiu, et al.. (2020). Formal Methods. FM 2019 International Workshops. Lecture notes in computer science. 6 indexed citations
5.
Sekerinski, Emil, Nelma Moreira, Daniel Ratiu, et al.. (2020). Formal Methods. FM 2019 International Workshops. Lecture notes in computer science. 1 indexed citations
6.
Gonnord, Laure, et al.. (2018). Polyhedral Dataflow Programming: A Case Study. HAL (Le Centre pour la Communication Scientifique Directe). 171–179. 1 indexed citations
7.
Pereira, Fernando Magno Quintão, et al.. (2017). Combining range and inequality information for pointer disambiguation. Science of Computer Programming. 152. 161–184. 3 indexed citations
8.
Gonnord, Laure, et al.. (2017). Pointer disambiguation via strict inequalities. HAL (Le Centre pour la Communication Scientifique Directe). 74. 134–147. 1 indexed citations
9.
Gonnord, Laure, et al.. (2015). Synthesis of ranking functions using extremal counterexamples. ACM SIGPLAN Notices. 50(6). 608–618. 4 indexed citations
10.
Gonnord, Laure, et al.. (2014). Validation of memory accesses through symbolic analyses. ACM SIGPLAN Notices. 49(10). 791–809. 6 indexed citations
11.
Gonnord, Laure & Peter Schrammel. (2013). Abstract acceleration in linear relation analysis. Science of Computer Programming. 93. 125–153. 11 indexed citations
12.
Gamatié, Abdoulaye & Laure Gonnord. (2011). Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems. HAL (Le Centre pour la Communication Scientifique Directe). 71–80. 7 indexed citations
13.
Gamatié, Abdoulaye & Laure Gonnord. (2011). Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems. ACM SIGPLAN Notices. 46(5). 71–80. 2 indexed citations
14.
Feautrier, Paul & Laure Gonnord. (2010). Accelerated Invariant Generation for C Programs with Aspic and C2fsm. Electronic Notes in Theoretical Computer Science. 267(2). 3–13. 9 indexed citations
15.
Darte, Alain, et al.. (2010). Bounding the Computational Complexity of Flowchart Programs with Multi-dimensional Rankings. HAL (Le Centre pour la Communication Scientifique Directe). 32. 1 indexed citations
16.
Darte, Alain, et al.. (2009). Program Termination and Worst Time Complexity with Multi-Dimensional Affine Ranking Functions. HAL (Le Centre pour la Communication Scientifique Directe). 31. 2 indexed citations
17.
Gonnord, Laure & Jean‐Philippe Babau. (2008). Resource management with Qinna framework : the remote viewer case study. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations
18.
Gonnord, Laure & Nicolas Halbwachs. (2006). Combining Widening and Acceleration in Linear Relation Analysis. 6 indexed citations
19.
Gonnord, Laure, Nicolas Halbwachs, & Pascal Raymond. (2006). From Discrete Duration Calculus to Symbolic Automata. Electronic Notes in Theoretical Computer Science. 153(4). 3–18. 1 indexed citations
20.
Halbwachs, Nicolas, et al.. (2006). Some ways to reduce the space dimension in polyhedra computations. Formal Methods in System Design. 29(1). 79–95. 20 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