The SCEAS System
| |||||||

## Search the dblp DataBase
Michel Talagrand:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Wansoo T. Rhee, Michel Talagrand
**Packing Random Items of Three Colors.**[Citation Graph (0, 0)][DBLP] SODA, 1990, pp:261-271 [Conf] - Wansoo T. Rhee, Michel Talagrand
**Packing random items of three colors.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1992, v:12, n:3, pp:331-350 [Journal] - Michel Talagrand
**How Much Are Increasing Sets Positively Correlated?**[Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:2, pp:243-258 [Journal] - Michel Talagrand
**On Boundaries and Influences.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1997, v:17, n:2, pp:275-285 [Journal] - Wansoo T. Rhee, Michel Talagrand
**Some distributions that allow perfect packing.**[Citation Graph (0, 0)][DBLP] J. ACM, 1988, v:35, n:3, pp:564-578 [Journal] - Stanislaw J. Szarek, Michel Talagrand
**On the Convexified Sauer-Shelah Theorem.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1997, v:69, n:2, pp:183-192 [Journal] - Wansoo T. Rhee, Michel Talagrand
**The Random Weighted Interval Packing Problem: the Intermediate Density Case.**[Citation Graph (0, 0)][DBLP] Math. Oper. Res., 2000, v:25, n:1, pp:105-117 [Journal] - Wansoo T. Rhee, Michel Talagrand
**Dual bin packing with items of random sizes.**[Citation Graph (0, 0)][DBLP] Math. Program., 1993, v:58, n:, pp:229-242 [Journal] - Michel Talagrand
**Gaussian averages, Bernoulli averages, and Gibbs' measures.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:197-204 [Journal] - Michel Talagrand
**Self averaging and the space of interactions in neural networks.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1999, v:14, n:3, pp:199-213 [Journal] - Michel Talagrand
**Intersecting random half cubes.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1999, v:15, n:3-4, pp:436-449 [Journal] - Wansoo T. Rhee, Michel Talagrand
**Optimal Bin Packing with Items of Random Sizes II.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:1, pp:139-151 [Journal] - Wansoo T. Rhee, Michel Talagrand
**Optimal Bin Packing with Items of Random Sizes III.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:3, pp:473-486 [Journal] - Wansoo T. Rhee, Michel Talagrand
**Optimal Bin Covering with Items of Random Size.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:3, pp:487-498 [Journal] - Wansoo T. Rhee, Michel Talagrand
**The Complete Convergence of Best Fit Decreasing.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:5, pp:909-918 [Journal] - Wansoo T. Rhee, Michel Talagrand
**The Complete Convergence of First Fit Decreasing.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:5, pp:919-938 [Journal] - Wansoo T. Rhee, Michel Talagrand
**On-Line Bin Packing of Items of Random Sizes, II.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:6, pp:1251-1256 [Journal] - Wansoo T. Rhee, Michel Talagrand
**Convergence in Distribution for Best-Fit Decreasing.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1996, v:25, n:4, pp:894-906 [Journal] - Michel Talagrand
**Rigorous results for mean field models for spin glasses.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:265, n:1-2, pp:69-77 [Journal] **Are many small sets explicitly small?**[Citation Graph (, )][DBLP]
Search in 0.092secs, Finished in 0.093secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |