جستجوی استاد راهنمای دانشگاهی

Leslie Ann Goldbergمشاهده پروفایل

استاد

• Algorithms
• Complexity Theory
• Randomised Algorithms
• +۵ مورد دیگر

Leslie Ann Goldberg is a Senior Research Fellow at St Edmund Hall and Professor of Computer Science at the University of Oxford. She currently serves as Head of the Department of Computer Science (on sabbatical 2025-26) and focuses on foundational problems in Algorithms and Complexity Theory , particularly randomised algorithms for network communication, machine learning, and statistical physics models. Her research includes solving Aldous' 1987 conjecture on backoff protocol instability (with John Lapinskas), developing rigorous mathematical analysis frameworks for algorithmic efficiency, and advancing approximate counting techniques via Markov Chain Monte Carlo methods (with Andreas Galanis and collaborators). Key projects involve graph homomorphisms , Moran process dynamics , and #BIS complexity class analysis. Recent publications (2023-2024) span topics like Sybil defense mechanisms, low-temperature sampling on random graphs, and parameterised subgraph counting modulo 2. Her work demonstrates cross-disciplinary impact in computational biology, statistical physics, and database theory. Scientific Awards include Best Paper Prizes at ICALP 2016, ICALP 2010, and IPEC 2017. She supervises PhD student Paulina Smolarova and collaborates extensively with researchers in Oxford and beyond.

• Finite Model Theory
• Graph Structure Theory
• Computational Complexity
• +۳ مورد دیگر

Kord Eickmeyer is a Lecturer at Technische Universität Darmstadt in the Department of Mathematics, specializing in the mathematical logic group. He holds a PhD in mathematics from Humboldt University Berlin and has held postdoctoral positions at TU Darmstadt (2011–2017) and the National Institute of Informatics in Tokyo (2011–2013). His research focuses on finite model theory, graph structure theory, and computational complexity, particularly in descriptive and parameterized complexity, as well as randomization and derandomization techniques. Research interests include exploring the boundaries of computational complexity through logical frameworks, analyzing graph structures for efficient algorithm design, and investigating the role of randomness in computation. His work bridges theoretical computer science and mathematical logic, with applications in algorithm design and formal methods. Publications span topics from model-checking on ordered structures to gap-planar graphs and randomized logics. Collaborations include prominent institutions like the National Institute of Informatics and Humboldt University Berlin. No scientific awards are explicitly listed, but his extensive academic contributions reflect a strong research trajectory. Advising and grants are not detailed in the provided text, though his academic career includes supervision roles during his PhD and postdoctoral phases. His involvement with the mathematical logic group at TU Darmstadt highlights collaborative research efforts in foundational areas of computer science and mathematics.

Elena Troubitsynaمشاهده پروفایل

استاد

• Autonomous Systems
• Software Engineering
• Formal Verification
• +۳ مورد دیگر

Elena Troubitsyna is a Professor of Computer Science with specialization in Software Engineering at KTH Royal Institute of Technology. Her research focuses on developing dependable, autonomous systems that ensure safety and reliability, particularly in complex environments like self-driving cars and drones. She employs rigorous mathematical modeling and verification techniques to address system complexity and real-time adaptability challenges. Her work emphasizes the co-engineering of safety and security in cyber-physical systems, integrating formal methods such as Event-B modeling with AI-driven solutions. Key research areas include cybersecurity for embedded systems, formal analysis of safety-security interactions, and resilient multi-agent systems. Elena has contributed to advancing methods for autonomous system navigation, fault tolerance, and privacy-preserving microservices architectures. Elena has organized international workshops like SENSEI (Safety-Security Interaction) and published extensively on topics such as model-driven engineering, formal verification of critical systems, and optimizing scheduling for distributed computing. Her research bridges theoretical foundations with practical applications, aiming to enhance societal trust in autonomous technologies.

Nathanaël Fijalkowمشاهده پروفایل

پژوهشگر

• Games
• Machine Learning
• Automata Theory
• +۹ مورد دیگر

Nathanaël Fijalkow is a Researcher at CNRS in LaBRI (Bordeaux) and a Research Fellow at The Alan Turing Institute in London. His primary research fields include games , machine learning , automata theory , and dynamical systems , with a focus on synthesizing programs from logical specifications and probabilistic models. Research Interests span program synthesis (programming by example), controller synthesis (temporal logic specifications), games on graphs (parity/mean payoff games), probabilistic automata (bounded ambiguity), and invariants for linear dynamical systems. He bridges formal methods with machine learning through projects like DeepSynth . Scientific Contributions include: Undecidability results for probabilistic automata Advances in parity game algorithms (quasi-polynomial lower bounds) Foundations of probabilistic modal logics Efficient synthesis techniques using SMT solvers and distributional learning Supervision involves guiding postdocs and PhD students such as Guillaume Lagarde, Antonio Casares, and Pierre Ohlmann. He has secured grants like the Momentum DeepSynth project (2019-2021) , aiming to merge formal methods with ML for program synthesis.

• Artificial Intelligence
• Constraint Programming
• Operations Research
• +۳ مورد دیگر

Barry O'Sullivan is a Professor at the School of Computer Science & IT, University College Cork, where he serves as Founding Director of the Insight Centre for Data Analytics, Principal Investigator at the Confirm Centre for Smart Manufacturing, and Director of the Science Foundation Ireland Centre for Research Training in Artificial Intelligence. He additionally holds an Adjunct Professorship at Monash University and maintains leadership roles including Past President of the European Artificial Intelligence Association and former vice chair of the European Commission High-Level Expert Group on AI. His research spans artificial intelligence with emphases on constraint programming, operations research, AI ethics, public policy frameworks for AI systems, and data analytics methodologies. Notable contributions include foundational work in parameterised complexity theory published in the Journal of the ACM, recognized by the 2020 IPEC-EATCS Nerode Prize. Professor O'Sullivan's distinguished honors include: UCC Leadership Award (2013) ACP Distinguished Service Award (2014) Science Foundation Ireland Researcher of the Year (2016) UCC Researcher of the Year (2017) Elected member of the Royal Irish Academy (2017) Fellow of the Irish Computer Society (2018) Fellow of the Irish Academy of Engineering (2019) IPEC-EATCS Nerode Prize (2020) He directs major national research infrastructure including the Insight Centre for Data Analytics, Confirm Centre for Smart Manufacturing, and SFI Centre for Research Training in AI, driving Ireland's strategic initiatives in artificial intelligence and data-driven innovation through cross-institutional collaborations with industry partners across Europe.

Justin Pearsonمشاهده پروفایل

دانشیار

• Constraint Programming
• Combinatorial Optimisation
• Artificial Intelligence
• +۷ مورد دیگر

Justin Pearson is an Associate Professor at the Department of Information Technology; Division of Computing Science at Uppsala University . He is a member of the university's optimisation group and coordinates the IT department's mentor programme for new employees . Research Interests include Constraint Programming , Combinatorial Optimisation , Artificial Intelligence , Software Testing , and Complexity Theory . His work focuses on theoretical and practical aspects of constraint satisfaction, local search algorithms, and symmetry breaking in constraint programming. Teaching involves courses such as Algorithms and Data Structures II (1DL231) and Introduction to Machine Learning for Bachelor Students (1DL034), with a PhD-level course on Category Theory offered periodically based on demand. Scientific Contributions span publications in constraint programming for air traffic management, sensor networks, and industrial applications. Recent work includes parameterised treewidth in constraint models, time-series constraints, and symmetry breaking techniques. Students supervised include PhD candidates Frej Knutar Lewander (co-supervised with Pierre Flener), Yi Zhao (co-supervised with Di Yuan), and previously graduated students Gustav Björdal , María Andreína Francisco Rodríguez , and Joseph Scott .

• Safe AI
• Formal Methods
• Reinforcement Learning
• +۵ مورد دیگر

Francesco Belardinelli is a Senior Lecturer in the Department of Computing at Imperial College London, part of the Faculty of Engineering. He co-directs the UKRI Centre for Doctoral Training (CDT) in Safe and Trusted AI and leads the EPSRC-funded project 'An Abstraction-based Technique for Safe Reinforcement Learning'. His research focuses on Safe AI, formal methods, and strategic reasoning in multi-agent systems under imperfect information. He holds a PhD and undergraduate degrees from Scuola Normale Superiore, Italy. Belardinelli's work bridges formal verification techniques with AI systems, particularly in ensuring safety in reinforcement learning and multi-agent dynamics. He has secured grants including EPSRC NIA, ANR projects (e.g., AGAPE, SVeDaS), and Marie Curie Fellowships. He supervises multiple PhD and postdoctoral researchers in areas like safe RL, formal methods, and multi-agent systems. His educational contributions include courses on logical aspects of AI and scientific research methodologies. He organizes events like the FMAI Seminar series and chairs international conferences (e.g., AAMAS 2021 workshop). His outreach activities include invited talks on topics like safety-aware RL and epistemic logic.

Daniel J Pooleمشاهده پروفایل

مدرس ارشد

• Multidisciplinary Optimisation
• Wind Energy
• Global Optimisation
• +۶ مورد دیگر

Dr Daniel J Poole is a Senior Lecturer in the School of Civil, Aerospace and Design Engineering at the University of Bristol , UK. His research focuses on computational fluid dynamics (CFD), multidisciplinary optimisation, and renewable energy systems, particularly in wind farm control and aerospace design.

Ljiljana Brankovicمشاهده پروفایل

استاد

• Cybersecurity and Privacy
• Algorithms
• Graph Theory
• +۱ مورد دیگر

Dr. Ljiljana Brankovic is a Professor in Computational Science at the School of Science and Technology, University of New England (UNE). She holds a PhD in Computer Science from the University of Newcastle (1998) and a Graduate Electrical Engineer degree from the University of Belgrade (1987). Her research spans cybersecurity and privacy , algorithms , graph theory , and privacy-preserving machine learning , with significant funding from the Australian Research Council, German Research Foundation, London Mathematical Society, and Royal Society, UK. Education : PhD (Computer Science), University of Newcastle (1998); Graduate Electrical Engineer, University of Belgrade (1987). Her work on privacy integrates technological , ethical , legal , and psychological aspects . In algorithms, she focuses on parameterized approximation algorithms for NP-hard problems. Google Scholar articles (2025–2017) reflect her expertise in combinatorial algorithms , graph theory , privacy-preserving techniques , and machine learning applications in domains like healthcare , explosion prediction , and botanical identification . 2025 : Diverging Assessment: A Student Perspective; Advancements in Medicinal Plant Identification Using Deep Learning. 2024 : Diverging assessments: what, why, and experiences; Incremental and Zero-Shot Machine Learning for Vietnamese Medicinal Plant Classification. 2023–2017 : Domination chain complexity, ambient intelligence for health, upper domination facets, face-antimagic graphs. While no explicit awards are listed, her research funding and editorial roles (e.g., special issues on combinatorial algorithms and privacy) underscore her contributions. She has also co-authored works on statistical database security , mobile agent security , and network privacy , with over 150 publications in theoretical and applied domains.

• Programming Languages
• Parametricity Theory
• Type Systems
• +۶ مورد دیگر

Robert Atkey is a Chancellor’s Fellow and Lecturer in the Department of Computer and Information Sciences at the University of Strathclyde, where he is part of the Mathematically Structured Programming (MSP) group. His research focuses on programming language design and analysis, leveraging mathematical frameworks like category theory, type theory, and denotational semantics. He has contributed to parametricity theory, effect systems, and resource-aware verification systems such as ThreadSafe for Java concurrency. Key research areas include: Parametricity in higher-kinded and dependent type systems Applications of parametricity in DSL representation and scientific programming Development of parameterised monads for effect tracking Formal verification techniques for resource usage and concurrency defects Professional activities include programme committee roles for ESOP 2017 and POPL 2016, co-chairing the 2016 Mathematically Structured Functional Programming workshop, and organizing the Scottish Programming Languages and Verification Summer School 2024. His work bridges academic research with industrial applications, exemplified by the ThreadSafe static analysis tool developed at Contemplate. Current projects include ElePQuant (quantitative predicate logic foundations) and AISEC (AI security through construction). He collaborates on interdisciplinary initiatives like the DTP 2224 research consortium.

Arne Meierمشاهده پروفایل

استاد

• Complexity Theory
• Parameterised Complexity Theory
• Logic in Computer Science
• +۳ مورد دیگر

Arne Meier is a Professor at Leibniz Universität Hannover, affiliated with the Faculty of Electrical Engineering and Computer Science and the Institute of Theoretical Computer Science. He heads the Algorithms research group, focusing on theoretical aspects of computer science with applications to artificial intelligence and database systems. Meier obtained all his academic degrees—Bachelor's, Master's, PhD, and Habilitation—at Leibniz Universität Hannover, establishing a strong foundation in theoretical computer science. His academic journey at the same institution reflects his deep commitment to advancing research in computational theory. Meier's research spans several interconnected areas in theoretical computer science. His primary focus is on complexity theory, particularly the parameterized complexity of problems in non-classical logics with applications to AI. He also investigates enumeration algorithms and the logical foundations of artificial intelligence. His work bridges theoretical computer science with practical applications in knowledge representation and reasoning systems. He has a notable interest in LaTeX and typography, having developed the 'timeline' package for creating timelines in LaTeX documents. His recent publications (2023-2025) demonstrate a consistent focus on the intersection of logic, complexity, and artificial intelligence. Meier's work shows progression from foundational research in dependence and team logics toward more applied areas in argumentation theory and database systems. His research increasingly addresses computational challenges in AI systems, particularly in reasoning under uncertainty and handling inconsistent information. Meier actively contributes to the academic community through extensive program committee service for major conferences including AAAI (2021, 2023, 2024, 2025), IJCAI (2021-2025), and FoIKS (2024 as Co-Chair, 2026). He has also served as a reviewer for numerous conferences and journals in theoretical computer science and artificial intelligence. His current research projects include the DAAD-funded 'Applications and Complexity of Logics in Semiring-Team-Semantics' (2024-2025) and the DFG project 'Team Logics: New Bridges to Database Repairs' (2023-2026). Previously, he led the DFG project 'Nonclassical logics: parametrised and enumeration complexity' (2013-2022) and the MWK project 'Innovation Plus: Komplexität von Algorithmen' (2020-2022). Meier leads the Algorithms research group at Leibniz Universität Hannover, which focuses on theoretical aspects of algorithms with applications to logic and artificial intelligence. The group's work spans complexity theory, logical formalisms, and their applications to computational problems in knowledge representation and database systems.

• Programming Languages
• Type Systems
• Parametricity
• +۴ مورد دیگر

Bob Atkey is a Senior Lecturer and Chancellor’s Fellow in the Department of Computer and Information Sciences at the University of Strathclyde. He is an active member of the Mathematically Structured Programming (MSP) group and currently accepts PhD students. His academic service includes serving on programme committees for POPL 2016 and ESOP 2017. His primary research areas include Programming Languages, Type Theory, Parametricity, Effect Systems, Formal Verification, Category Theory, and Logic. He has made significant contributions to the theory of parametricity, extending it to higher-kinded and dependent type systems, and applying it to syntax representation, domain-specific languages, and scientific programming. Additionally, he has developed resource-aware type systems and advanced effect systems through parameterised monads. Recent publications demonstrate a focus on foundational proof theory and the integration of complexity analysis with type systems, highlighting his commitment to bridging theoretical concepts with practical programming language design. His notable recognition includes: Chancellor’s Fellowship Bob Atkey has supervised at least one PhD student and leads or co-leads several research projects, including the ARIA-funded "Quantitative Predicate Logic as a Foundation for Verified ML" and an EPSRC DTP project on Interaction Order. His past industry collaboration at Contemplate resulted in the development of ThreadSafe, a tool for concurrency analysis in Java. He is an active member of the Mathematically Structured Programming group and co-organized the 2024 Scottish Programming Languages and Verification Summer School, fostering community and education in his field.

• Robotics
• Control Systems
• Motion Planning
• +۳ مورد دیگر

Dr Damian Abood is a Robotics Researcher affiliated with The University of Sydney's School of Aerospace, Mechanical and Mechatronic Engineering. He is associated with the Australian Centre for Robotics and ARIAM Hub, focusing on advanced robotics and control systems research. His recent work emphasizes motion planning for underactuated systems, leveraging path parameterization techniques. Though his full academic profile is temporarily unavailable, his research contributions indicate specialization in autonomous systems and nonlinear control. Affiliations: Australian Centre for Robotics, ARIAM Hub Research interests span robotics, control systems, and motion planning, with a focus on underactuated systems. His 2024 publications demonstrate expertise in path parameterization and RRT-based algorithms for complex robotic systems. No awards or grants are explicitly documented in the available text.

Rolf Hennickerمشاهده پروفایل

دانشیار

• Formal Methods of Software Development
• Component-based Software Development
• Object-oriented Software Engineering
• +۲ مورد دیگر

Prof. Dr. Rolf Hennicker is an Associate Professor and Academic Director at the Department of Computer Science, Ludwig-Maximilians-Universität München (LMU Munich). He leads the Software and Computational Systems Lab, focusing on formal methods, component-based software engineering, and environmental simulation systems. His research emphasizes system specifications, concurrency, and dynamic logics for verifying complex systems. He actively supervises academic activities, including lectures, seminars, and diploma theses. As project leader of GLOWA-Danube and RAJA , he develops decision support systems and authorization frameworks. Collaborations include the École Normale Supérieure de Cachan (France) on ensemble modeling and verification. His work spans theoretical contributions to formal methods and practical applications in distributed systems, environmental modeling, and autonomous computing. Recent projects involve ensemble architectures and Helena frameworks for autonomic cloud systems.