Find Academic Supervisors

Mark Steedman is a Professor in the School of Informatics at the University of Edinburgh, where he conducts research in Artificial Intelligence, Computational Cognitive and Social Science, and Natural Language and Speech Processing. He is affiliated with the Institute for Language, Cognition and Computation (ILCC), the Centre for Speech Technology Research (CSTR), and the Human Communications Research Center (HCRC). He also holds an adjunct professorship in Computer and Information Science at the University of Pennsylvania. His research focuses on Combinatory Categorial Grammar (CCG) , computational linguistics , prosody and intonation , temporal semantics , gesture in communication , and computational music analysis . He has authored foundational books including Surface Structure and Interpretation , The Syntactic Process , and Taking Scope . The recent publications reflect a strong trend toward integrating formal grammatical frameworks like CCG with modern neural and distributional models, particularly in semantic parsing, entailment reasoning, and cognitive modeling. His work bridges symbolic and statistical approaches in NLP, often focusing on robust, wide-coverage parsing and semantic interpretation. Best Paper Award at AACL/IJCNLP 2023 for 'Smoothing Entailment Graphs with Language Models' Best Paper Award at ACL 2023 for 'Extrinsic Evaluation of Machine Translation Metrics' Influential Paper Award 2017 from IFAAMAS for 'Animated Conversation' Mark Steedman has supervised numerous PhD students and collaborated widely across institutions. He leads research in formal grammar applications to cognitive modeling, dialogue, and multimodal communication. His lab contributes to CCG software and semantic parsing tools, and he continues to be actively involved in advancing the integration of symbolic and neural AI.

• Artificial Intelligence
• Computational Cognitive Science
• Natural Language Processing
• +9 more

Dr. Tingkai Wang is a Senior Lecturer in the School of Computing and Digital Media at London Metropolitan University. His research focuses on mobile robots, intelligent systems, artificial intelligence, control systems, image/signal processing, and virtual reality. He teaches the Programming for Computer Science module and has led projects like the Virtual Environment and Simulation System (2000-2002) and Navigation and Control of Mobile Robots (1995-1998). His work emphasizes interdisciplinary approaches, combining expert systems, neural networks, and fuzzy logic to address challenges in autonomous systems. Notable contributions include AGV navigation algorithms, hybrid control systems, and predictive modeling. Over 30 publications span robotics, control engineering, and AI applications. He collaborates internationally and has presented at venues like the International Conference on Intelligent Systems Engineering and the IEEE Conference on Engineering in Medicine and Biology. Dr. Wang’s expertise bridges theoretical modeling and practical implementation, with applications in manufacturing automation, environmental monitoring, and industrial management systems. His current research continues exploring adaptive control mechanisms and AI-driven robotics solutions.

• Mobile Robots
• Intelligent Systems
• Artificial Intelligence (AI)
• +5 more

Marcelo Fiore is a Professor in Mathematical Foundations of Computer Science at the Department of Computer Science and Technology, University of Cambridge, and a Fellow of Christ's College. His research spans category theory, lambda calculus, equational logic, type theory, and mathematical structures in computer science. University: University of Cambridge Department: Department of Computer Science and Technology Academic Rank: Professor College Affiliation: Christ's College Fiore's work focuses on the intersection of category theory and computer science, particularly in abstract syntax, denotational semantics, and algebraic structures. Recent publications explore combinatorial models, normalization by evaluation, and homotopy type theory applications. 2025: Creation/annihilation operators in mathematical structures 2024: Lawvere theories in toposes and differential linear logic 2023: Homotopy type theory and normalization frameworks 2022: Second-order abstract syntax formalization and quotient types Fiore has advised PhD students including N. Arkor (2022) and O.M. Elsayed (2011), who researched monadic structures and second-order algebraic theories respectively. He contributes to departmental initiatives such as the Accelerate Programme for Scientific Discovery and Data Trusts Initiative at Cambridge.

• Category Theory
• Lambda Calculus
• Equational Logic
• +5 more

