Yannick Saouter

599 total citations
22 papers, 169 citations indexed

About

Yannick Saouter is a scholar working on Computer Networks and Communications, Algebra and Number Theory and Artificial Intelligence. According to data from OpenAlex, Yannick Saouter has authored 22 papers receiving a total of 169 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computer Networks and Communications, 8 papers in Algebra and Number Theory and 7 papers in Artificial Intelligence. Recurrent topics in Yannick Saouter's work include Analytic Number Theory Research (8 papers), Coding theory and cryptography (6 papers) and Error Correcting Code Techniques (4 papers). Yannick Saouter is often cited by papers focused on Analytic Number Theory Research (8 papers), Coding theory and cryptography (6 papers) and Error Correcting Code Techniques (4 papers). Yannick Saouter collaborates with scholars based in France, United States and Australia. Yannick Saouter's co-authors include Patrice Quinton, Olivier Ramaré, Sanjay Rajopadhye, Alexandre Graell i Amat, Claudine Berr, Xavier Gourdon, Timothy S. Trudgian, Herman te Riele, Kadi Bouatouch and Yves Robert and has published in prestigious journals such as Mathematics of Computation, IEEE Transactions on Communications and Electronics Letters.

In The Last Decade

Yannick Saouter

19 papers receiving 156 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Yannick Saouter France	9	63	60	47	40	34	22	169
Frank R. Bernhart United States	3	43 0.7×	28 0.5×	7 0.1×	56 1.4×	29 0.9×	5	240
Jonathan F. Buss Canada	8	98 1.6×	14 0.2×	23 0.5×	33 0.8×	96 2.8×	20	314
Bernhard Schmidt Singapore	9	24 0.4×	26 0.4×	15 0.3×	211 5.3×	171 5.0×	36	243
Hyun Kwang Kim South Korea	10	41 0.7×	52 0.9×	5 0.1×	153 3.8×	176 5.2×	31	270
Sava Krstić United States	9	19 0.3×	11 0.2×	54 1.1×	24 0.6×	62 1.8×	27	210
Barnett W. Glickfeld United States	5	203 3.2×	20 0.3×	202 4.3×	13 0.3×	23 0.7×	13	296
Nicolas Bonichon France	7	27 0.4×	22 0.4×	5 0.1×	9 0.2×	27 0.8×	24	210
Roberto Avanzi Germany	9	28 0.4×	4 0.1×	32 0.7×	22 0.6×	173 5.1×	21	219
Binzhou Xia Australia	8	58 0.9×	31 0.5×	5 0.1×	130 3.3×	116 3.4×	40	242
Marilynn Livingston United States	9	154 2.4×	7 0.1×	44 0.9×	79 2.0×	41 1.2×	18	276

Countries citing papers authored by Yannick Saouter

Since Specialization

Citations

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

Fields of papers citing papers by Yannick Saouter

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Yannick Saouter

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

1.

Saouter, Yannick. (2020). New pancake series for π. The Mathematical Gazette. 104(560). 296–303.

2.

Saouter, Yannick. (2018). Acceleration of low density parity check code (LDPC) decoding by successive overrelaxations. Electronics Letters. 54(19). 1112–1114. 2 indexed citations

3.

Saouter, Yannick. (2017). Constructions of LDPCs From Elliptic Curves Over Finite Fields. IEEE Communications Letters. 21(12). 2558–2561. 5 indexed citations

4.

Saouter, Yannick, et al.. (2015). A still sharper region where $\pi (x)-{\mathrm {li}}(x)$ is positive. Mathematics of Computation. 84(295). 2433–2446. 10 indexed citations

5.

Saouter, Yannick, et al.. (2011). An improved lower bound for the de Bruijn-Newman constant. Mathematics of Computation. 80(276). 2281–2287. 8 indexed citations

6.

Saouter, Yannick, et al.. (2011). An improved lower bound for the de Bruijn-Newman constant. HAL (Le Centre pour la Communication Scientifique Directe). 1 indexed citations

7.

Saouter, Yannick. (2011). Improving turbocode performance by cross-entropy. HAL (Le Centre pour la Communication Scientifique Directe).

8.

Saouter, Yannick. (2011). Heuristics for cannon's algorithm with an application to lyons sporadic group. ACM communications in computer algebra. 44(3/4). 138–139.

9.

Saouter, Yannick, et al.. (2011). A FPGA implementation of Chen's algorithm. ACM communications in computer algebra. 44(3/4). 140–141. 1 indexed citations

10.

Saouter, Yannick, et al.. (2010). A sharp region where 𝜋(𝑥)-𝑙𝑖(𝑥) is positive. Mathematics of Computation. 79(272). 2395–2405. 11 indexed citations

11.

Berr, Claudine, et al.. (2009). Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters. IEEE Transactions on Communications. 57(9). 2505–2509. 28 indexed citations

12.

Ramaré, Olivier & Yannick Saouter. (2002). Short effective intervals containing primes. Journal of Number Theory. 98(1). 10–33. 22 indexed citations

13.

Quinton, Patrice, et al.. (2002). Scheduling affine parameterized recurrences by means of. 1. 100–110. 13 indexed citations

14.

Saouter, Yannick. (1998). Checking the odd Goldbach conjecture up to 10²⁰. Mathematics of Computation. 67(222). 863–866. 13 indexed citations

15.

Saouter, Yannick & Patrice Quinton. (1993). Computability of recurrence equations. Theoretical Computer Science. 116(2). 317–337. 14 indexed citations

16.

Quinton, Patrice, et al.. (1992). The Alpha du Centaur experiment. 325–334. 4 indexed citations

17.

Quinton, Patrice, et al.. (1991). The Alpha du Centaur environment.. 140(4). 325–334. 1 indexed citations

18.

Quinton, Patrice, et al.. (1990). Scheduling affine parameterized recurrences by means of variable dependent timing functions. OpenGrey (Institut de l'Information Scientifique et Technique). 100–110. 18 indexed citations

19.

Quinton, Patrice, et al.. (1989). Alpha du centaur. 235–243. 5 indexed citations

20.

Bouatouch, Kadi, et al.. (1989). A VLSI Chip for Ray Tracing Bicubic Patches. Eurographics. 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