TCS @ Liverpool covers all areas of theoretical computer science:
- algorithms and data structures
- complexity theory
- game theory and computational social choice
Current Research Funding
Below the Branches of Universal Trees
New Horizons (Dec 2022 – May 2024)
Contacts: Sven Schewe (PI), Daniele Dell'Erba (CI), Patrick Totzke (CI) and Dominik Wojtczak (CI).
The Next Generation of Hardness Results in Total Search
Standard (Sep 2022 – Aug 2025)
Contacts: John Fearnley (PI) and Rahul Savani (co-PI).
Algebraic complexity theory via the algebraic geometry and representation theory of generalised continued fractions
Standard (Apr 2022 – Mar 2025)
Contacts: Christian Ikenmeyer (PI) and Purnata Ghosal (PDRA).
Synthesising Game Solving Techniques
Marie Skłodowska-Curie Actions (Jul 2021 – Jun 2023)
Contacts: Sven Schewe (PI) and Daniele Dell'Erba (Fellow).
Unambiguity in Infinite-state Systems
International Exchanges (Mar 2021 – Mar 2023)
Contacts: Patrick Totzke (PI), Filip Mazowiecki (CI) and Georg Zetzsche (CI).
COSTRA – The Cost of Winning Strategies
New Investigator Award (Feb 2021 – Jan 2024)
Contacts: Patrick Totzke (PI) and Sougata Bose (PDRA).
Lazy Finger Search Trees
International Exchanges (Mar 2021 – Mar 2022)
Contacts: Sebastian Wild (PI) and Kostas Tsichlas (CI).
Foundations of Composition
Marie Skłodowska-Curie Actions (Aug 2020 – Jan 2021)
Contacts: Sven Schewe (PI) and Karoliina Lehtinen (Fellow).
Geometric Complexity Theory
Individual Grant (Aug 2019 – Jul 2022)
Contacts: Christian Ikenmeyer (PI)