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.
We congratulate Izzy Friedlander on having defended her thesis and now having the corrections accepted! Her thesis is titled “The MacWilliams Identity for the Krawtchouk Association Schemes”.
ISAAC 2023 Best Paper Award
The paper “Matching cuts in graphs of high girth and H-free graphs” by Carl Feghali, Felicia Lucke, Daniel Paulusma and Bernard Ries won a best paper award at the 34th International Symposium on Algorithms and Computation (ISAAC 2023).
The 30th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA) will take place between 22 July, 2024 and 24 July, 2024 at Durham University. The local organisers are Max Gadouleau and Karl Southern.