Our main research theme concerns the mathematical foundations of computer science. The topics we are interested in include algorithms, computational complexity and combinatorics, logical methods, program semantics, hardware and software verification and interactive theorem proving. They range from theory to applications. More specific areas of research include:
RECENT NEWS
FOX is organising a workshop on January 29 – 30. More details here.
FOX is advertising for three fully-funded PhD studentships in the area of Algorithms and Complexity. Get in touch with Joachim, Sagnik or Andreas. More details here.
FOX has one paper accepted in FOCS 2023. More details here.
Sagnik Mukhopadhyay has won the New Investigator Award.
FOX has two papers accepted in STOC 2023. More details here.
Harsh Beohar has won the prestigious New Investigator Award.
| Graph and approximation algorithms | Andreas Emil Feldmann Sagnik Mukhopadhyay Joachim Spoerhase |
| Computational and logical complexity | Sagnik Mukhopadhyay Joachim Spoerhase Navid Talebanfard Jonni Virtema Maksim Zhukovskii |
| Combinatorics and combinatorial optimisation | Andreas Emil Feldmann Pietro Oliveto Joachim Spoerhase Maksim Zhukovskii |
| Logic and finite model theory | Mike Stannet Jonni Virtema Maksim Zhukovskii Andrew Lewis-Smith |
| Program correctness and verification | Harsh Beohar Kirill Bogdanov John Derrick Rob Hierons Andrei Popescu Georg Struth Jonni Virtema |
| Semantics and applied category theory | Harsh Beohar Andrei Popescu Georg Struth Andrew Lewis-Smith |
| Interactive theorem proving | Andrei Popescu Mike Stannett Georg Struth |
| Bio-inspired search-heuristics | Pietro Oliveto |
UPCOMING SEMINARS
No upcoming seminars
Foundation of Computation @ Sheffield (FOX) 