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
-
Paper at FCT 25!
Congratulations to Tala Eagling-Vose, Matthew Johnson and Daniel Paulusma for their paper (with Konrad Dabrowski) “Finding d-Cuts in Probe H-Free Graphs” which has been accepted at the 25th International Symposium on Fundamentals of Computation Theory (FCT 2025). Tala will present the paper in Wrocław, Poland, in September.
-
Paper at EC 2025
The list of papers accepted for the 26th ACM Conference on Economics and Computation (EC 2025) is out. It includes the latest paper in the EPSRC-funded grant KidneyAlgo project of Durham and Glasgow: R. Colley, D. Manlove, D. Paulusma and M. Zhang, Complexity and manipulation of international kidney exchange programs with country-specific parameters
-
Two upcoming ICALP satellite workshops:
George Mertzios and Daniel Paulsuma are, respectively, organising two workshops at ICALP 2025!
-
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…
-
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”!
-
Daniel Paulusma joins Editorial Board of I&C
We congratulate Daniel Paulusma on joining the Editorial Board of Information & Computation.
Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find us: Directions, Maps, App