Find Academic Supervisors

Marcin Jurdzinski is an Associate Professor (Reader) in the Department of Computer Science at the University of Warwick , UK. He has been a faculty member since 2004 and is a core member of the Foundations of Computer Science and Discrete Mathematics and its Applications research groups. University: University of Warwick School: Faculty of Science Department: Department of Computer Science Position: Associate Professor (Reader) Email: Marcin.Jurdzinski@warwick.ac.uk Office: CS2.19 His research lies at the intersection of algorithms, game theory, automata, and logic , with a strong emphasis on formal verification , model checking , and theoretical computer science . He is best known for his foundational work on parity games , including the development of small progress measures and discrete strategy improvement algorithms. The recent publications reveal a consistent focus on computational complexity in games and verification. Key themes include stochastic games, timed automata, bisimilarity, and quantitative analysis . His work often bridges theoretical insights with practical verification challenges, especially in real-time and probabilistic systems. He has supervised several PhD students and hosted postdoctoral researchers such as Laure Daviaud and Alexander Kozachinskiy. He has led EPSRC-funded projects including Solving Parity Games in Theory and Practice and Counter Automata: Verification and Synthesis . PhD Students: Aditya Prakash, Thejaswini K. S., Michail Fasoulakis, John Fearnley, Michal Rutkowski, Ashutosh Trivedi Postdocs: Laure Daviaud, Alexander Kozachinskiy He is actively involved in the academic community, serving on the steering committee of the Highlights of Logic, Games and Automata conference and on program committees for major venues such as CONCUR, ICALP, and LICS. He has also organized workshops including FORMATS and ICALP co-located events.

• Algorithms
• Game Theory
• Automata Theory
• +7 more

Dr Paul C. Bell is a Research Fellow in Computer Science currently affiliated with Liverpool John Moores University since 2017, maintaining a continuing Visiting Fellow position at Loughborough University where he previously served as a lecturer from 2011 to 2017. His academic foundation includes postdoctoral research at Turku University (Finland), Universite catholique de Louvain (Belgium), and Liverpool University following doctoral studies. His educational background comprises: BSc, University of Liverpool PhD, University of Liverpool Dr Bell specializes in Theoretical Computer Science and Formal Language Theory, investigating the boundaries of tractability and computability for reachability problems across mathematical models including matrix semigroups, hybrid systems, and probabilistic/quantum automata. His interdisciplinary work bridges Computer Science, Physics, and Mathematics through encodings of optimization problems for adiabatic quantum computers, alongside contributions to energy-efficient computing via speed-scaling algorithms for multi-processor systems. With over twenty publications in leading international venues, he actively serves as a reviewer and program committee member for conferences such as Reachability Problems 2017.

• Theoretical Computer Science
• Formal Language Theory
• Reachability Problems
• +8 more

Kitty Meeks is a Reader in the School of Computing Science at the University of Glasgow, having transitioned from the School of Mathematics and Statistics in 2016. Her research focuses on algorithm design, particularly parameterized and counting complexity, with applications in graph theory and precision medicine. She holds an EPSRC Fellowship (2021–2026) and previously a Royal Society of Edinburgh Personal Research Fellowship (2016–2021). Education: MMath in Mathematics and Computer Science (Oxford, 2009), DPhil in Mathematics (Oxford, 2013). Postdoctoral research at Queen Mary University of London (2012–2014). Research: Explores efficient algorithms for network analysis, including structural properties of real datasets and applications in precision medicine. Current projects address combinatorial optimization for multiple solution spaces. Awards: Royal Society of Edinburgh Fellowship, EPSRC Fellowship. Grants: EPSRC projects on multilayer algorithmics and precision medicine, plus Scottish Crucible Seed Funding. Students: Supervises Peace Ayegba (Student-Project Allocation Problems) and Laura Larios-Jones (Temporal Graph Algorithms).

• Algorithms
• Graph Theory
• Computational Complexity
• +3 more