Professor Sara Bernardini is a leading academic in Artificial Intelligence at the University of Oxford's Department of Computer Science, where she holds a joint appointment as a Tutorial Fellow at Mansfield College. Her research specializes in decision-making for autonomous systems, automated planning, and robotics, with applications in extreme environments like space missions, nuclear decommissioning, and offshore energy. She bridges theoretical AI with real-world challenges through projects funded by Innovate UK, EPSRC, NERC, and the Alan Turing Institute. Her research interests span: Autonomous Systems : Developing agents that support humans in complex cognitive tasks. Automated Planning : Algorithms for goal recognition, pathfinding, and multi-agent coordination. Robotics : Solutions for subterranean exploration, offshore wind farms, and UAV operations. AI Safety : Risk-aware autonomous systems and interpretable decision-making. Bernardini's publications emphasize algorithmic robustness in path planning, multi-agent coordination , and real-world AI deployments . Recent work explores goal legibility in uncertain environments, energy-efficient robotics, and AI education tools. Her 65+ papers in top venues (e.g., AIJ, JAIR, ICAPS) show a trend toward safety-critical applications and human-AI collaboration. Awards & Leadership: ICAPS-2020 Best Paper Honorable Mention Executive Council Member, Association for the Advancement of Artificial Intelligence (AAAI) Program Chair, International Conference on Automated Planning and Scheduling (ICAPS 2024) Associate Editor, Artificial Intelligence Journal She leads interdisciplinary teams for projects like autonomous offshore wind farm maintenance and modular robots for extreme environments. As Principal Scientist at the UK National Oceanography Centre, she advanced marine robotics. She mentors PhD candidates and collaborates globally (e.g., NASA Ames, MIT).

• Artificial Intelligence
• Automated Planning
• Robotics
• +4 more

Dr. Rolf Suabedissen serves as an Affiliate Faculty member and Stipendiary Lecturer in Pure Mathematics at Lady Margaret Hall, University of Oxford. His work is centered in the Mathematical Logic research group, and he can be reached via phone at +44 1865 274372 or through a contact form. The provided text does not include an email address. With a PhD and BA, Dr. Suabedissen's research spans Topology, Mathematical Logic, and Set Theory. His work particularly addresses reconstruction conjectures, properties of continua, compact metrizable spaces, and homogeneity in 2-point sets. He has published in reputable journals such as the Proceedings of the American Mathematical Society and Colloquium Mathematicum. Analysis of his recent publications (2013-2017) reveals a strong emphasis on topological reconstruction across various structures including graphs, continua, and compact spaces. His contributions also extend to set-theoretic topology, as seen in studies of compactifications involving ω* and Sκ, and generalizations of 2-point sets. No scientific awards were mentioned for Dr. Suabedissen in the available information. Details regarding students advised or grants received by Dr. Suabedissen are not provided in the text. Dr. Suabedissen is an active member of the Mathematical Logic research group at the University of Oxford, contributing to the department's scholarly activities in pure mathematics.

• Topology
• Mathematical Logic
• Set Theory
• +3 more

Mark Kambites is a Professor of Pure Mathematics at the University of Manchester , affiliated with the Department of Mathematics. His research focuses on semigroup theory, tropical algebra, geometric group theory, and formal languages. He holds roles including membership in the EPSRC Strategic Advisory Team (SAT) and editorial positions in journals like the International Journal of Algebra and Computation. Education: M.Math. Mathematics and Computer Science, University of York (2000) Ph.D. Pure Mathematics, University of York (2003) Research Interests: Kambites explores semigroup structures, tropical algebra's applications, and interactions between algebra and geometry. Key areas include matrix semigroups over tropical semifields, combinatorial group theory, and computational complexity. His work bridges pure mathematics and theoretical computer science. Grants and Collaborations: Leads the Centre for Digital Trust and Society (EPSRC-funded) and collaborates internationally. Serves as central organizer of the North British Semigroups and Applications Network (NBSAN). Affiliations: Active in the Algebra Group, Tropical Mathematics Group, and Data Science Institute at Manchester. Supervises PhD/MSc students in algebraic and computational mathematics.

• Semigroup Theory
• Tropical Algebra
• Geometric Group Theory
• +5 more

