Géraud Sénizergues

970 total citations
26 papers, 300 citations indexed

About

Géraud Sénizergues is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Géraud Sénizergues has authored 26 papers receiving a total of 300 indexed citations (citations by other indexed papers that have themselves been cited), including 23 papers in Computational Theory and Mathematics, 17 papers in Artificial Intelligence and 7 papers in Geometry and Topology. Recurrent topics in Géraud Sénizergues's work include semigroups and automata theory (23 papers), Logic, programming, and type systems (15 papers) and Formal Methods in Verification (11 papers). Géraud Sénizergues is often cited by papers focused on semigroups and automata theory (23 papers), Logic, programming, and type systems (15 papers) and Formal Methods in Verification (11 papers). Géraud Sénizergues collaborates with scholars based in France, Germany and Russia. Géraud Sénizergues's co-authors include Yuri Matiyasevich, Luc Boasson, Jean-Michel Autebert, Markus Lohrey, John Meakin and Joffroy Beauquier and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Géraud Sénizergues

26 papers receiving 274 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Géraud Sénizergues France	10	259	204	64	44	13	26	300
Dietrich Kuske Germany	10	241 0.9×	135 0.7×	30 0.5×	71 1.6×	10 0.8×	59	275
Véronique Bruyère Belgium	8	213 0.8×	134 0.7×	27 0.4×	18 0.4×	41 3.2×	50	245
Achim Blumensath Germany	6	182 0.7×	122 0.6×	10 0.2×	45 1.0×	13 1.0×	17	208
Jean-Marc Champarnaud France	10	228 0.9×	196 1.0×	96 1.5×	7 0.2×	5 0.4×	44	262
Massimiliano Goldwurm Italy	6	119 0.5×	88 0.4×	18 0.3×	19 0.4×	10 0.8×	24	163
Kosaburo Hashiguchi Japan	10	291 1.1×	222 1.1×	88 1.4×	24 0.5×	3 0.2×	26	320
Michel Latteux France	9	283 1.1×	199 1.0×	132 2.1×	13 0.3×	4 0.3×	54	307
Marcel Jackson Australia	13	441 1.7×	173 0.8×	41 0.6×	69 1.6×	2 0.2×	52	483
Symeon Bozapalidis Greece	12	268 1.0×	217 1.1×	39 0.6×	7 0.2×	7 0.5×	31	291
G. S. Makanin Russia	6	240 0.9×	204 1.0×	26 0.4×	154 3.5×	30 2.3×	23	390

Countries citing papers authored by Géraud Sénizergues

Since Specialization

Citations

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

Fields of papers citing papers by Géraud Sénizergues

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Géraud Sénizergues. 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 Géraud Sénizergues. The network helps show where Géraud Sénizergues may publish in the future.

Co-authorship network of co-authors of Géraud Sénizergues

This figure shows the co-authorship network connecting the top 25 collaborators of Géraud Sénizergues. A scholar is included among the top collaborators of Géraud Sénizergues 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 Géraud Sénizergues. Géraud Sénizergues 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

Lohrey, Markus & Géraud Sénizergues. (2008). RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS. International Journal of Algebra and Computation. 18(1). 111–163. 4 indexed citations

Meakin, John, et al.. (2007). EQUATIONS IN FREE INVERSE MONOIDS. International Journal of Algebra and Computation. 17(4). 761–795. 5 indexed citations

Sénizergues, Géraud, et al.. (2006). Iterated pushdown automata and sequences of rational numbers. Annals of Pure and Applied Logic. 141(3). 363–411. 8 indexed citations

Sénizergues, Géraud. (2005). The Bisimulation Problem for Equational Graphs of Finite Out-Degree. SIAM Journal on Computing. 34(5). 1025–1106. 12 indexed citations

Matiyasevich, Yuri & Géraud Sénizergues. (2004). Decision problems for semi-Thue systems with a few rules. Theoretical Computer Science. 330(1). 145–169. 32 indexed citations

Sénizergues, Géraud. (2002). L(A)=L(B)? A simplified decidability proof. Theoretical Computer Science. 281(1-2). 555–608. 13 indexed citations

Sénizergues, Géraud. (2001). L(A)=L(B)? decidability results from complete formal systems. Theoretical Computer Science. 251(1-2). 1–166. 50 indexed citations

Sénizergues, Géraud. (2000). Complete formal systems for equivalence problems. Theoretical Computer Science. 231(2). 309–334. 5 indexed citations

Sénizergues, Géraud. (1998). A polynomial algorithm testing partial confluence of basic semi-Thue systems. Theoretical Computer Science. 192(1). 55–75. 3 indexed citations

10.

Sénizergues, Géraud. (1997). L(A) = L(B)?. Electronic Notes in Theoretical Computer Science. 9. 43–43. 8 indexed citations

11.

Sénizergues, Géraud. (1995). Some undecidable termination problems for semi-Thue systems. Theoretical Computer Science. 142(2). 257–276. 4 indexed citations

12.

Sénizergues, Géraud. (1993). Formal Languages and Word-Rewriting. 75–94. 2 indexed citations

13.

Sénizergues, Géraud. (1990). Some decision problems about controlled rewriting systems. Theoretical Computer Science. 71(3). 281–346. 12 indexed citations

14.

Sénizergues, Géraud. (1990). A characterisation of deterministic context-free languages by means of right-congruences. Theoretical Computer Science. 70(2). 213–232. 3 indexed citations

15.

Sénizergues, Géraud. (1989). Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages. Information and Computation. 81(3). 265–279. 9 indexed citations

16.

Autebert, Jean-Michel, Luc Boasson, & Géraud Sénizergues. (1987). Groups and nts languages. Journal of Computer and System Sciences. 35(2). 243–267. 18 indexed citations

17.

Boasson, Luc & Géraud Sénizergues. (1985). NTS languages are deterministic and congruential. Journal of Computer and System Sciences. 31(3). 332–342. 24 indexed citations

18.

Sénizergues, Géraud. (1985). The equivalence and inclusion problems for NTS languages. Journal of Computer and System Sciences. 31(3). 303–331. 21 indexed citations

19.

Beauquier, Joffroy, et al.. (1984). Remarques sur les langages de parenthèses. Theoretical Computer Science. 31(3). 337–349. 3 indexed citations

20.

Sénizergues, Géraud. (1981). A new class of C.F.L. for which the equivalence is decidable. Information Processing Letters. 13(1). 30–34. 4 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