Mike Paterson

From Wikipedia, the free encyclopedia

This article may not meet the general notability guideline or one of the following specific guidelines for inclusion on Wikipedia: Biographies, Books, Companies, Fiction, Music, Neologisms, Numbers, Web content, or several proposals for new guidelines. If you are familiar with the subject matter, please expand or rewrite the article to establish its notability. The best way to address this concern is to reference published, third-party sources about the subject. If notability cannot be established, the article is more likely to be considered for redirection, merge or ultimately deletion, per Wikipedia:Guide to deletion.
This article has been tagged since June 2008.
This article or section is in need of attention from an expert on the subject.
Please help recruit one or improve this article yourself. See the talk page for details.
Please consider using {{Expert-subject}} to associate this request with a WikiProject
Mike Paterson
Nationality British
Institutions University of Warwick
Known for Algorithms and Complexity

Professor Mike Paterson, Fellow of the Royal Society, is the Director of the Centre for Discrete Mathematics and its Applications in the Department of Computer Science at the University of Warwick, and was Chair of that department in 2005.

He is best known as a world expert on Algorithms and Complexity, but has also chaired the 2007 Knuth Prize committee,[1] been on numerous conference Program Committees,[2] and is currently a member of the Program Committee of the 16th Annual European Symposium on Algorithms[3] (ESA 2008),

He received his Doctorate from Cambridge University in 1967, under David Park.[4]

Mike Paterson is also an enthusiastic mountaineer.

[edit] References & recent publications

  1. ^ 2007 Knuth Prize
  2. ^ FOCS
  3. ^ European Symposium on Algorithms
  4. ^ SIGACT genealogy datase
  • M. Dyer, L.A. Goldberg and M. Paterson, On counting homomorphisms to directed acyclic graphs, Electronic Colloquium on Computational Complexity, Report TR05-121, Oct 2005.
  • L.A. Goldberg, M. Jalsenius, R. Martin and M. Paterson, Improved mixing bounds for the anti-ferromagnetic Potts Model on Z2, LMS J. Comput. Math. 9 (2006) 1-20.
  • L.A. Goldberg, R. Martin and M. Paterson, Strong spatial mixing for lattice graphs with fewer colours, SICOMP, 35(2) 486-517 (2005).
  • M. Albert and M. Paterson, Bounds for the growth rate of meander numbers, Proceedings of the 16th Annual International Conference on Formal Power Series and Algebraic Combinatorics, 2004, University of British Columbia (Vancouver B.C., Canada).
  • L.A. Goldberg, M. Jerrum, S. Kannan and M. Paterson, A bound on the capacity of backoff and acknowledgement-based protocols, SIAM J. Computing, 88 (2004) 313-331.
  • M. Adler, P. Berenbrink, T. Friedetzky, L.A. Goldberg, P. Goldberg and M. Paterson, A proportionate fair scheduling rule with good worst-case performance, Proc. of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), 101-108 (2003).
  • L.A. Goldberg, M. Jerrum and M. Paterson, The computational complexity of two-state spin systems, Random Structures and Algorithms, 23(2) 133-154 (2003).
  • K. Iwama, A. Matsuura and M. Paterson, A family of NFAs which need 2n-alpha deterministic states, Theoretical Computer Science 301(1-3), 451-462 (2003).
  • L.A. Goldberg, S. Kelk and M. Paterson, The complexity of choosing an H-colouring (nearly) uniformly at random, SICOMP, 33(2) 416-432 (2004) copyright SIAM.
  • M. Paterson, H. Schroeder, O. Sykora and I. Vrto, On permutation communications in all-optical rings, Parallel Processing Letters 12(1), 23-29 (2002).

[edit] External links