Dr Richard Hepworth-Young is a Reader in the School of Natural and Computing Sciences at the University of Aberdeen, where he has been a faculty member since 2011. His research is centered in algebraic topology, with significant contributions to homological stability and magnitude homology. He teaches advanced courses such as MX4540 Knots and MX4546 Algebraic Topology, employing a flipped classroom model. He is an active member of the mathematical community, organizing the Scottish Topology Seminar. His research interests include: Algebraic Topology Homological Stability Magnitude Homology String Topology Diagram Algebras (Temperley-Lieb, Brauer, Partition) Orbifolds and Stacks His recent publications demonstrate a strong trend in applying homological methods to algebraic and combinatorial structures, particularly diagram algebras and directed graphs. He has pioneered work on magnitude homology—a categorification of Tom Leinster's magnitude—with applications in metric geometry and curvature. His work often involves deep collaborations with researchers such as Simon Willerton, Rachael Boyd, and Emily Roff. Richard Hepworth-Young has not received any explicitly mentioned scientific awards in the provided text. He has supervised or collaborated with several researchers, though no formal list of PhD or Master’s students is provided. He has been involved in multiple research grants through his publications and collaborations, though specific grant details are not listed. He is not known to lead a formal lab or research team, but his collaborative network includes prominent figures in topology.

• Algebraic Topology
• Homological Stability
• Magnitude Homology
• +10 more

James Worrell is a Professor of Computer Science at the University of Oxford, affiliated with Green Templeton College. He holds a prestigious UKRI Fellowship (equivalent to an ERC Advanced Grant) and an EPSRC Established-Career Fellowship. His research focuses on logic in computer science, linear dynamical systems, and automated verification, with applications to formal methods and decision procedures. He has held leadership roles on program committees for major conferences including POPL, CONCUR, FoSSaCS, and ICALP. Notable invited talks include the CRM Workshop on Fluid Dynamics and the MOD23 Summer School in Formal Verification. He currently advises PhD students like Julian D’Costa and collaborates with postdocs Bertrand Teguia and Jakub Konieczny. His research investigates decidability questions in linear systems, recurrence sequences, and matrix semigroups. He has pioneered techniques combining o-minimal geometry, automata theory, and model checking to analyze dynamical systems. Recent work addresses transcendence properties of numerical sequences and robustness in machine learning models. Awards include ERC and UKRI funding recognitions. He teaches advanced courses on logic and proof, automata theory, and computational learning theory at Oxford, with lecture materials available online. His work bridges theoretical computer science with applications in safety-critical systems and formal verification.

• Logic in Computer Science
• Linear Dynamical Systems
• Automated Verification
• +3 more

Amrita Suresh is a Research Associate in the Department of Computer Science at the University of Oxford, working under Professor Nobuko Yoshida. She specializes in formal verification, focusing on communicating automata and session types. Previously, she completed her PhD at ENS Paris-Saclay under advisors Alain Finkel and Benedikt Bollig, with research on subclasses of communicating automata and decidability in verification. PhD in Computer Science (ENS Paris-Saclay) MSc in Computer Science (ENS Paris-Saclay) BE in Computer Science (BITS Pilani) Her research interests span formal verification, automata theory, temporal logics, and distributed systems. She has contributed to foundational work on input-bounded FIFO systems, synchronizability via Message Sequence Charts, and extensions of Well-Structured Transition Systems. Her publications highlight advancements in decidability of reachability problems and frameworks for synchronizability. Awards include the Best Teaser Talk Award at CONCUR’21 and Best Paper Award at CONCUR’20. Amrita has taught courses in Systems and Architecture, Programming I (undergraduate), and Tree Automata and Their Applications. She actively participates in academic events, including serving on program committees for conferences like ICE’22 and as Technical Chair for QONFEST’21. She is affiliated with Nobuko Yoshida’s research group and collaborates on theoretical computer science challenges, particularly in formal methods for distributed systems.

• Formal Verification
• Automata Theory
• Temporal Logics
• +4 more

