Find Academic Supervisors

Wojciech RytterView profile

Professor

• Design and analysis of computer algorithms
• Automata and formal languages
• Parallel algorithms
• +5 more

Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.

Joseph EremondiView profile

Assistant Professor

• Programming Languages
• Type Theory
• Dependent Types
• +12 more

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, Faculty of Science, Canada. He began his tenure in 2024 after serving as a Royal Society Newton International Fellow at the University of Edinburgh, where he conducted postdoctoral research with Ohad Kammar in the Laboratory for Foundations of Computer Science. He earned his PhD from the University of British Columbia (UBC) under the supervision of Ron Garcia at the UBC Software Practices Laboratory. His research is centered on programming languages theory, with a strong focus on type systems that enhance software reliability and usability. He is particularly known for his work in dependent types, gradual typing, and the integration of both paradigms. His research interests include: Dependent pattern matching and its semantic foundations Gradual dependent types and approximate normalization Error message generation and usability in dependently typed languages Static analysis using set constraints and SMT solvers Theoretical properties of reversal-bounded counter automata and shuffle operations His recent publications, appearing in premier venues like POPL, ICFP, and CPP, reflect a consistent trajectory toward making advanced type systems more accessible and practical. Key themes include coverage semantics for dependent pattern matching, formal models of gradual dependent typing, and improving the developer experience through better tooling and error diagnostics. Notable scientific recognitions include the NSERC Discovery Grant (awarded in 2025) and the prestigious Royal Society Newton International Fellowship. These awards underscore the impact and promise of his research program on the usability of dependently typed programming languages. Joseph is actively mentoring and recruiting graduate students, particularly in areas such as dependently typed programming (Lean, Agda, Idris, Coq), gradual typing, live programming environments, and static analysis. He emphasizes close collaboration within a small, focused research group. He has also served on program committees, including for TyDe and POPL Artifact Evaluation, demonstrating active engagement in the programming languages community. His work bridges theoretical rigor with practical implementation, evident in his artifact releases on GitHub and integration with tools like Ott and DrRacket. He maintains a personal website and open-source repositories that support reproducibility and community involvement.

Sanjay JainView profile

Professor

• Inductive Inference
• Recursion Theory
• Complexity Theory
• +3 more

Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.

Vadim LozinView profile

Professor

• Graph theory
• Combinatorics
• Discrete Mathematics
• +4 more

Vadim Lozin is a Professor of Mathematics at the University of Warwick, affiliated with the Department of Mathematics within the School of Mathematics. His research interests span graph theory, combinatorics, and discrete mathematics, focusing on areas such as clique-width, Ramsey numbers, and structural graph theory. He has held visiting positions at institutions including the Université Paris-Dauphine, EPFL, and KAUST. Lozin has received several accolades, including the Best Paper Award for 'Linear Ramsey numbers' in 2018 and a 2024 award at the International Symposium on Algorithms and Computation. His work involves collaborations with global researchers and contributions to conferences like IWOCA and WG. Lozin serves on editorial boards for journals such as Discrete Applied Mathematics and Electronic Notes in Discrete Mathematics . His research explores foundational problems in graph theory, with applications in algorithm design and complexity analysis. Lozin’s publications include studies on union-closed sets, functional graph properties, and algorithmic approaches to graph parameters. He has also contributed to books like Words and Graphs , bridging formal language theory with graph structures. His grants focus on clique-width and stability in graphs, reflecting his commitment to advancing theoretical and applied discrete mathematics.

Elette BoyleView profile

Associate Professor

• Cryptography
• Computer Security
• Coding Theory
• +7 more

Elette Boyle is an Associate Professor at Reichman University (IDC Herzliya) and a Senior Scientist at NTT Research . She holds a Ph.D. in Mathematics from MIT (advised by Shafi Goldwasser and Yael Tauman Kalai) and an undergraduate degree from Caltech . Education Ph.D. in Mathematics, MIT B.S. in Mathematics, Caltech Her research focuses on cryptographic solutions for secure data processing , particularly in secure multi-party computation , function/homomorphic secret sharing , and distributed point functions . Recent work explores topology-hiding communication , memory checking complexity , and sublinear-communication MPC . Key trends in her publications include: Advancements in Function Secret Sharing for branching programs and sparse vectors. Efficient Secure Multi-Party Computation protocols with preprocessing. Information-theoretic and computational Topology-Hiding Broadcast schemes. Optimized Oblivious Transfer with constant computational overhead. Scientific Awards European Research Council (ERC) Award Israeli Science Foundation (ISF) Grant United States Air Force Office of Scientific Research (AFOSR) Grant Google Research Scholar Award International Association for Cryptologic Research (IACR) Recognition As Director of the Foundations & Applications of Cryptography (FACT) Research Center , she leads collaborative work with institutions like Technion Israel , Cornell University , and NTT Research . Her students include Pierre Meyer (Ph.D.) , Matan Hamilis (Ph.D.) , and D'or Banon (MSc.) .

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

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.

