default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYannick Saouter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Yannick Saouter, Gilles Burel:
Algebraic decoding for classes of quantum codes. MeditCom 2024: 477-482- 2022
- [j14]Yannick Saouter:
New results for witnesses of Robin's criterion. Math. Comput. 91(334): 909-920 (2022)
2010 – 2019
- 2017
- [j13]Yannick Saouter
:
Constructions of LDPCs From Elliptic Curves Over Finite Fields. IEEE Commun. Lett. 21(12): 2558-2561 (2017) - 2015
- [j12]Yannick Saouter, Timothy S. Trudgian, Patrick Demichel:
A still sharper region where π(x)-li(x) is positive. Math. Comput. 84(295): 2433-2446 (2015) - 2014
- [j11]Yannick Saouter, Herman te Riele:
Improved results on the Mertens conjecture. Math. Comput. 83(285): 421-433 (2014) - [c14]Yannick Saouter:
Soft-in soft-out algorithms for the Nordstrom-Robinson code. ISTC 2014: 27-31 - 2012
- [c13]Oscar Sanchez, C. Jegoy, Michel Jézéquel, Yannick Saouter:
High speed low complexity radix-16 Max-Log-MAP SISO decoder. ICECS 2012: 400-403 - 2011
- [j10]Yannick Saouter, Xavier Gourdon, Patrick Demichel:
An improved lower bound for the de Bruijn-Newman constant. Math. Comput. 80(276): 2281-2287 (2011) - [c12]Yannick Saouter:
Improving turbocode performance by cross-entropy. WTS 2011: 1-4 - [c11]Yannick Saouter, Claude Berrou:
Time varying convolutional codes for punctured turbocodes. WTS 2011: 1-5 - 2010
- [j9]Yannick Saouter:
Heuristics for cannon's algorithm with an application to lyons sporadic group. ACM Commun. Comput. Algebra 44(3/4): 138-139 (2010) - [j8]Yannick Saouter, Gérald Le Mestre:
A FPGA implementation of Chen's algorithm. ACM Commun. Comput. Algebra 44(3/4): 140-141 (2010) - [j7]Yannick Saouter, Patrick Demichel:
A sharp region where π(x)-li(x) is positive. Math. Comput. 79(272): 2395-2405 (2010)
2000 – 2009
- 2009
- [j6]Claude Berrou, Alexandre Graell i Amat, Youssouf Ould-Cheikh-Mouhamedou, Yannick Saouter:
Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters]. IEEE Trans. Commun. 57(9): 2505-2509 (2009) - 2004
- [c10]Claude Berrou, Yannick Saouter, Catherine Douillard, Sylvie Kerouédan, Michel Jézéquel:
Designing good permutations for turbo codes: towards a single model. ICC 2004: 341-345 - 2003
- [c9]Yannick Saouter:
Decoding M-binary turbo codes by the dual method. ITW 2003: 74-77 - 2002
- [c8]Yannick Saouter, Claude Berrou:
Fast soft-output Viterbi decoding for duo-binary turbo codes. ISCAS (1) 2002: 885-888
1990 – 1999
- 1999
- [j5]Yannick Saouter, Hervé Le Verge:
Computability of Affine Non-Conditional Recurrent Systems. Inf. Process. Lett. 69(6): 291-295 (1999) - 1998
- [j4]Hervé Le Verge, Yannick Saouter:
New Results on Computability of Recurrence Equations. Int. J. Found. Comput. Sci. 9(3): 249-276 (1998) - [j3]Yannick Saouter:
Checking the odd Goldbach conjecture up to 1020. Math. Comput. 67(222): 863-866 (1998) - [c7]Jean-Marc Deshouillers, Herman te Riele, Yannick Saouter:
New Experimental Results Concerning the Goldbach Conjecture. ANTS 1998: 204-215 - [c6]Dominique Lavenier, Yannick Saouter:
Computing Goldbach Partitions Using Pseudo-random Bit Generator Operators on a FPFA Systolic Array. FPL 1998: 316-325 - 1993
- [j2]Yannick Saouter, Patrice Quinton:
Computability of recurrence equations. Theor. Comput. Sci. 116(2): 317-337 (1993) - 1991
- [c5]Catherine Dezan, Eric Gautrin, Hervé Le Verge, Patrice Quinton, Yannick Saouter:
Synthesis of systolic arrays by equation transformations. ASAP 1991: 324-337 - [c4]Catherine Dezan, Hervé Le Verge, Patrice Quinton, Yannick Saouter:
The Alpha du Centaur environment. Algorithms and Parallel VLSI Architectures 1991: 325-334 - 1990
- [j1]Abdelhamid Benaini, Patrice Quinton, Yves Robert, Yannick Saouter, Bernard Tourancheau:
Synthesis of a New Systolic Architecture for the Algebraic Path Problem. Sci. Comput. Program. 15(2-3): 135-158 (1990) - [c3]Christophe Mauras, Patrice Quinton, Sanjay V. Rajopadhye, Yannick Saouter:
Scheduling affine parameterized recurrences by means of Variable Dependent Timing Functions. ASAP 1990: 100-110
1980 – 1989
- 1989
- [c2]Kadi Bouatouch, Yannick Saouter, Jean Charles Candela:
A VLSI Chip for Ray Tracing Bicubic Patches. Eurographics 1989 - [c1]Pierrick Gachet, Christophe Mauras, Patrice Quinton, Yannick Saouter:
Alpha du centaur: a prototype environment for the design of parallel regular alorithms. ICS 1989: 235-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
