Danièle Beauquier

736 total citations
22 papers, 246 citations indexed

About

Danièle Beauquier is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Danièle Beauquier has authored 22 papers receiving a total of 246 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 4 papers in Molecular Biology. Recurrent topics in Danièle Beauquier's work include Formal Methods in Verification (13 papers), semigroups and automata theory (10 papers) and Logic, programming, and type systems (7 papers). Danièle Beauquier is often cited by papers focused on Formal Methods in Verification (13 papers), semigroups and automata theory (10 papers) and Logic, programming, and type systems (7 papers). Danièle Beauquier collaborates with scholars based in France, Italy and Poland. Danièle Beauquier's co-authors include Maurice Nivat, Jean-Éric Pin, Philippe Aigrain, Éric Rémila, Ruggero Lanotte, Dominique Perrin and Damian Niwiński and has published in prestigious journals such as Theoretical Computer Science, Information and Computation and Discrete & Computational Geometry.

In The Last Decade

Danièle Beauquier

22 papers receiving 230 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Danièle Beauquier France	8	197	117	55	27	24	22	246
Christian Choffrut France	12	352 1.8×	237 2.0×	115 2.1×	24 0.9×	9 0.4×	59	400
Wojciech Plandowski Poland	9	152 0.8×	192 1.6×	37 0.7×	7 0.3×	31 1.3×	28	236
Matthias Jantzen Germany	11	311 1.6×	222 1.9×	121 2.2×	13 0.5×	8 0.3×	22	400
Artur Jeż Poland	10	178 0.9×	191 1.6×	65 1.2×	5 0.2×	10 0.4×	37	244
Elizabeth Scott United Kingdom	11	128 0.6×	247 2.1×	13 0.2×	30 1.1×	117 4.9×	42	368
Robin A. Moser Switzerland	4	191 1.0×	78 0.7×	9 0.2×	14 0.5×	7 0.3×	5	259
Luc Boasson France	12	469 2.4×	360 3.1×	154 2.8×	20 0.7×	6 0.3×	46	526
Reinhard Pöschel Germany	9	287 1.5×	181 1.5×	14 0.3×	17 0.6×	5 0.2×	39	438
Jaroslav Ježek Czechia	12	443 2.2×	136 1.2×	13 0.2×	37 1.4×	5 0.2×	96	564
Eugenio G. Omodeo Italy	10	311 1.6×	294 2.5×	8 0.1×	10 0.4×	14 0.6×	63	423

Countries citing papers authored by Danièle Beauquier

Since Specialization

Citations

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

Fields of papers citing papers by Danièle Beauquier

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Danièle Beauquier

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

Beauquier, Danièle, et al.. (2013). Security policies enforcement using finite and pushdown edit automata. International Journal of Information Security. 12(4). 319–336. 5 indexed citations

Beauquier, Danièle, et al.. (2009). Security Policies Enforcement Using Finite Edit Automata. Electronic Notes in Theoretical Computer Science. 229(3). 19–35. 7 indexed citations

Lanotte, Ruggero & Danièle Beauquier. (2009). A Decidable Probability Logic for Timed Probabilistic Systems. Fundamenta Informaticae. 96(1-2). 127–151. 2 indexed citations

Beauquier, Danièle. (2006). A Logic of Probability with Decidable Model Checking. Journal of Logic and Computation. 16(4). 461–487. 7 indexed citations

Beauquier, Danièle, et al.. (2005). Periodicity based decidable classes in a first order timed logic. Annals of Pure and Applied Logic. 139(1-3). 43–73. 1 indexed citations

Beauquier, Danièle. (2003). On probabilistic timed automata. Theoretical Computer Science. 292(1). 65–84. 40 indexed citations

Beauquier, Danièle & Maurice Nivat. (2003). A codicity undecidable problem in the plane. Theoretical Computer Science. 303(2-3). 417–430. 12 indexed citations

Beauquier, Danièle. (2002). Markov Decision Processes and Deterministic Büchi Automata. Fundamenta Informaticae. 50(1). 1–13. 4 indexed citations

Beauquier, Danièle. (2002). Monadic Logic of Order over Naturals has no Finite Base. Journal of Logic and Computation. 12(2). 243–253. 7 indexed citations

10.

Beauquier, Danièle, et al.. (2002). Decidable verification for reducible timed automata specified in a first order logic with time. Theoretical Computer Science. 275(1-2). 347–388. 3 indexed citations

11.

Beauquier, Danièle, et al.. (2001). A first order logic for specification of timed algorithms: basic properties and a decidable class. Annals of Pure and Applied Logic. 113(1-3). 13–52. 9 indexed citations

12.

Beauquier, Danièle, et al.. (1998). Polytime model checking for timed probabilistic computation tree logic. Acta Informatica. 35(8). 645–664. 4 indexed citations

13.

Aigrain, Philippe & Danièle Beauquier. (1995). Polyomino tilings, cellular automata and codicity. Theoretical Computer Science. 147(1-2). 165–180. 13 indexed citations

14.

Beauquier, Danièle, et al.. (1995). Tiling figures of the plane with two bars. Computational Geometry. 5(1). 1–25. 26 indexed citations

15.

Beauquier, Danièle & Damian Niwiński. (1995). Automata on Infinite Trees with Counting Constraints. Information and Computation. 120(1). 117–125. 2 indexed citations

16.

Beauquier, Danièle, Maurice Nivat, & Damian Niwiński. (1993). THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON. International Journal of Algebra and Computation. 3(2). 237–250. 1 indexed citations

17.

Beauquier, Danièle & Jean-Éric Pin. (1991). Languages and scanners. Theoretical Computer Science. 84(1). 3–21. 25 indexed citations

18.

Beauquier, Danièle. (1991). An undecidable problem about rational sets and contour words of polyominoes. Information Processing Letters. 37(5). 257–263. 6 indexed citations

19.

Beauquier, Danièle. (1989). Minimal automation for a factorial, transitive, and rational language. Theoretical Computer Science. 67(1). 65–73. 12 indexed citations

20.

Beauquier, Danièle. (1984). Some Results About Finite and Infinite Behaviours of a Pushdown Automaton. International Colloquium on Automata, Languages and Programming. 14(4). 187–195. 3 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