Dr. Eleni Akrida serves as an Associate Professor in the Department of Computer Science at Durham University and holds the position of Deputy Executive Dean (Academic Student Experience) in the Faculty of Science. Since joining Durham in 2019, she has significantly contributed to academic leadership, including a term as Director of Undergraduate Studies from 2020 to 2025, shaping curriculum development and student experience across the department. Her academic foundation includes a Mathematics degree from the University of Patras, Greece, followed by Computer Science studies at the University of Liverpool, UK, establishing her interdisciplinary expertise in theoretical and applied computer science. Dr. Akrida's research bridges cutting-edge Computer Science education and theoretical algorithms. She pioneers pedagogical frameworks for abstraction skill development and investigates neurodivergent student experiences in CS education. Concurrently, her theoretical work explores probabilistic algorithms, graph complexity, and dynamic network optimization, yielding foundational insights in temporal graph theory and algorithmic game theory. Analysis of her publication trajectory reveals a strategic evolution: recent work (2023-2025) emphasizes educational innovation through frameworks for abstraction skills and neurodivergent inclusion studies, complemented by NLP contributions to plagiarism detection. Earlier research (2014-2021) established her authority in temporal graph algorithms, with seminal journal publications on connectivity, exploration, and game-theoretic models in dynamic networks. Her research impact is amplified through competitive grant funding: Exploring the Experiences of Neurodivergent Students in Computer Science Higher Education in the UK (CPHC Special Project, 2025/26) A Theoretical Computer Science Commons in the hybrid era (CPHC Special Project, 2022/23) Dr. Akrida actively mentors postgraduate researchers including Saira Richardson and leverages her leadership roles to drive educational innovation. She contributes to Durham's Pedagogical Innovations in Computer Science and Algorithms and Complexity research groups, fostering interdisciplinary collaborations that bridge theoretical rigor with practical educational applications.

• Computer Science education
• Probabilistic algorithms
• Graph algorithms
• +1 more

Dr. Edon Kelmendi is a Lecturer in Computer Science at Queen Mary University of London, affiliated with the School of Electronic Engineering and Computer Science and the Centre for Fundamental Computer Science. His research focuses on algorithmic verification, dynamical systems, logics in computer science, game theory, and automata theory. He holds a position combining teaching and research responsibilities (T&R). His research interests revolve around theoretical computer science, particularly in the algorithmic analysis of dynamical systems, decision procedures for ω-regular properties, and stochastic games. He explores topics such as linear recurrence sequences, reachability problems in hybrid systems, and submixing properties in stochastic environments. Dr. Kelmendi’s recent work includes advancements in decidability questions for discrete and continuous linear dynamical systems, the design of learning algorithms for stochastic games, and formal verification techniques for automata and logical systems. His publications span venues like the ACM/IEEE Symposium on Logic in Computer Science (LICS) and the International Journal of Game Theory. He is actively involved in the Centre for Fundamental Computer Science, contributing to research themes such as formal methods, theoretical computer science, and algorithmic foundations. No specific grants or advising roles are explicitly listed in the provided materials.

• Algorithmic Verification
• Dynamical Systems
• Logics in Computer Science
• +3 more

David Kutner is a Career Development Fellow (Research Fellow) in the Department of Computer Science at Durham University, where he concurrently pursues postgraduate studies. His research bridges theoretical computer science and real-world applications, focusing on dynamic network problems. Education Kutner earned his PhD (2021-2025) from Durham University with a thesis titled Eventful graphs: the computational complexity of recognizing and realizing properties in changing networks , supervised by Dr. George Mertzios, Dr. Tom Friedetzky, Prof. Iain Stewart, and Dr. Amitabh Trehan. He previously completed a first-class MEng in Computer Science (2017-2021) at Durham, receiving a Certificate of Exceptional Achievement. Research Focus His core interests include: Graph Theory : Modeling relational structures and network dynamics. Computational Complexity : Fundamental limits of algorithmic solvability. Temporal Graphs : Analyzing networks that evolve over time, with applications in transport, contagion spread, and data centers. Publication Trends Kutner's recent work demonstrates a strong emphasis on temporal graph algorithms (e.g., delay management in transport networks, contagion modeling) and network optimization (e.g., reconfigurable data center routing). His publications also explore algorithmic game theory in financial systems and accessibility technology. Awards Best Paper Award & Best Student Paper Award at ALGOWIN 2023 for Temporal Reachability Dominating Sets . Projects & Leadership EPSRC Project: "Multilayer Algorithmics to Leverage Graph Structure" (University of Glasgow, 2025). "Generating Socially Realistic Synthetic Networks" (Durham Sociology Department, 2024). Co-founded and presided over SIDur (SIAM-IMA Student Chapter), organizing academic events (2022-2024).