Sebastian RudolphView profile

Professor

• Artificial Intelligence
• Knowledge Representation and Reasoning
• Description Logics
• +7 more

Prof. Sebastian Rudolph is a Professor of Computational Logic at the Institute for Artificial Intelligence , Faculty of Computer Science , TU Dresden. Since 2021, he has been an Affiliate Member of the Faculty of Mathematics. His research spans theoretical and applied artificial intelligence, focusing on Knowledge Representation and Reasoning through formalisms like Description Logics, Existential Rules, and Formal Concept Analysis, with applications in Semantic Technologies. 2017 : ERC Consolidator Grant for decidability principles in logic-based knowledge representation 2006-2013 : Postdoctoral researcher, project leader, and Privatdozent at KIT's Institute AIFB 2011 : Habilitation at KIT Earlier : PhD in Algebra and teaching qualification in mathematics, physics, and computer science at TU Dresden His recent publications address decidability of logical reasoning, non-monotonic extensions in formal concept analysis, standpoint logics, and multiagent systems. He supervises the DeciGUT and KIMEDS projects, and is involved in the SECAI and ScaDS.AI centers. Teaching activities include courses on Theoretical Computer Science, Existential Rules, and Formal Concept Analysis.

Manfred DrosteView profile

Professor

• Theoretical Computer Science
• Automata Theory
• Logic
• +6 more

Manfred Droste is a Professor at the Institute of Computer Science of the University of Leipzig, where he leads the Research Group on Automata and Formal Languages. He serves as Director of the Graduate Centre Mathematics, Computer Science and Natural Sciences and is Vice-speaker of the DFG-Research Training Group Quantitative Logics and Automata. His academic career spans decades of research and leadership in theoretical computer science and algebra. Prof. Droste's research focuses on theoretical computer science, particularly automata theory, logic, algebraic models for concurrent systems, and domain theory. In algebra, his interests include model theory, automorphism groups, and ordered algebraic structures. His work bridges theoretical foundations with practical applications in formal language theory and quantitative systems. His extensive publication record demonstrates a consistent focus on weighted automata, formal languages, and their logical characterizations. Over the years, his research has evolved to address increasingly complex quantitative models, with recent work focusing on weighted complexity classes, weighted linear dynamic logic, and decidability boundaries for weighted automata. Prof. Droste has received significant recognition including election to Academia Europaea, an honorary doctorate from Immanuel Kant Baltic Federal University, and fellowship in the Asia-Pacific Artificial Intelligence Association. These honors reflect his substantial contributions to theoretical computer science. He has supervised numerous PhD students including Dietrich Kuske, Paolo Boldi, and Karin Quaas, many of whom have become prominent researchers. His extensive grant portfolio includes multiple DFG projects on weighted automata and international collaborations through DAAD funding. Prof. Droste leads a vibrant research team including Andrea Hesse, Karin Quaas, Erik Paul, and others. He has organized the international workshop series "Weighted Automata: Theory and Applications" since 2002, fostering global collaboration in this specialized field.

• Artificial Intelligence
• Strategic Reasoning in Multi-Agent Systems
• Formal Verification
• +6 more

Aniello Murano is a Professor of Computer Science at the Department of Electrical Engineering and Information Technologies , University of Naples Federico II. He serves as Scientific Director of the ASTREA (Automated Strategic Reasoning) Laboratory and leads cutting-edge research in Artificial Intelligence, Strategic Reasoning, Multi-Agent Systems , and Formal Verification . Research Interests : Strategic reasoning under perfect/imperfect information, specification/verification/synthesis of reactive systems, temporal/modal logics, automata theory, parity games, game theory, mechanism design, and formal languages. Notable Projects : PNRR Research Unit Coordinator (2023-2025) on Resilient AI, PRIN 2020 Unit Coordinator (RIPER: Resilient AI-Based Self-Programming and Strategic Reasoning), H2020-MSCA SEAL (Principal Coordinator). Awards & Honors : JPMorgan Faculty Research Award (2022), Royal Society Award (2016), Best Paper PRIMA (2015), INDAM Project Leader (2023), Italian Scientific Habilitation (2017-2018). Students & Postdocs : Supervised 6 PhD students (e.g., Silvia Stranieri, Vadim Malvone) and mentored postdocs such as Munyque Mittelmann and Bastien Maubert. Laboratory : Leads ASTREA Lab, focusing on automated strategic reasoning and resilient AI systems.

