Michael Stewart "Mike" Paterson, is a British computer scientist, who
was the director of the Centre for Discrete Mathematics and its
Applications at the
University of WarwickUniversity of Warwick until 2007, and chair of the
Department of
Computer ScienceComputer Science in 2005.
He received his doctorate from Cambridge University in 1967, under the
supervision of David Park.[1] He spent three years at
MITMIT and moved to
University of WarwickUniversity of Warwick in 1971.[2]
Paterson is an expert on theoretical computer science with more than
100 publications, especially the design and analysis of algorithms and
computational complexity. Paterson's distinguished career was
recognised with the
EATCS AwardEATCS Award in 2006 and a workshop in honour of
his 66th birthday in 2008, including contributions of several Turing
Award and
Gödel Prize laureates. For his work on distributed
computing with Fischer and Lynch, he received the
Dijkstra Prize in
2001, and his work with Dyer and Goldberg on counting graph
homomorphisms received a best paper award at the
ICALP conference in
2006.
Mike Paterson received a
Lester R. Ford Award in 2010.[3] He is
a
Fellow of the Royal SocietyFellow of the Royal Society since 2001 and been president of the
European Association for Theoretical
Computer ScienceComputer Science (EATCS).
According to EATCS president Maurice Nivat, Paterson played a great
role in the late 1960s in the recognition of computer science as a
science, "and that theoretical computer science, which is very close
to mathematics but distinct in its motivation and inspiration, is
indeed a challenging and fruitful field of research."[4]
He is also an enthusiastic mountaineer.
See also[edit]