Bruce Reed

from Wikipedia, the free encyclopedia
Bruce Reed (2015)

Bruce Allen Reed (* 1962 ) is a Canadian mathematician and computer scientist who specializes in graph theory.

Reed received his PhD from McGill University in 1986 with Vašek Chvátal (A semi-strong perfect graph theorem). He was at the University of Waterloo , Carnegie Mellon University , doing research for the CNRS before becoming Professor at McGill University, where he holds a Canada Research Chair in Graph Theory.

He researched perfect graphs , graph minors, random graphs, optimal graph coloring using probabilistic methods and algorithms to solve graph theoretical problems that arise in applications such as telephone networks, VLSI design and the World Wide Web.

In 2013 he received the CRM Fields PIMS Prize . In 2009 he became a Fellow of the Royal Society of Canada . In 2002 he was invited speaker at the International Congress of Mathematicians in Beijing ( List coloring of graphs with at most vertices , with Benny Sudakov ).

Fonts

  • with Michael Molloy: Graph Coloring and the Probabilistic Method, Algorithms and Combinatorics 23, Berlin: Springer-Verlag 2002
  • with Noga Alon , Colin McDiarmid: Acyclic coloring of graphs, Random Structures & Algorithms, Volume 2, 1991, pp. 277-288
  • with V. Chvátal: Mick gets some (the odds are on his side), Proc. 33rd Annual Symposium on Foundations of Computer Science, 1992, pp. 620-627.
  • Finding approximate separators and computing tree width quickly, Proc. 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 221-228.
  • with Michael Molloy: A critical point for random graphs with a given degree sequence, Random Structures & Algorithms, Volume 6, 1995, pp. 161-179.
  • Tree width and tangles: a new connectivity measure and some applications, Surveys in combinatorics, 1997 (London), London Math. Soc. Lecture Note Ser. 241, Cambridge: Cambridge Univ. Press, 1997, pp. 87-162.
  • with M. Molloy: The size of the giant component of a random graph with a given degree sequence, Combinatorics, Probability and Computing, Volume 7, 1998, pp. 295-305.
  • with M. Molloy: Further algorithmic aspects of the local lemma, Proc. 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 524-529.

Web links

Individual evidence

  1. ↑ Bruce Reed in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
personal data
SURNAME Reed, Bruce
ALTERNATIVE NAMES Reed, Bruce Allen (full name)
BRIEF DESCRIPTION Canadian mathematician and computer scientist
DATE OF BIRTH 1962