| |
| 2000 | ||
|---|---|---|
| 9 | EE | Laurent Habsieger, Alain Plagne: New lower bounds for covering codes. Discrete Mathematics 222(1-3): 125-149 (2000) |
| 1997 | ||
| 8 | EE | Laurent Habsieger: Binary codes with covering radius one: Some new lower bounds. Discrete Mathematics 176(1-3): 115-130 (1997) |
| 7 | Laurent Habsieger, Bruno Salvy: On integer Chebyshev polynomials. Math. Comput. 66(218): 763-770 (1997) | |
| 1996 | ||
| 6 | EE | Laurent Habsieger: Some new lower bounds for ternary covering codes. Electr. J. Comb. 3(2): (1996) |
| 1995 | ||
| 5 | EE | Mireille Bousquet-Mélou, Laurent Habsieger: Sur les matrices à signes alternants. Discrete Mathematics 139(1-3): 57-72 (1995) |
| 4 | Srecko Brlek, Pierre Castéran, Laurent Habsieger, Richard Mallette: On-Line Evaluation of Powers Using Euclid's Algorithm. ITA 29(5): 431-450 (1995) | |
| 1994 | ||
| 3 | Laurent Habsieger: Lower Bounds for q-ary Coverings by Spheres of Radius One. J. Comb. Theory, Ser. A 67(2): 199-222 (1994) | |
| 1993 | ||
| 2 | EE | Laurent Habsieger: Inégalités entre fonctions symétriques élémentaires: applications à des problèmes de log-concavité. Discrete Mathematics 115(1-3): 167-174 (1993) |
| 1991 | ||
| 1 | Peter Gritzmann, Laurent Habsieger, Victor Klee: Good and Bad Radii of Convex Polygons. SIAM J. Comput. 20(2): 395-403 (1991) | |
| 1 | Mireille Bousquet-Mélou | [5] |
| 2 | Srecko Brlek | [4] |
| 3 | Pierre Castéran | [4] |
| 4 | Peter Gritzmann | [1] |
| 5 | Victor Klee | [1] |
| 6 | Richard Mallette | [4] |
| 7 | Alain Plagne | [9] |
| 8 | Bruno Salvy | [7] |