« Bruce Reed » : différence entre les versions
Créé en traduisant la page « Bruce Reed (mathematician) » Balise : [de contenu] |
(Aucune différence)
|
Version du 17 avril 2015 à 16:08
Bruce Alan Reed FRSC is a Canadian mathematician and computer scientist, the Canada Research Chair in Graph Theory and a professor of computer science at McGill University.[1]
Academic career
Reed earned his Ph.D. in 1986 from McGill, under the supervision of Vašek Chvátal.[2] Before returning to McGill as a Canada Research Chair, Reed held positions at the University of Waterloo, Carnegie Mellon University, and the French National Centre for Scientific Research.[3]
Reed was elected as a fellow of the Royal Society of Canada in 2009,[4] and is the recipient of the 2013 CRM-Fields-PIMS Prize.[5]
Research
Reed's thesis research concerned perfect graphs.[2] With Michael Molloy, he is the author of a book on graph coloring and the probabilistic method.[6] Reed has also published highly cited papers on the giant component in random graphs with a given degree sequence,[7] random satisfiability problems,[8] acyclic coloring,[9] tree decomposition,[10] and constructive versions of the Lovász local lemma.[11]
Selected publications
Articles
- « {{{1}}} ».
- « {{{1}}} ».
- « {{{1}}} ».
- « {{{1}}} ».
- « {{{1}}} ».
- « {{{1}}} ».
- « {{{1}}} ».
Books
- « {{{1}}} ».
References
- Chairholders: Bruce A.
- (en) « Bruce Reed », sur le site du Mathematics Genealogy Project
- Past members, Pacific Institute for the Mathematical Sciences, retrieved 2012-10-07.
- « {{{1}}} »
- « {{{1}}} », Pacific Institute for the Mathematical Sciences, retrieved 2012-12-30.
- Kayll, P.
- Modèle:Harvs1995, 1998a)
- Chvátal & Reed (1992).
- Alon, McDiarmid & Reed (1991).
- Modèle:Harvs1992, 1997).
- Molloy & Reed (1998b).
External links
- Home page at McGill
- Modèle:DBLP
- Google scholar profile