 | 2002 |
|---|
| 9 |       | Yannick Saouter,
Claude Berrou:
Fast soft-output Viterbi decoding for duo-binary turbo codes.
ISCAS (1) 2002: 885-888 |
| 1999 |
|---|
| 8 | | Yannick Saouter,
Hervé Le Verge:
Computability of Affine Non-Conditional Recurrent Systems.
Inf. Process. Lett. 69(6): 291-295 (1999) |
| 1998 |
|---|
| 7 | | Jean-Marc Deshouillers,
Herman te Riele,
Yannick Saouter:
New Experimental Results Concerning the Goldbach Conjecture.
ANTS 1998: 204-215 |
| 6 | | Dominique Lavenier,
Yannick Saouter:
Computing Goldbach Partitions Using Pseudo-random Bit Generator Operators on a FPFA Systolic Array.
FPL 1998: 316-325 |
| 5 |  | Hervé Le Verge,
Yannick Saouter:
New Results on Computability of Recurrence Equations.
Int. J. Found. Comput. Sci. 9(3): 249-276 (1998) |
| 4 | | Yannick Saouter:
Checking the odd Goldbach conjecture up to 1020.
Math. Comput. 67(222): 863-866 (1998) |
| 1991 |
|---|
| 3 | | C. Dezan,
Hervé Le Verge,
Patrice Quinton,
Yannick Saouter:
The Alpha du Centaur environment.
Algorithms and Parallel VLSI Architectures 1991: 325-334 |
| 1990 |
|---|
| 2 | | 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) |
| 1989 |
|---|
| 1 | | 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 |
