Mike Paterson
Michael S. "Mike" Paterson ( born 1942 ) is a British computer scientist.
Paterson was educated at Cambridge University, where he received his doctorate at David Park 1967 ( Equivalence problems in a model of computation ). As a post - graduate student, he was at the Massachusetts Institute of Technology and in 1971 he was at the University of Warwick, where he was a professor of computer science and by 2007 the Centre for Discrete Mathematics and its Applications initiated.
He is particularly concerned with the design and analysis of algorithms and complexity theory.
His PhD is one of Leslie Valiant. He became president of the European Association for Theoretical Computer Science ( EATCS ), 2001. In 2006 he received the EATCS Award. In 2001 he received the Dijkstra Prize for work on Distributed computing with Michael J. Fischer and Nancy Lynch. He became a Fellow of the Royal Society in 2001.
In 2012 he was one of the recipients of the David P. Robbins Prize for a work that dealt with the problem of the number of stacked blocks with overhang.
With William Thurston and others, he co-authored a book on automatic groups.
He is an avid mountain climber.
Writings
- As editor: Boolean Function Complexity, London Mathematical Society Lecture Note Series, Cambridge University Press, 1992 ( Durham Symposium 1990)
- As editor: Automata, languages and programming (17th International Colloquium, Warwick University, England, July 1990), Springer Verlag, Lecture Notes in Computer Science 443, 1990
- As editor: Algorithms - ESA 2000, Springer Verlag, Lecture Notes in Computer Science 1879, 2000 ( Annual European Symposium on Algorithms 8, Saarbrücken 2000)
- Published by Bo Chen, Zhang Guochuan: Combinatorics, algorithms, probabilistic and experimental methodologies: first international symposium, ESCAPE 2007, Hangzhou, China, April 2007, Springer Verlag 2007
- With David B. Epstein, James W. Cannon, Derek F. Holt, Silvio Levy, William Thurston Word processing in groups, Jones and Bartlett, Boston, 1992