Standa Živný is a Professor of Computer Science at the University of Oxford and a Fellow and Tutor at Merton College. He has been a faculty member at Oxford since 2013 and was promoted to full professor in 2021. His research spans theoretical computer science and discrete mathematics, with a focus on algorithms, computational complexity, and constraint satisfaction problems (CSPs) in various forms, including optimisation, counting, and approximation. His research interests include the power and limitations of convex relaxations, sparsification, submodularity, and the algebraic and logical foundations of tractability in combinatorial problems. He has made significant contributions to understanding when and why certain problems can or cannot be efficiently solved using linear programming and other algorithmic paradigms. The recent trends in his publications show a deep engagement with approximation algorithms, hardness results, sparsification techniques, and the complexity of counting and promise problems. His work often lies at the intersection of algebra, logic, and optimisation, demonstrating the power of interdisciplinary approaches in theoretical computer science. ERC Consolidator Grant (NAASP, 2022–2027) ERC Starting Grant (PowAlgDO, 2017–2022) Royal Society University Research Fellowship (2013–2021) He actively supervises a large cohort of postdoctoral researchers and students, including PhD candidates, master’s, and undergraduate students. His leadership extends to academic service, where he serves as Editor-in-Chief of the SIAM Journal on Discrete Mathematics and holds editorial and committee positions in major journals and funding bodies. He has organised numerous workshops and research programmes at institutions such as Dagstuhl, the Isaac Newton Institute, and AIM. He is involved in major research initiatives, including a Simons Programme on symmetry in computation and an American Institute of Mathematics SQuARE on relaxations for promise CSPs.

• Theoretical Computer Science
• Discrete Mathematics
• Algorithms
• +10 more

David M Evans holds the position of Chair in Pure Mathematics at the Department of Mathematics, Faculty of Natural Sciences, Imperial College London. His academic career spans several decades with continuous research contributions in mathematical logic and its interdisciplinary applications. Professor Evans' research focuses on the theoretical foundations and practical applications of Model Theory, with particular emphasis on: Stability theory and its generalizations within model-theoretic frameworks Hrushovski constructions and their geometric properties Interactions between model theory, algebra, and combinatorics Automorphism groups of infinite structures Ramsey properties in sparse graphs and metric spaces His publication record demonstrates consistent innovation in geometric model theory, with recent work exploring amalgamation properties in measured structures, simplicity of automorphism groups, and EPPA (Extension Property for Partial Automorphisms) in various mathematical structures. His research bridges abstract model-theoretic concepts with concrete combinatorial and algebraic applications, particularly in the study of homogeneous structures and their automorphism groups. Professor Evans has supervised numerous doctoral students including D. G. D. Gray, Reinhold Konnerth, Herwig Nuebling, Marco Antonio Semana Ferreira, Yibei Li, and Robert Sullivan. His research has been supported by grants such as 'Model theory of generic structures and simple theories' and the 'Workshop on Pure Model Theory,' reflecting the significance of his contributions to the field.

• Model Theory
• Mathematical Logic
• Algebra
• +4 more

Dr. Julian Sahasrabudhe is a researcher at the Department of Pure Mathematics and Mathematical Statistics (DPMMS) , University of Cambridge, affiliated with the School of Mathematics . His work focuses on combinatorics, number theory, and graph theory, with a emphasis on extremal problems and probabilistic methods. His recent research explores Erdős covering systems, Littlewood polynomials, and monochromatic subgraphs. Publications from 2018–2024 highlight applications of probability generating functions, arithmetic progressions, and density analysis in combinatorial structures. Contact details: jdrs2@cam.ac.uk , Room C2.08, Tel: 01223 337974. Personal homepage .

• Combinatorics
• Number Theory
• Graph Theory
• +6 more

