Martin Dyer

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Martin Edward Dyer (born 16 July 1946 in Ryde, Isle of Wight, England) is a professor in the School of Computing at the University of Leeds, Leeds, England. He graduated from the University of Leeds in 1967, obtained his MSc from Imperial College London in 1968 and his PhD from the University of Leeds in 1979. His research interests lie in theoretical computer science, discrete optimization and combinatorics. Currently, he focuses on the complexity of counting and the efficiency of Markov chain algorithms for approximate counting.

Key contributions[edit]

Four key contributions made by Martin Dyer are:

(1) - polynomial time algorithm for approximating the volume of convex bodies (with Alan Frieze and Ravindran Kannan)[1]

(2) - linear programming in fixed dimensions

(3) - the path coupling method for proving mixing of Markov chains (with Russ Bubley)[2]

(4) - complexity of counting constraint satisfaction problems

Awards and honours[edit]

In 1991, Professor Dyer received the Fulkerson Prize in Discrete Mathematics (Jointly with Alan Frieze and Ravi Kannan for the paper "A random polynomial time algorithm for approximating the volume of convex bodies" in the Journal of the Association for Computing Machinery) awarded by the American Mathematical Society and the Mathematical Programming Society.

In 2013, the EATCS Awards Committee consisting of Leslie Ann Goldberg, Vladimiro Sassone and Friedhelm Meyer auf der Heide (chair), has unanimously decided to give the EATCS Award to Professor Martin Dyer.

Personal[edit]

Martin Dyer is married to Alison. They have two adult children.

References[edit]

  1. ^ M.Dyer, A.Frieze and R.Kannan (1991). "A random polynomial-time algorithm for approximating the volume of convex bodies". Journal of the ACM 38 (1): 1–17. doi:10.1145/102782.102783. 
  2. ^ R. Bubley and M. E. Dyer (1997). "Path coupling: a technique for proving rapid mixing in Markov chains". Proceedings of the 38th Annual Symposium on Foundations of Computer Science, IEEE: 223–231. doi:10.1109/SFCS.1997.646111.