• Graph Theory
• Computational Complexity
• Temporal Graphs

Patrick Totzke is a Professor in the Department of Computer Science at the University of Liverpool’s School of Electrical Engineering, Electronics and Computer Science. As a leading researcher at the intersection of mathematics and computer science, he specializes in the foundations of formal verification, algorithmic game theory, and infinite-state systems. Education: While specific degrees are not listed, his expertise and role as Professor strongly suggest advanced graduate training in computer science and mathematics. Research Interests: Algorithmic game theory, particularly strategy complexity and games on infinite graphs Decidability and complexity of verification problems such as bisimulation, language inclusion, model checking, and synthesis Counter automata, vector addition systems, Petri nets, and process algebras Computational logics with fixed-points, temporal or probabilistic modalities, and associated games Real-time systems including timed automata, timed Petri nets, and timed games His recent focus centers on timed automata and stochastic games on graphs. Research Grants: Below the Branches of Universal Trees – EPSRC (March 2023 – August 2024) Unambiguity in Infinite-state Systems – Royal Society (March 2021 – March 2023) COSTRA: The Cost of Winning Strategies – EPSRC (July 2021 – September 2024) Teaching: Module Co-ordinator for COMP122 Object-Oriented Programming (2024–25). Labs & Teams: While no specific lab names are provided, his grants and publications indicate active leadership of research teams in formal methods and verification.

• Formal verification
• Algorithmic game theory
• Infinite-state systems
• +9 more

Christoph Haase is an Associate Professor at the University of Oxford's Department of Computer Science and a Tutorial Fellow at St Catherine's College. His research focuses on algorithmic verification, automated reasoning, and logic in computer science, with a particular emphasis on decision procedures for arithmetic theories. He leads the ARiAT ERC-funded project investigating arithmetic theories' decision procedures and serves as an Associate Editor for the Journal of Computer and System Sciences. Education: DPhil (PhD) in Computer Science, University of Oxford (2012) Diplom-Informatiker (BSc/MSc), Technische Universität Dresden (2007) Visiting Student, University of Bristol (2005–2006) Research Interests: Algorithmic Verification of Software/Hardware Systems Automated Reasoning Techniques Automata Theory and its Applications Formal Methods for Decision Procedures in Arithmetic Publications: His recent work spans Presburger arithmetic, vector addition systems, and automated deduction tools. Key trends include advancements in decision procedures, complexity analysis, and applications in formal verification. Awards: Recipient of the ERC Starting Grant (2019) and EPSRC Doctoral Prize. His student Ruiwen Dong earned the EATCS Distinguished Dissertation Award. Advising & Grants: Supervises DPhil students and postdocs in arithmetic theories and verification. Active in organizing workshops (e.g., Trends in Arithmetic Theories) and serves on program committees for major conferences like ICALP, FOSSACS, and STACS. Labs/Teams: Leads the Automated Verification Group at Oxford and collaborates with researchers globally on projects like ARiAT and tool development (e.g., SeLoger).

• Algorithmic Verification
• Automated Reasoning
• Automata Theory
• +4 more