Professor Martin Hyland is a Professor of Mathematical Logic in the Department of Pure Mathematics and Mathematical Statistics within the Faculty of Mathematics at the University of Cambridge. His work bridges mathematical logic, category theory, and theoretical computer science, with significant contributions to lambda calculus, realizability, and game semantics. Professor Hyland's research spans three interconnected domains: Mathematical Logic (focusing on Lambda Calculus, Recursion Theory, Realizability, Proof Theory, and Linear Logic), Category Theory (specializing in Topos Theory, Categorical Algebra, Operads, and Higher-dimensional Categories), and Theoretical Computer Science (exploring Applications of Category Theory, Domain Theory, Polymorphism, and Game Semantics). His work demonstrates how abstract mathematical structures can illuminate computational phenomena. His recent publications reveal a continued focus on categorical structures for computation, with increasing attention to higher-dimensional categorical frameworks. His work connects foundational logic with practical computational models, showing how category theory provides unifying principles across diverse computational paradigms. The progression from lambda calculus to game semantics to higher categorical structures demonstrates deepening connections between abstract mathematics and computation. Professor Hyland has made foundational contributions to game semantics, categorical models of lambda calculus, and the categorical understanding of algebraic theories. His work on computational effects, particularly in papers like 'Combining algebraic effects with continuations' and 'Combining computational effects: Commutativity and sum,' has influenced both theoretical computer science and practical programming language design.

• Mathematical Logic
• Lambda Calculus
• Recursion Theory
• +13 more

Laura Ciobanu Radomirovic is a Professor in the Department of Mathematics at Heriot-Watt University's School of Mathematical and Computer Sciences, where she serves as Co-Director of the Maxwell Institute for Mathematical Sciences. Her research profile shows active engagement in both theoretical and computational aspects of mathematics with significant contributions to group theory and related fields. Her educational background includes: Bachelor's degree in Mathematics with minor in Computer Science from Franklin & Marshall College, Lancaster PA (1999) Third year studies at ETH Zürich, Switzerland PhD in Mathematics from Rutgers University, NJ (January 2005) Professor Ciobanu Radomirovic specializes in combinatorial, geometric and algorithmic group theory, with strong connections to combinatorics and theoretical computer science. Her work bridges abstract mathematical concepts with computational applications, particularly focusing on equation solving in groups, growth functions, and the interplay between language theory and algebraic structures. She maintains active research collaborations across multiple countries, as evidenced by her international network of co-authors and research partners. Analysis of her recent publications (2023-2025) reveals a consistent focus on group equations, growth phenomena in various algebraic structures, and the application of computational methods to solve theoretical problems. Her work shows increasing sophistication in handling virtually abelian groups, dihedral Artin groups, and the connections between formal languages and group-theoretic properties. The interdisciplinary nature of her research is evident in the blend of pure mathematics, computational approaches, and theoretical computer science concepts. Her notable scientific achievements include: Swiss National Science Foundation professorship Ambizione fellowship at the University of Neuchâtel Fellowship at the Hausdorff Institute of Mathematics in Bonn Professor Ciobanu Radomirovic serves as Principal Investigator for an EPSRC Standard Grant (2018-2021) and actively mentors PhD students. Her professional service includes editorial work for the Proceedings of the Edinburgh Mathematical Society (2018-2025) and committee membership with the London Mathematical Society (2023-2027). She regularly presents her research through invited talks and conference contributions, maintaining an active presence in the international mathematical community. As Co-Director of the Maxwell Institute, she plays a key leadership role in one of the UK's prominent mathematical research centers, fostering collaboration between pure and applied mathematicians across Heriot-Watt University and the University of Edinburgh.

• Combinatorial group theory
• Geometric group theory
• Algorithmic group theory
• +3 more

Professor Boris Konev is a faculty member at the University of Liverpool, affiliated with the School of Electrical Engineering, Electronics and Computer Science. He holds the academic rank of Professor in Computer Science. Description Logics Ontologies Automated Reasoning Temporal Logic Formal Verification Encrypted Database Applications His recent research focuses on temporal queries mediated by ontologies, knowledge evaluation agents using large language models, and semantic modularity in description logics. Key sub-fields include LLM applications, encrypted databases, and formal verification techniques. He has contributed to software development projects and industry partnerships, including design of equine simulators and online services with Racewood Limited. Current teaching includes the Foundations of Computer Science module (COMP109). Professional roles include guest editorships for AI Communications and program committee membership for the European Conference on Logics for Artificial Intelligence (JELIA).

• Description Logics
• Ontologies
• Automated Reasoning
• +7 more

