G. Hansel

938 total citations
35 papers, 410 citations indexed

About

G. Hansel is a scholar working on Computational Theory and Mathematics, Mathematical Physics and Geometry and Topology. According to data from OpenAlex, G. Hansel has authored 35 papers receiving a total of 410 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Computational Theory and Mathematics, 14 papers in Mathematical Physics and 7 papers in Geometry and Topology. Recurrent topics in G. Hansel's work include semigroups and automata theory (17 papers), Mathematical Dynamics and Fractals (9 papers) and Advanced Topology and Set Theory (7 papers). G. Hansel is often cited by papers focused on semigroups and automata theory (17 papers), Mathematical Dynamics and Fractals (9 papers) and Advanced Topology and Set Theory (7 papers). G. Hansel collaborates with scholars based in France, Germany and Belgium. G. Hansel's co-authors include F. Blanchard, Roger Villemaire, Christian Michaux, Jean-Marc Champarnaud, Véronique Bruyère, Dominique Perrin, Uwe Wollina, Christophe Reutenauer and Djelloul Ziadi and has published in prestigious journals such as Transactions of the American Mathematical Society, Theoretical Computer Science and Proceedings of the American Mathematical Society.

In The Last Decade

G. Hansel

33 papers receiving 369 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
G. Hansel France 10 300 182 161 62 37 35 410
Christiane Frougny France 11 466 1.6× 302 1.7× 167 1.0× 56 0.9× 29 0.8× 41 519
Jan Reiterman Czechia 10 264 0.9× 106 0.6× 127 0.8× 118 1.9× 53 1.4× 42 371
Selim Tuncel United States 11 200 0.7× 254 1.4× 36 0.2× 83 1.3× 28 0.8× 24 325
Martin Raußen Denmark 11 165 0.6× 157 0.9× 59 0.4× 119 1.9× 47 1.3× 39 337
Nikita Sidorov United Kingdom 11 237 0.8× 363 2.0× 49 0.3× 139 2.2× 11 0.3× 25 420
Alf van der Poorten Australia 7 109 0.4× 60 0.3× 82 0.5× 60 1.0× 67 1.8× 13 221
G. S. Makanin Russia 6 240 0.8× 78 0.4× 204 1.3× 154 2.5× 15 0.4× 23 390
Francis Sergeraert France 9 174 0.6× 204 1.1× 35 0.2× 151 2.4× 40 1.1× 26 289
George F. McNulty United States 13 441 1.5× 51 0.3× 255 1.6× 76 1.2× 85 2.3× 45 547
A.R. Yeshkeyev Kazakhstan 11 128 0.4× 65 0.4× 66 0.4× 77 1.2× 22 0.6× 41 238

Countries citing papers authored by G. Hansel

Since Specialization
Citations

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

Fields of papers citing papers by G. Hansel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of G. Hansel

This figure shows the co-authorship network connecting the top 25 collaborators of G. Hansel. A scholar is included among the top collaborators of G. Hansel 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. Hansel. G. Hansel 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.
Champarnaud, Jean-Marc, et al.. (2005). COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN. International Journal of Foundations of Computer Science. 16(5). 851–865.
2.
Champarnaud, Jean-Marc, et al.. (2004). Random Generation Models for NFAs. Justus-Liebig-Universität Gießen. 4 indexed citations
3.
Hansel, G., et al.. (2003). Vers un théorème de Cobham pour les entiers de Gauss. Bulletin of the Belgian Mathematical Society - Simon Stevin. 10(5). 6 indexed citations
4.
Champarnaud, Jean-Marc, et al.. (2002). NFAs bitstream-based random generation.. 81–94.
5.
Hansel, G.. (1998). Systèmes de numération indépendants et syndéticité. Theoretical Computer Science. 204(1-2). 119–130. 7 indexed citations
6.
Bruyère, Véronique & G. Hansel. (1997). Bertrand numeration systems and recognizability. Theoretical Computer Science. 181(1). 17–43. 31 indexed citations
7.
Hansel, G., et al.. (1995). Nonseparability and uniform structures in locally compact groups. Proceedings of the American Mathematical Society. 123(5). 1613–1621. 1 indexed citations
8.
Hansel, G., et al.. (1994). Sequential criteria for the equality of uniform structures in q-groups. Topology and its Applications. 57(1). 47–52. 3 indexed citations
9.
Hansel, G., et al.. (1994). Logic and {$p$}-recognizable sets of integers. Bulletin of the Belgian Mathematical Society - Simon Stevin. 1(2). 102 indexed citations
10.
Hansel, G., et al.. (1992). Extension properties of WS-groups. Semigroup Forum. 45(1). 63–70. 1 indexed citations
11.
Champarnaud, Jean-Marc & G. Hansel. (1991). AUTOMATE, a computing package for automata and finite semigroups. Journal of Symbolic Computation. 12(2). 197–220. 18 indexed citations
12.
Hansel, G., et al.. (1990). On a class of weakly almost periodic mappings. Semigroup Forum. 41(1). 357–372. 9 indexed citations
13.
Hansel, G. & Dominique Perrin. (1989). Rational probability measures. Theoretical Computer Science. 65(2). 171–188. 6 indexed citations
14.
Blanchard, F. & G. Hansel. (1986). Coded systems. Theoretical Computer Science. 44(1). 17–49. 46 indexed citations
15.
Hansel, G.. (1986). Une démonstration simple du théorème de Skolem-Mahler-Lech. Theoretical Computer Science. 43. 91–98. 10 indexed citations
16.
Blanchard, F. & G. Hansel. (1986). Systèmes codés. Theoretical Computer Science. 44. 17–49. 60 indexed citations
17.
Hansel, G., Dominique Perrin, & Christophe Reutenauer. (1984). Factorizing the polynomial of a code. Transactions of the American Mathematical Society. 285(1). 91–105. 3 indexed citations
18.
Hansel, G.. (1982). Baionnettes et cardinaux. Discrete Mathematics. 39(3). 331–335. 5 indexed citations
19.
Hansel, G., et al.. (1973). Ergodicity, Uniformity and Unique Ergodicity. Indiana University Mathematics Journal. 23(3). 221–237. 15 indexed citations
20.
Hansel, G.. (1972). Complexes et décompositions binomiales. Journal of Combinatorial Theory Series A. 12(2). 167–183. 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

Breakdown of academic impact, for papers by Christiane Frougny Breakdown of academic impact, for papers by Jan Reiterman Breakdown of academic impact, for papers by Selim Tuncel Breakdown of academic impact, for papers by Martin Raußen Breakdown of academic impact, for papers by Nikita Sidorov Breakdown of academic impact, for papers by Alf van der Poorten Breakdown of academic impact, for papers by G. S. Makanin Breakdown of academic impact, for papers by Francis Sergeraert Breakdown of academic impact, for papers by George F. McNulty Breakdown of academic impact, for papers by A.R. Yeshkeyev
Rankless by CCL
2026