Charles Colbourn

from Wikipedia, the free encyclopedia

Charles Joseph Colbourn (born October 24, 1953 in Toronto ) is a Canadian mathematician and computer scientist who deals with combinatorics .

Colbourn studied at the University of Toronto with a bachelor's degree in 1976 and at the University of Waterloo with a master's degree in 1978. He received his doctorate in 1980 at the University of Toronto with Derek Corneil in computer science ( The complexity of graph isomorphisms and related problems ). In 1980 he became an assistant professor of computer science at the University of Saskatchewan , and in 1984 professor at the University of Waterloo, where he became head of the faculty in 1993. In 1996 he became a professor at the University of Vermont . Since 2001 he has been a professor at Arizona State University .

Among other things, he deals with combinatorial design theory with applications in computer science and cryptography, with graph algorithms and with the analysis of networks in terms of reliability and performance.

He has been visiting professor and visiting scholar at DIMACS at Rutgers University , at the Institute of Mathematics and its Applications in Minneapolis , at the University of Auckland in New Zealand, Curtin University in Perth at Carleton University and Simon Fraser University .

In 1990 he was a founding member of the Institute of Combinatorics and its Applications. Since 1993 he has been co-editor of the Journal of Combinatorial Designs.

In 2003 he received the Euler Medal with Peter Cameron .

He has been married since 1985 and has one daughter.

Web links

Individual evidence

  1. ↑ Life data according to American Men and Women of Science , Thomson Gale 2004
  2. ^ Mathematics Genealogy Project
  3. ^ The ICA Medals. Institute of Combinatorics and its Applications, accessed June 17, 2018 .
personal data
SURNAME Colbourn, Charles
ALTERNATIVE NAMES Colbourn, Charles Joseph
BRIEF DESCRIPTION Canadian mathematician
DATE OF BIRTH October 24, 1953
PLACE OF BIRTH Toronto