default search action
Michel Talagrand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j25]Naomi Lindenstrauss, Michel Talagrand:
What is the satisfiability threshold of random balanced Boolean expressions? Random Struct. Algorithms 61(3): 599-615 (2022)
2010 – 2019
- 2010
- [c2]Michel Talagrand:
Are many small sets explicitly small? STOC 2010: 13-36
2000 – 2009
- 2002
- [j24]Michel Talagrand:
Gaussian averages, Bernoulli averages, and Gibbs' measures. Random Struct. Algorithms 21(3-4): 197-204 (2002) - 2001
- [j23]Michel Talagrand:
Rigorous results for mean field models for spin glasses. Theor. Comput. Sci. 265(1-2): 69-77 (2001) - 2000
- [j22]Wansoo T. Rhee, Michel Talagrand:
The Random Weighted Interval Packing Problem: the Intermediate Density Case. Math. Oper. Res. 25(1): 105-117 (2000)
1990 – 1999
- 1999
- [j21]Michel Talagrand:
Self averaging and the space of interactions in neural networks. Random Struct. Algorithms 14(3): 199-213 (1999) - [j20]Michel Talagrand:
Intersecting random half cubes. Random Struct. Algorithms 15(3-4): 436-449 (1999) - 1997
- [j19]Michel Talagrand:
On Boundaries and Influences. Comb. 17(2): 275-285 (1997) - [j18]Stanislaw J. Szarek
, Michel Talagrand:
On the Convexified Sauer-Shelah Theorem. J. Comb. Theory B 69(2): 183-192 (1997) - 1996
- [j17]Michel Talagrand:
How Much Are Increasing Sets Positively Correlated? Comb. 16(2): 243-258 (1996) - [j16]Wansoo T. Rhee, Michel Talagrand:
Convergence in Distribution for Best-Fit Decreasing. SIAM J. Comput. 25(4): 894-906 (1996) - 1993
- [j15]Wansoo T. Rhee, Michel Talagrand:
On Line Bin Packing with Items of Random Size. Math. Oper. Res. 18(2): 438-445 (1993) - [j14]Wansoo T. Rhee, Michel Talagrand:
Dual bin packing with items of random sizes. Math. Program. 58: 229-242 (1993) - [j13]Wansoo T. Rhee, Michel Talagrand:
On-Line Bin Packing of Items of Random Sizes, II. SIAM J. Comput. 22(6): 1251-1256 (1993) - 1992
- [j12]Wansoo T. Rhee, Michel Talagrand:
Packing random items of three colors. Comb. 12(3): 331-350 (1992) - 1991
- [j11]Wansoo T. Rhee, Michel Talagrand:
Multidimensional Optimal Bin Packing with Items of Random Size. Math. Oper. Res. 16(3): 490-503 (1991) - [j10]Michel Talagrand:
Complete Convergence of the Directed TSP. Math. Oper. Res. 16(4): 881-887 (1991) - 1990
- [c1]Wansoo T. Rhee, Michel Talagrand:
Packing Random Items of Three Colors. SODA 1990: 261-271
1980 – 1989
- 1989
- [j9]Wansoo T. Rhee, Michel Talagrand:
Martingale Inequalities, Interpolation and NP-Complete Problems. Math. Oper. Res. 14(1): 91-96 (1989) - [j8]Wansoo T. Rhee, Michel Talagrand:
A Concentration Inequality for the K-Median Problem. Math. Oper. Res. 14(2): 189-202 (1989) - [j7]Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Packing with Items of Random Sizes II. SIAM J. Comput. 18(1): 139-151 (1989) - [j6]Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Packing with Items of Random Sizes III. SIAM J. Comput. 18(3): 473-486 (1989) - [j5]Wansoo T. Rhee, Michel Talagrand:
Optimal Bin Covering with Items of Random Size. SIAM J. Comput. 18(3): 487-498 (1989) - [j4]Wansoo T. Rhee, Michel Talagrand:
The Complete Convergence of Best Fit Decreasing. SIAM J. Comput. 18(5): 909-918 (1989) - [j3]Wansoo T. Rhee, Michel Talagrand:
The Complete Convergence of First Fit Decreasing. SIAM J. Comput. 18(5): 919-938 (1989) - 1988
- [j2]Wansoo T. Rhee, Michel Talagrand:
Some distributions that allow perfect packing. J. ACM 35(3): 564-578 (1988) - 1987
- [j1]Wansoo T. Rhee, Michel Talagrand:
Martingale Inequalities and NP-Complete Problems. Math. Oper. Res. 12(1): 177-181 (1987)
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-06-10 21:27 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: