Yannick Saouter
-
- Analytic Number Theory Research 8
- Advanced Mathematical Identities 4
- Theoretical Computer Science top 10%
- Hardware and Architecture top 10%
- Parallel Computing and Optimization Techniques 3
-
- Finite Group Theory Research 3
- Geometry and Topology top 10%
- Algebraic Geometry and Number Theory 2
-
- Coding theory and cryptography 6
-
- Error Correcting Code Techniques 4
-
- Advanced Wireless Communication Techniques 4
- Co-authors
- Patrice QuintonOlivier RamaréSanjay RajopadhyeAlexandre Graell i AmatClaudine BerrXavier GourdonTimothy S. TrudgianHerman te Riele
- Journals
- Mathematics of Computation (5 papers)IEEE Communications Letters (1 paper)Theoretical Computer Science (1 paper)
- Partner nations
- FranceUnited StatesAustralia
In The Last Decade
Yannick Saouter
19 papers receiving 156 citations
Peers
Comparison fields: 5 of 33
- Algebra and Number Theory 60
- Theoretical Computer Science 12
- Hardware and Architecture 47
- Discrete Mathematics and Combinatorics 20
- Geometry and Topology 26
Countries citing papers authored by Yannick Saouter
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
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
The 11 scholars most cited alongside Yannick Saouter, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2020 | 0 | |
| 2 | 2018 | 2 | |
| 3 | 2017 | 5 | |
| 4 | 2015 | 10 | |
| 5 | 2011 | 8 | |
| 6 | An improved lower bound for the de Bruijn-Newman constant | 2011 | 1 |
| 7 | Improving turbocode performance by cross-entropy | 2011 | 0 |
| 8 | 2011 | 0 | |
| 9 | 2011 | 1 | |
| 10 | 2010 | 11 | |
| 11 | 2009 | 28 | |
| 12 | 2002 | 22 | |
| 13 | 2002 | 13 | |
| 14 | 1998 | 13 | |
| 15 | 1993 | 14 | |
| 16 | The Alpha du Centaur experiment | 1992 | 4 |
| 17 | 1991 | 1 | |
| 18 | Scheduling affine parameterized recurrences by means of variable dependent timing functions | 1990 | 18 |
| 19 | 1989 | 5 | |
| 20 | 1989 | 3 |
About Yannick Saouter
Yannick Saouter is a scholar working on Algebra and Number Theory, Discrete Mathematics and Combinatorics, Hardware and Architecture, Computer Networks and Communications and Geometry and Topology, having authored 22 papers that have together received 169 indexed citations. Recurring topics across this work include Analytic Number Theory Research (8 papers), Coding theory and cryptography (6 papers), Error Correcting Code Techniques (4 papers), Advanced Wireless Communication Techniques (4 papers), Advanced Mathematical Identities (4 papers), Parallel Computing and Optimization Techniques (3 papers), Finite Group Theory Research (3 papers) and Algebraic Geometry and Number Theory (2 papers). The work is most often cited by research in Algebra and Number Theory (60 citations), Theoretical Computer Science (12 citations), Hardware and Architecture (47 citations), Discrete Mathematics and Combinatorics (20 citations) and Geometry and Topology (26 citations). Yannick Saouter has collaborated with scholars based in France, United States and Australia. Frequent 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. Their work appears in journals such as Mathematics of Computation, IEEE Communications Letters, Theoretical Computer Science, Science of Computer Programming and IEEE Transactions on Communications.
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.