Calin BeltaView profile

Professor

• Control Theory
• Formal Verification
• Hybrid Systems
• +3 more

Calin Belta is a Professor in the College of Engineering at Boston University , with joint appointments in Mechanical Engineering, Systems Engineering, and Electrical and Computer Engineering. His research bridges control theory and formal methods, focusing on controller synthesis and automatic verification of hybrid systems with applications in robotics and systems biology . Education: Ph.D. in Control Theory, University of Pennsylvania His work emphasizes temporal logic specifications for ensuring safety and correctness in autonomous systems, particularly through control barrier functions (CBFs) , reinforcement learning , and model predictive control . Applications span from microrobotics to autonomous driving and biomolecular modeling . His recent articles (2025–2024) highlight advancements in safe control algorithms for autonomous vehicles, adaptive CBFs , temporal logic-guided learning , and microrobotics for cell manipulation. Common themes include formal verification , robustness , and human-in-the-loop safety . Scientific Awards: AFOSR Young Investigator Award (2008) NSF CAREER Award (2005) He also contributes to academia as a Senior Member of IEEE and Associate Editor for journals like SIAM Journal on Control and Optimization and IEEE Transactions on Automatic Control . His lab develops computational tools for safety-critical control in complex environments.

Tatiana Smirnova-NagnibedaView profile

Associate Professor

• Combinatorial Group Theory
• Geometric Group Theory
• Asymptotic Group Theory
• +5 more

Tatiana Smirnova-Nagnibeda is an Associate Professor in the Mathematics Section at the University of Geneva, where she obtained her PhD before holding positions at ETH Zurich and KTH Stockholm. She returned to UNIGE where she has established herself as a leading researcher in geometric and combinatorial group theory. Her research focuses on combinatorial, asymptotic and geometric group theory, as well as probabilities on groups and graphs. She has made significant contributions to the understanding of branch groups, self-similar groups, Schreier graphs, and spectral properties of group actions. Her work often bridges algebra, probability, and geometry, revealing deep connections between these areas through the study of Thompson's groups, Grigorchuk's group, and other important group constructions. Her recent publications demonstrate a consistent focus on subgroup structure in various classes of groups, spectral properties of Schreier and Cayley graphs, and connections to dynamical systems. She frequently collaborates with researchers from around the world, particularly with Rostislav Grigorchuk, and has mentored numerous doctoral students who have gone on to successful academic careers. Managing Editor for Groups, Geometry, and Dynamics Editor for L'Enseignement Mathématique Organizer of GAGTA conferences (2022, 2024) Organizer of specialized workshops on high-dimensional expanders (2015, 2016) She leads an active research group comprising postdoctoral fellows and doctoral students working on various aspects of group theory and its applications. Her teaching includes advanced courses on graph theory, random walks on groups, spectral theory of graphs, and amenability at the University of Geneva.

Mai Ha VuView profile

Assistant Professor

• Theoretical Linguistics
• Computational Linguistics
• Mathematical Linguistics
• +6 more

Mai Ha Vu is an Assistant Professor at the University of Toronto Mississauga , split between the Department of Language Studies and the Department of Mathematics, Computer Science, and Statistics . Her work bridges theoretical linguistics, computational methods, and biological data modeling. Ph.D. in Linguistics, University of Delaware (2020) M.A. in Linguistics, University of Delaware (2014) B.A. in Psychology and Linguistics, Grinnell College (2013) Research focuses on applying formal language theory to understand human language patterns and train biologically reliable language models . Recent work includes antibody language modeling (Nature Computational Sciences 2022) and syntax-prosody mapping via logical transductions (SIGMORPHON 2022). Key research trends in publications: interdisciplinary applications of computational linguistics to immunology, psycholinguistic modeling of neural language models, and formal syntactic analysis of negation and wh-questions across languages.

• Mathematical Logic
• Formal Methods
• Automated Reasoning
• +4 more

