Mike Paterson

Last updated

Mike Paterson
Born1942 (age 80–81)
NationalityBritish
Education Ph.D., University of Cambridge (1967)
Known for Algorithms, complexity
Awards Dijkstra Prize (2001)
EATCS Award (2006)
Scientific career
Fields Computer science
Institutions Massachusetts Institute of Technology
University of Warwick
Thesis Equivalence Problems in a Model of Computation  (1967)
Doctoral advisor David Park
Doctoral students Leslie Valiant

Michael Stewart Paterson, is a British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007, and chair of the department of computer science in 2005.

Contents

He received his Doctor of Philosophy (Ph.D.) from the University of Cambridge in 1967, under the supervision of David Park. [1] He spent three years at the Massachusetts Institute of Technology (MIT) and moved to the University of Warwick in 1971, where he remains Professor Emeritus. [2]

Paterson is an expert on theoretical computer science with more than 100 publications, especially in the design and analysis of algorithms and computational complexity. Paterson's distinguished career was recognised with the EATCS 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. A further workshop was held in 2017 in honour of his 75th birthday, co-located with the workshop for the 10th anniversary of the DIMAP centre. 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 the 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 Society since 2001 and been president of the European Association for Theoretical Computer 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]

Paterson is also an enthusiastic mountaineer.

Selected publications

See also

Related Research Articles

In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource usage, and relating these classes to each other. A computational problem is a task solved by a computer. A computation problem is solvable by mechanical application of mathematical steps, such as an algorithm.

<span class="mw-page-title-main">Clique problem</span> Task of computing complete subgraphs

In computer science, the clique problem is the computational problem of finding cliques in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found. Common formulations of the clique problem include finding a maximum clique, finding a maximum weight clique in a weighted graph, listing all maximal cliques, and solving the decision problem of testing whether a graph contains a clique larger than a given size.

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, formal language theory, the lambda calculus and type theory.

The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.

The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.

In computational complexity theory, a language B is said to be low for a complexity class A if AB = A; that is, A with an oracle for B is equal to A. Such a statement implies that an abstract machine which solves problems in A achieves no additional power if it is given the ability to solve problems in B at unit cost. In particular, this means that if B is low for A then B is contained in A. Informally, lowness means that problems in B are not only solvable by machines which can solve problems in A, but are “easy to solve”. An A machine can simulate many oracle queries to B without exceeding its resource bounds.

<span class="mw-page-title-main">Leslie Valiant</span> British American computer scientist

Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".

ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.

<span class="mw-page-title-main">Kurt Mehlhorn</span> German computer scientist (born 1949)

Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.

Michael Ralph Fellows AC HFRSNZ MAE is a computer scientist and the Elite Professor of Computer Science in the Department of Informatics at the University of Bergen, Norway as of January 2016.

Mark Richard Jerrum is a British computer scientist and computational theorist.

Alistair Sinclair is a British computer scientist and computational theorist.

<span class="mw-page-title-main">Maurice Nivat</span> French computer scientist

Maurice Paul Nivat was a French computer scientist. His research in computer science spanned the areas of formal languages, programming language semantics, and discrete geometry. A 2006 citation for an honorary doctorate (Ph.D.) called Nivat one of the fathers of theoretical computer science. He was a professor at the University Paris Diderot until 2001.

<span class="mw-page-title-main">Ryan Williams (computer scientist)</span> Computer scientist

Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.

<span class="mw-page-title-main">Toniann Pitassi</span> Canadian-American computer scientist

Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto.

Hans Leo Bodlaender is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known for his work on graph algorithms and parameterized complexity and in particular for algorithms relating to tree decomposition of graphs.

The EATCS–IPEC Nerode Prize is a theoretical computer science prize awarded for outstanding research in the area of multivariate algorithmics. It is awarded by the European Association for Theoretical Computer Science and the International Symposium on Parameterized and Exact Computation. The prize was offered for the first time in 2013.

Leslie Ann Goldberg is a professor of computer science at the University of Oxford and a Fellow of St Edmund Hall, Oxford. Her research concerns the design and analysis of algorithms for random sampling and approximate combinatorial enumeration.

Benjamin E. Rossman is an American mathematician and theoretical computer scientist, specializing in computational complexity theory. He is currently an associate professor of computer science and mathematics at Duke University.

References

  1. ↑ SIGACT genealogy datase
  2. ↑ Mike Paterson at the Mathematics Genealogy Project
  3. ↑ Paterson, Mike; Zwick, Uri (2009). "Overhang". American Mathematical Monthly. 116 (1): 19–44. doi:10.4169/193009709x469797.
  4. ↑ Maurice Nivat, About the birth of Theoretical Computer Science, abstract of talk held at Paterson's 66th birthday.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.