default search action
Stéphane Boucheron
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [i2]Anna Ben-Hamou
, Stéphane Boucheron, Elisabeth Gassiat:
Pattern Coding Meets Censoring: (almost) Adaptive Coding on Countable Alphabets. CoRR abs/1608.08367 (2016) - 2015
- [j13]Stéphane Boucheron
About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes. IEEE Trans. Inf. Theory 61(9): 4948-4967 (2015) - 2014
- [j12]Dominique Bontemps, Stéphane Boucheron
About Adaptive Coding on Countable Alphabets. IEEE Trans. Inf. Theory 60(2): 808-821 (2014) - [i1]Stéphane Boucheron, Elisabeth Gassiat, Mesrob I. Ohannessian:
About Adaptive Coding on Countable Alphabets: Max-Stable Envelope Classes. CoRR abs/1402.6305 (2014) - 2013
- [b1]Stéphane Boucheron
Concentration Inequalities - A Nonasymptotic Theory of Independence. Oxford University Press 2013, ISBN 978-0-19-953525-5, pp. 1-449
2000 – 2009
- 2009
- [j11]Stéphane Boucheron
Coding on Countably Infinite Alphabets. IEEE Trans. Inf. Theory 55(1): 358-373 (2009) - 2006
- [j10]Stéphane Boucheron
Error exponents for AR order testing. IEEE Trans. Inf. Theory 52(2): 472-488 (2006) - 2003
- [j9]Elisabeth Gassiat, Stéphane Boucheron
Optimal error exponents in hidden Markov models order estimation. IEEE Trans. Inf. Theory 49(4): 964-980 (2003) - [c6]Olivier Bousquet, Stéphane Boucheron
Introduction to Statistical Learning Theory. Advanced Lectures on Machine Learning 2003: 169-207 - [c5]Stéphane Boucheron
Concentration Inequalities. Advanced Lectures on Machine Learning 2003: 208-240 - 2002
- [j8]Stéphane Boucheron
On A Square Packing Problem. Comb. Probab. Comput. 11(2): 113-127 (2002) - [j7]Peter L. Bartlett
Model Selection and Error Estimation. Mach. Learn. 48(1-3): 85-113 (2002) - 2001
- [j6]Stéphane Boucheron
On The Independence Number Of Random Interval Graphs. Comb. Probab. Comput. 10(5): 385-396 (2001) - 2000
- [j5]Daniel Barraez, Stéphane Boucheron, Wenceslas Fernandez de la Vega:
On The Fluctuations Of The Giant Component. Comb. Probab. Comput. 9(4): 287-304 (2000) - [j4]Stéphane Boucheron, Gábor Lugosi, Pascal Massart:
A sharp concentration inequality with applications. Random Struct. Algorithms 16(3): 277-292 (2000) - [j3]Stéphane Boucheron
About priority encoding transmission. IEEE Trans. Inf. Theory 46(2): 699-705 (2000) - [c4]Peter L. Bartlett, Stéphane Boucheron, Gábor Lugosi:
Model Selection and Error Estimation. COLT 2000: 286-297
1990 – 1999
- 1997
- [j2]Yves Grandvalet, Stéphane Canu, Stéphane Boucheron:
Noise Injection: Theoretical Prospects. Neural Comput. 9(5): 1093-1108 (1997) - [j1]Stéphane Boucheron, Danièle Gardy:
An urn model from learning theory. Random Struct. Algorithms 10(1-2): 43-67 (1997) - 1995
- [c3]Yves Grandvalet, Stéphane Canu, Stéphane Boucheron:
Control of complexity in learning with perturbed inputs. ESANN 1995
1980 – 1989
- 1988
- [c2]Stéphane Boucheron, Jean Sallantin:
Some Remarks About Space-Complexity of Learning, and Circuit Complexity of Recognizing. COLT 1988: 125-138 - [c1]Stéphane Boucheron, Jean Sallantin:
Learnability in the Presence of Noise. EWSL 1988: 25-35
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-04-24 23:11 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: