Skip to main content


ACiD, Algorithms and Complexity in Durham, is a world-leading research group with research programmes involving many international collaborators. Theoretical Computer Science comprises the development of algorithmic techniques that efficiently exploit the power of modern computers, the study of the limits of computation and the ways in which we can cope with, and take advantage of, intractability, and the science of the unsolvable.

The group is broad-based with research foci including computational complexity, proof complexity, descriptive complexity, graph theory, exact algorithms, randomised algorithms, approximation algorithms, parameterized algorithms, finite model theory, constraint satisfaction, interconnection networks, universal algebra and mathematical logic.

ACiD News

  • Welcome new members!

    We welcome Michelle Zhang as a postdoctoral research assistant (from 1st August) and Henry Austin and Tala Eagling-Vose as PhD students (from 1st October).

    See more including links

  • Promise Valued CSPs: an algebraic framework for approximation problems

    We welcome Silvia Butti (Oxford) to the ACiD seminar series on 21st November 2023!

    See more including links

  • Promise Constraint Satisfaction Problem: Structure and Complexity

    Andrei Krokhin received an EPSRC Fellowship for five years. This incorporates two postdoctoral positions in Durham. EPSRC Grant EP/X033201/1.

    See more including links

Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find usDirectionsMapsApp