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
-
David Fairbairn
We congratulate David Fairbairn on passing his PhD viva with no corrections! David has been supervised by Norbert Peyerimhoff from Mathematics and George Mertzios and Matthew Johnson in CS.
-
Noémie Catherinot
Noémie is visiting ACiD for nine months as an internship as part of her studies on the programme Parisian Master of Research in Computer Science (MPRI) at Université Paris-Saclay. She is working on graph structure and algorithms with Matthew, Daniel and Alfie
-
Editorial Board Appointments
Max Gadouleau has joined the editorial board of Natural Computing and Barnaby Martin has joined the editorial board of Discrete Applied Mathematics.
-
New ACiD PhDs: Welcome Selma and Jack!
We welcome new PhD students: Jack Parkes (Durham, CS) and Selma Cholich (Durham, Maths)! Both will join Andrei Krokhin in his study of Promise Constraint Satisfaction Problems.
-
Talks from Max and Craig
Max Gadouleau will be giving a talk at the next Workshop on Applied Algebra and Geometry, in York on Tuesday 15th September. During this same week, Craig Millar will be speaking at the International Conference on Semigroups and Applications, which honours the 65th birthday of Vicky Gould (York). We send our love to Vicky for…
-
Computation A la Rice!
Max Gadouleau joined ALARICE, an ANR project from researchers in France: Kévin Perrot (Marseille) and Adrien Richard (Nice} for obtaining results “à la Rice”, such as general complexity bounds for finite dynamical systems. The grant enables Max to undertake research visits to Nice and elsewhere to collaborate on the project, which will be Nice.
Contact us:
email: [email protected]
tel:+44 (0) 191 334 1700
Find us: Directions, Maps, App