Martin Dyer is Research Professor in the School of Computing at the University of Leeds. He is well known internationally in the area of algorithms and computational complexity. Dyer has published more than 150 research papers in these and related areas. He has frequently been a plenary speaker, program committee member, and organizer of international conferences and workshops. He has collaborated with researchers in the UK, Australia, Canada, China, Germany, India and the USA. He was awarded the Fulkerson Prize in 1991 for work with Frieze and Kannan on polynomial time randomized algorithms for approximating the volume of convex bodies. He received the 2013 EATCS Award in recognition of his contributions to a wide range of topics within Theoretical Computer Science. He has worked extensively on algorithmic aspects of discrete Markov processes, and in computational complexity. In particular, he has worked on Markov chain methods for sampling and approximate counting, pioneered the path coupling method for establishing the mixing rate of Markov chains, and devised novel approaches to analyzing the counting complexity of constraint satisfaction problems.
- Counting Complexity and Phase Transitions, Spring 2016. Visiting Scientist, Program Organizer and Workshop Organizer.