Professor Martin Dyer

Professor Martin Dyer

Research interests

Sampling and counting, randomised algorithms, Markov chains, complexity theory, constraint satisfaction problems, random structures, probabilistic analysis, combinatorial optimisation.

See the Algorithms and Complexity research group page for further information.

<h4>Research projects</h4> <p>Any research projects I'm currently working on will be listed below. Our list of all <a href="">research projects</a> allows you to view and search the full list of projects in the faculty.</p>

Professional memberships

  • ACM

Research groups and institutes

  • Algorithms and Complexity