Andrei Krokhin is a Professor in the Department of Computer Science at Durham University, UK. His academic roles include being a member of the Algorithms and Complexity Research Group. He holds a PhD in Mathematics from Ural State University (Russia) and has held positions at Warwick University and Oxford University. His research focuses on computational complexity, constraint satisfaction problems (CSP), universal algebra, and combinatorics. Education: PhD in Mathematics, Ural State University, 1990s Research Interests: Professor Krokhin investigates the mathematical and algorithmic foundations of CSP, emphasizing complexity classification and approximation. His work bridges universal algebra, logic, combinatorics, and graph theory. Key themes include algebraic approaches to CSP, constraint optimization, and the interplay between computational complexity and structural mathematics. Awards: EPSRC Advanced Research Fellowship (2006) Principal organizer of the 2006 Oxford Workshop on Mathematics of Constraint Satisfaction Invited plenary speaker at ISMVL 2003 (Tokyo) Invited lectures at NATO ASI Summer School (2003) Advising & Grants: Supervises PhD students (e.g., Yiming Qiu) and leads EPSRC-funded projects like 'Promise Constraint Satisfaction Problems: Structure and Complexity.' He recruits students for research on CSP complexity and approximation. Labs/Teams: Member of the Algorithms and Complexity Research Group at Durham University, collaborating internationally on CSP theory and applications.

• Computational Complexity
• Constraint Satisfaction Problems
• Universal Algebra
• +4 more

Willem Heijltjes is a Senior Lecturer in the Department of Computer Science at the University of Bath. His research focuses on logic and proof theory, particularly on canonical graphical representations of proofs (proof nets) and their applications in lambda-calculus and type systems. He is actively involved in theoretical computer science, exploring foundational aspects of programming languages and computational logic. He leads the project 'Typed Lambda-Calculi with Sharing and Unsharing', funded by the Engineering and Physical Sciences Research Council (EPSRC) from 2019 to 2022. This project investigates advanced type systems and computational models, contributing to the understanding of call-by-value and call-by-name evaluation strategies in the context of linear logic and sequent calculus. His research interests span lambda-calculus, linear logic, proof nets, type systems, and programming language semantics. He has published extensively in top-tier conferences such as CSL, FSCD, and LICS, addressing topics like probabilistic termination, functional machine calculus, and normalization without syntax. He is currently accepting doctoral students in these areas. Heijltjes collaborates internationally on foundational computer science topics, including the development of combinatorial proofs and the exploration of confluence in higher-order rewriting systems.

• Logic
• Proof Theory
• Lambda-Calculus
• +3 more

Dr Alexei Lisitsa is a Senior Lecturer at the University of Liverpool specializing in theoretical computer science and mathematical structures. His work bridges automated reasoning, machine learning, and topological mathematics with applications in cybersecurity and network analysis. Active since at least 2008, he maintains a robust research profile with recent publications through 2025. His research focuses on computationally intensive problems in algebraic topology and formal methods. Key contributions include developing machine learning techniques for braid invariants, automating group theory proofs, and creating knot diagram analysis frameworks. This work consistently integrates experimental mathematics with computational verification, demonstrating innovative cross-disciplinary approaches to complex topological challenges. Analysis of his 2023-2025 publications reveals accelerating integration of neural networks with symbolic reasoning systems. His team pioneers applications of deep learning to traditionally intractable problems in braid theory and group presentations, while maintaining strong foundations in formal verification methods for temporal logic systems. Dr Lisitsa actively secures competitive research funding: Flexible Querying of Encrypted Graph Databases (Innovate UK, 2020) KTP with ValueChain Enterprise Systems (Innovate UK & VALUECHAIN, 2018-2022) Future AI and Robotics for Hub Space (FAIR-SPACE) (EPSRC, 2017-2021) Machine Learning for recognising tangled 3D objects (Leverhulme Trust, 2020-2023) Engineering Autonomous Space Software (EPSRC, 2008-2012) Discrete analogues of dynamical systems (NATO, 2008-2010) He supervises postgraduate research in network security and movement pattern analysis, with thesis topics including temporal logic-based intrusion detection systems and large-scale network prediction methodologies.

• Automated Reasoning
• Machine Learning
• Knot Theory
• +3 more