Pierre Réty

442 total citations
8 papers, 46 citations indexed

About

Pierre Réty is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Pierre Réty has authored 8 papers receiving a total of 46 indexed citations (citations by other indexed papers that have themselves been cited), including 7 papers in Computational Theory and Mathematics, 6 papers in Artificial Intelligence and 1 paper in Molecular Biology. Recurrent topics in Pierre Réty's work include Logic, programming, and type systems (4 papers), semigroups and automata theory (3 papers) and Natural Language Processing Techniques (3 papers). Pierre Réty is often cited by papers focused on Logic, programming, and type systems (4 papers), semigroups and automata theory (3 papers) and Natural Language Processing Techniques (3 papers). Pierre Réty collaborates with scholars based in France and Germany. Pierre Réty's co-authors include Gert Smolka, Werner Nutt, Yohan Boichut and Michael Hanus and has published in prestigious journals such as Journal of Computer and System Sciences, Journal of Symbolic Computation and Electronic Notes in Theoretical Computer Science.

In The Last Decade

Pierre Réty

6 papers receiving 43 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Pierre Réty France	4	44	37	6	4	1	8	46
Harald Zankl Austria	4	50 1.1×	41 1.1×	8 1.3×	6 1.5×		19	51
Martin Pollet Germany	5	47 1.1×	23 0.6×	9 1.5×	6 1.5×	1 1.0×	12	55
Christian Sternagel Austria	5	42 1.0×	27 0.7×	6 1.0×	7 1.8×		19	43
Nathan Wetzler United States	2	35 0.8×	37 1.0×	14 2.3×	4 1.0×		2	40
Bruno Guillaume France	7	99 2.3×	28 0.8×	4 0.7×	5 1.3×	1 1.0×	25	103
Jacob M. Howe United Kingdom	6	36 0.8×	27 0.7×	10 1.7×	10 2.5×	1 1.0×	17	49
Bruno Woltzenlogel Paleo Australia	5	47 1.1×	20 0.5×	3 0.5×	3 0.8×		21	57
Healfdene Goguen United States	7	60 1.4×	40 1.1×	10 1.7×	10 2.5×	2 2.0×	12	68
Dav M. Gabbay United Kingdom	6	112 2.5×	45 1.2×	4 0.7×	7 1.8×	1 1.0×	9	115
Jan Leike Australia	4	36 0.8×	15 0.4×	8 1.3×	4 1.0×	1 1.0×	11	44

Countries citing papers authored by Pierre Réty

Since Specialization

Citations

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

Fields of papers citing papers by Pierre Réty

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Pierre Réty

This figure shows the co-authorship network connecting the top 25 collaborators of Pierre Réty. A scholar is included among the top collaborators of Pierre Réty 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 Pierre Réty. Pierre Réty 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:

8 of 8 papers shown

1.

Réty, Pierre, et al.. (2018). Transforming Prefix-constrained or Controlled Rewrite Systems. EPiC series in computing. 45. 49–34. 1 indexed citations

2.

Boichut, Yohan, et al.. (2017). Towards more precise rewriting approximations. Journal of Computer and System Sciences. 104. 131–148.

3.

Réty, Pierre, et al.. (2005). Tree automata for rewrite strategies. Journal of Symbolic Computation. 40(1). 749–794. 4 indexed citations

4.

Hanus, Michael & Pierre Réty. (2005). Demand-driven Search in Functional Logic Programs. RWTH Publications (RWTH Aachen).

5.

Réty, Pierre, et al.. (2002). Regular Sets of Descendants by Leftmost Strategy. Electronic Notes in Theoretical Computer Science. 70(6). 176–195. 4 indexed citations

6.

Réty, Pierre, et al.. (1997). E-unification by means of tree tuple synchronized grammars. Discrete Mathematics & Theoretical Computer Science. Vol. 1. 4 indexed citations

7.

Nutt, Werner, Pierre Réty, & Gert Smolka. (1989). Basic narrowing revisited. Journal of Symbolic Computation. 7(3-4). 295–317. 31 indexed citations

8.

Réty, Pierre. (1987). Improving basic narrowing techniques and commutation properties. OpenGrey (Institut de l'Information Scientifique et Technique). 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