Dr. Sasha Rubin is a Senior Lecturer and leader of the Computational Logic for AI (LOGIC-AI) group at the School of Computer Science, The University of Sydney. He holds a PhD in Mathematics and Computer Science from the University of Auckland and previously worked at the University of Naples Federico II. His research focuses on logic foundations of AI, including synthesis, planning, formal methods, and multi-agent systems. He teaches courses like Models of Computation and supervises students in topics like probabilistic systems and reinforcement learning. Research Interests: Mathematical Logic, Formal Verification, Temporal Logic Synthesis, Automated Reasoning, and Multi-Agent Systems. He has published extensively in top venues like IJCAI, AAAI, and ACM Transactions. His work includes verification of agent navigation, strategy logic, and planning under uncertain environments. Awards: Recognized as an Australian Research Field Leader in Theoretical Computer Science (2020). He serves on editorial boards for JAIR and conferences like KR, and organizes events such as the Australasian Association for Logic Conference (2024). Supervision and Grants: Current students include Ethan HIRSCHOWITZ and Kunal OSTWAL. Past supervision spans MPhil/PhD projects on probabilistic systems, ML classifier fairness, and symbolic automata. His grants include studies on logic and robots in anonymous graphs. Professional Activities: Member of EATCS, ACM, and mentor for the Sydney Summer Innovation Programme. He leads the LOGIC-AI lab and collaborates internationally, notably with Giuseppe De Giacomo at Sapienza University of Rome.

YooJung ChoiView profile

Assistant Professor

• Probabilistic Machine Learning
• Tractable Probabilistic Modeling
• Algorithmic Fairness
• +6 more

YooJung Choi is an Assistant Professor at the School of Computing and Augmented Intelligence, Arizona State University. Her research focuses on probabilistic machine learning, trustworthy AI, and tractable probabilistic modeling. She holds a PhD in Computer Science from UCLA and has been recognized with awards like the Cisco Research Award and Simons-Berkeley Research Fellowship. Education: PhD in Computer Science (University of California, Los Angeles). Research interests include probabilistic reasoning, fairness, robustness, and interpretability. Her work bridges theoretical foundations and practical applications, with contributions to probabilistic circuits and optimal transport. Notable achievements include co-organizing TPM 2024 and presenting at venues like NeurIPS and AAAI. She actively promotes fairness in AI through frameworks that address label bias and discrimination patterns. Awards: Cisco Research Award, Simons-Berkeley Fellowship, AAAI 2023 New Faculty Highlights. Teaching: Courses on artificial intelligence, machine learning, and research supervision. Service: Tutorial leadership on probabilistic circuits, workshop organization, and academic talks globally.

• Formal Methods
• Software Verification
• Concurrent Systems
• +6 more

Thomas Henzinger is a Professor at the Institute of Science and Technology Austria (ISTA), where he leads the Henzinger Thomas Group focused on improving software reliability through mathematical methods. He previously served as ISTA's President (2009–2022) and held academic positions at EPFL, Max Planck Institute, UC Berkeley, and Cornell University. Education: Dipl.-Ing. in Computer Science (Johannes Kepler University, Austria), M.S. in Computer and Information Sciences (University of Delaware), PhD in Computer Science (Stanford University), and Honorary Doctorates from Fourier University (France) and Masaryk University (Czech Republic). The group's research spans concurrent systems , embedded systems , quantitative model checking , runtime monitoring , and trustworthy AI . They develop tools like HyTech and VAMOS, emphasizing predictability, robustness, and fairness in safety-critical software. Recent publications highlight trends in quantitative automata , fairness in AI , quantum algorithms , and automata theory , reflecting interdisciplinary applications from cyber-physical systems to neural networks. Collaborative projects include SPyCoDe (security foundations) and VAMOS (software monitoring). Honors & Awards: 2024 Fellow of the Royal Society 2020 Member, US National Academy of Sciences 2015 Royal Society Milner Award 2012 Wittgenstein Award 2006 ACM and IEEE Fellow 1995 NSF CAREER and ONR Young Investigator Awards Henzinger advises current and former PhD students including Mahyar Karimi, Pavol Kebis, and Mathias Lechner. His grants include ERC Advanced Grants (QUAREM, VAMOS) and FWF funding (Wittgenstein Award, NFN RISE). Labs & Teams: He leads the Henzinger Thomas Group at ISTA, collaborating with FORSYTE (TU Wien) and contributing to EU-funded initiatives. The group integrates postdocs, PhD students, and interns in formal methods and system verification.