Skip to main content

Home

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

  • Henry Austin at PODC 2025

    We congratulate Henry Austin who has both a paper and a brief announcement accepted at the ACM Symposium on Principles of Distributed Computing (PODC 2025)! The paper is “A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols” and is with P. Berenbrink, T. Friedetzky, T. Götte, L. Hintze. The brief announcement is “Amnesiac…

    See more including links

  • Paper at ICALP 2025

    Congratulations to Barnaby Martin who has a paper (with Santiago Guzmán Pro) accepted at the 52nd EATCS International Colloquium on Automata, Languages, and Programming (ICALP) this year titled “Restricted CSPs and F-free Digraph Algorithmics”!

    See more including links

  • Daniel Paulusma joins Editorial Board of I&C

    We congratulate Daniel Paulusma on joining the Editorial Board of Information & Computation.

    See more including links

  • Upcoming Combinatorics Talks

    Thomas Erlebach will speak at the 2025 Scottish Combinatorics Meeting (SCM 2025) and Daniel Paulusma will speak at the 29th Postgraduate Combinatorial Conference (PCC 2025).

    See more including links

  • CIAC 2025 Best Paper Award

    The paper “Atoms versus Avoiding Simplicial Vertices” by Karl Boddy, Konrad K. Dabrowski and Daniel Paulusma won a best paper award at the 14th International Conference on Algorithms and Complexity (CIAC 2025).

    See more including links

  • David Kutner to Glasgow

    We congratulate David Kutner on his appointment to a three-month postdoctoral position with Kitty Meeks and Jess Enright at the University of Glasgow. He will be working on the EPSRC project Multilayer Algorithmics to Leverage Graph Structure. Meanwhile, we has submitted his thesis and we look forward to welcoming him back for his viva!

    See more including links

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