| 2009 |
| 16 | EE | Stéphane Boucheron,
Aurelien Garivier,
Elisabeth Gassiat:
Coding on Countably Infinite Alphabets.
IEEE Transactions on Information Theory 55(1): 358-373 (2009) |
| 2006 |
| 15 | EE | Stéphane Boucheron,
Elisabeth Gassiat:
Error exponents for AR order testing.
IEEE Transactions on Information Theory 52(2): 472-488 (2006) |
| 2003 |
| 14 | EE | Olivier Bousquet,
Stéphane Boucheron,
Gábor Lugosi:
Introduction to Statistical Learning Theory.
Advanced Lectures on Machine Learning 2003: 169-207 |
| 13 | EE | Stéphane Boucheron,
Gábor Lugosi,
Olivier Bousquet:
Concentration Inequalities.
Advanced Lectures on Machine Learning 2003: 208-240 |
| 12 | | Elisabeth Gassiat,
Stéphane Boucheron:
Optimal error exponents in hidden Markov models order estimation.
IEEE Transactions on Information Theory 49(4): 964-980 (2003) |
| 2002 |
| 11 | | Stéphane Boucheron,
Wenceslas Fernandez de la Vega:
On A Square Packing Problem.
Combinatorics, Probability & Computing 11(2): (2002) |
| 10 | | Peter L. Bartlett,
Stéphane Boucheron,
Gábor Lugosi:
Model Selection and Error Estimation.
Machine Learning 48(1-3): 85-113 (2002) |
| 2001 |
| 9 | | Stéphane Boucheron,
Wenceslas Fernandez de la Vega:
On The Independence Number Of Random Interval Graphs.
Combinatorics, Probability & Computing 10(5): (2001) |
| 2000 |
| 8 | | Peter L. Bartlett,
Stéphane Boucheron,
Gábor Lugosi:
Model Selection and Error Estimation.
COLT 2000: 286-297 |
| 7 | | Daniel Barraez,
Stéphane Boucheron,
Wenceslas Fernandez de la Vega:
On The Fluctuations Of The Giant Component.
Combinatorics, Probability & Computing 9(4): (2000) |
| 6 | | Stéphane Boucheron,
Mohammad Reza Salamatian:
About priority encoding transmission.
IEEE Transactions on Information Theory 46(2): 699-705 (2000) |
| 5 | | Stéphane Boucheron,
Gábor Lugosi,
Pascal Massart:
A sharp concentration inequality with applications.
Random Struct. Algorithms 16(3): 277-292 (2000) |
| 1997 |
| 4 | EE | Yves Grandvalet,
Stéphane Canu,
Stéphane Boucheron:
Noise Injection: Theoretical Prospects.
Neural Computation 9(5): 1093-1108 (1997) |
| 3 | | Stéphane Boucheron,
Danièle Gardy:
An urn model from learning theory.
Random Struct. Algorithms 10(1-2): 43-67 (1997) |
| 1988 |
| 2 | EE | Stéphane Boucheron,
Jean Sallantin:
Some Remarks About Space-Complexity of Learning, and Circuit Complexity of Recognizing.
COLT 1988: 125-138 |
| 1 | | Stéphane Boucheron,
Jean Sallantin:
Learnability in the Presence of Noise.
EWSL 1988: 25-35 |