Charlie Gilderdale is part of the Faculty of Mathematics at the University of Cambridge, where he serves as the NRICH Project Secondary Coordinator . He holds a Researcher role, focusing on mathematics education and curriculum development. Educated in Argentina and at the University of Cambridge, he transitioned from teaching (as a Mathematics teacher and Head of Mathematics at a Cambridgeshire secondary school) to academic roles in 1990. His work includes supporting trainee mathematics teachers in the Faculty of Education and contributing to the Millennium Mathematics Project. His research emphasizes problem-solving approaches and fostering learning through exploration and discussion. Key initiatives include the Enriching the Secondary Curriculum project. He is based at the University's Millennium Mathematics Project research group, reachable via email at cfg21@cam.ac.uk or telephone: 01223 764246.

• Mathematics Education
• Problem Solving
• Curriculum Development
• +3 more

Nick Biggs is an Associate Professor at the University of Reading's Department of Mathematics and Statistics, part of the School of Mathematical, Physical and Computational Sciences. He currently teaches courses including MA1CA Calculus, MA2MMS Mathematical Modelling & Professional Skills, MA4XA Fourth Year Project, and CS1MA Mathematics and Computation. His research focuses on linear wave theory, embedding methods for integral equations, and polynya modelling. He holds the role of Chair of SSPG and is reachable at Room 305 in the Mathematics building. Research interests include advanced mathematical methodologies applied to wave diffraction and scattering, alongside environmental modelling such as polynya systems. His academic contributions bridge theoretical and applied mathematics, with a focus on developing numerical techniques for complex physical phenomena.

• Linear wave theory
• Wave scattering problems
• Integral equations
• +3 more

Eike Neumann is a Lecturer in the Department of Computer Science at Swansea University. His research focuses on computable analysis, computational complexity, and reachability problems for dynamical systems. Research Interests: Neumann specializes in foundational aspects of computation applied to dynamical systems, with emphasis on complexity analysis and computability in mathematical contexts.

• Computable Analysis
• Computational Complexity
• Reachability Problems for Dynamical Systems

Professor Igor Potapov serves as a Professor of Computer Science at the University of Liverpool, leading the Algorithms, Complexity Theory and Optimisation research group and acting as Council Member for Networks Sciences & Technologies. He holds key administrative roles including Director of MSc Studies in CS with Year in Industry and module coordination for Efficient Sequential Algorithms (COMP309), MSc Industrial Project (COMP599), and MSc Placement Experience (COMP598). His research centers on theoretical computer science with emphasis on reachability problems in infinite state systems , distributed computing and pattern formation , combinatorial optimisation , and decidability questions for mathematical structures. Current interdisciplinary work includes Algorithmic Crystal Structure Prediction for Material Design (Royal Society APEX Award 2024-2026) and foundational studies in automata-matrix theory connections. His methodological approach integrates abstract algebra, topology, and computation theory to analyze computational boundaries. Recent publications (2024-2025) demonstrate strong convergence between theoretical frameworks and practical applications, particularly in robotics scheduling (addressing collision avoidance and safety verification) and mathematical decidability (matrix semigroups, linear recurrence systems). These works bridge computational geometry with distributed algorithm design, revealing novel complexity boundaries in reachability analysis. His scientific recognition includes: Royal Society Apex Award (2024-2026) for Algorithmic Crystal Structure Prediction Royal Society Leverhulme Trust Senior Research Fellowship (2020-2021) for "Cornerstones of Reachability" As an active grant recipient, he manages multiple projects including Algorithmic Intelligence for Life, Society and Science (Royal Society 2024-2026) and UoL-SumDU Collaboration for Digitalisation of Ukraine (Research England 2023-2024). He supervises thesis work on crystal structure prediction and distributed shape formation while serving on examination committees for Oxford, Leicester, and Gran Sasso institutions. He co-leads the Science for Ukraine initiative's UK branch, developing academic mentoring programs and research twinning partnerships between UK and Ukrainian universities. His editorial work spans Fundamenta Informaticae (2020-present) and Lecture Notes in Computer Science (2009-2013), alongside conference organization for the Reachability Problems series.

• Theoretical Computer Science
• Discrete Mathematics
• Reachability Problems
• +3 more