Find Academic Supervisors

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.

Christoph LeitnerView profile

Research Fellow

• Convergent Technologies
• Ultrasonics
• Machine Learning
• +3 more

Dr. Christoph Leitner is a Research Fellow at ETH Zurich's Integrated Systems Laboratory under Prof. Luca Benini, focusing on biomedical and IoT applications. His work integrates printed piezoelectric transducers and flexible electronics with energy-efficient systems. He holds a PhD in Biomedical Engineering from TU Graz (2022) and has collaborated with institutions like Sant'Anna School of Advanced Studies and KTH Stockholm. Notable achievements include the Josef Krainer Young Researcher Award and Motorik Scholarship. Leitner's research spans ultrasonics, machine learning, and wearable devices, with contributions to muscle-tendon dynamics and real-time biofeedback systems. Education: PhD in Biomedical Engineering, TU Graz (2022), Advisor: Prof. Christian Baumgartner Previous roles: University Assistant (2006–2011) and R&D Engineer at Virtual Vehicle GmbH Research Interests: Convergent technologies merging biomedical engineering and IoT Ultrasound-based monitoring for musculoskeletal systems Energy-efficient embedded systems for wearable applications Collaborations & Awards: Recipient of Josef Krainer Young Researcher Award (2023) and Motorik Scholarship (2018) Active collaborations with University of Zurich, Veterinary University of Vienna, and Queensland University of Technology Labs & Projects: Integrated Systems Laboratory at ETH Zurich Developed a patented ultrasound-transparent tattoo-based SEMG system with Prof. Francesco Greco

Hendrik Jan HoogeboomView profile

Associate Professor

• Theoretical Computer Science
• Formal Languages
• Algorithms
• +13 more

Hendrik Jan Hoogeboom is an Associate Professor in the Department of Computer Science at Leiden University, affiliated with the Leiden Institute of Advanced Computer Science (LIACS) and the Theory research cluster. Research Interests: His work lies at the intersection of theoretical computer science and computational biology. He specializes in formal languages , algorithms , logic & automata (including tree-walking automata), and infinitary languages . A major theme is modeling natural computation, such as gene assembly in ciliates using graph polynomials and delta-matroids, and molecular computing paradigms like reaction systems and spiking neural P systems. Publication Trends: His recent publications (2017–2024) show a sustained focus on reaction systems and graph polynomials. He has developed formal models to analyze DNA rearrangements, explored the algebraic structure of gene assembly, and investigated the computational power of various natural computing models, often using combinatorial and algebraic tools from graph theory. Scientific Recognition: While specific awards are not listed, his extensive publication record in premier journals like Theoretical Computer Science , European Journal of Combinatorics , and Fundamenta Informaticae signifies high recognition in his field. Teaching and Mentorship: He has supervised several PhD students, including Robert Brijder, Jun Wang, and Rudy van Vliet. He teaches core courses such as Data Structures , Algorithms , Automata Theory , and Complexity , and has led seminars on topics like combinatorial game theory and SAT solvers. Laboratories and Teams: He is a key member of the Theory research cluster at LIACS, focusing on fundamental aspects of computer science. His work is deeply collaborative, especially with colleagues like Robert Brijder and W.A. Kosters.

• Computational Linguistics
• Natural Language Processing
• Formal Language Theory
• +2 more

Giorgio Satta is a Full Professor at the Department of Information Engineering , University of Padua, Italy. He received his Ph.D. in Computer Science from the University of Padua in 1990. His career includes research positions at Fondazione Bruno Kessler (Trento) and the University of Pennsylvania (IRCS). Research Focus : His work centers on computational linguistics and formal language theory , with emphasis on: Parsing algorithms (CCG, TAG, LCFRS) Computational complexity of grammar formalisms Probabilistic language modeling Dependency parsing and synchronization techniques Professional Service : He chaired the European Chapter of the ACL (2009-10), served on editorial boards for Computational Linguistics , Transactions of the ACL , and co-chaired ACL-2001/IWPT-2001. Teaching : Current courses include Automata, Languages, and Computation and Natural Language Processing (2024-25).

Roie LevinView profile

Assistant Professor

• Approximation Algorithms
• Online Algorithms
• Submodular Functions
• +5 more

Roie Levin is an Assistant Professor at Rutgers University's Department of Computer Science. He received his PhD in Algorithms, Combinatorics and Optimization from Carnegie Mellon University in 2022, advised by Anupam Gupta. Prior to that, he worked at the Allen Institute for Artificial Intelligence (2015-2017) and earned dual BSc degrees in Computer Science/Applied Mathematics and Mathematics from Brown University (2015). Before joining Rutgers, he was a Fulbright Postdoctoral Fellow at Tel Aviv University under Niv Buchbinder. Current Role: Assistant Professor in Computer Science Academic Training: PhD (2022) CMU, BSc (2015) Brown University Postdoctoral: Fulbright Fellow at Tel Aviv University Levin's research focuses on approximation algorithms for uncertain environments (online/dynamic/streaming models) and submodular function optimization. His work spans theoretical foundations and practical implementations across distributed systems, geometric constraints, and reinforcement learning paradigms. Teaching includes graduate and undergraduate algorithms courses (CS 344, CS 513) with emphasis on problem-solving techniques, computational complexity, and modern algorithmic trends. His publications showcase expertise in online algorithms, submodular optimization, and approximation theory with applications in clustering, caching, and machine learning. The 2025 articles demonstrate continued exploration of online consistency and contention resolution, while 2023-2024 works focus on submodular optimization under uncertainty and dynamic environments. Earlier publications (2015-2017) cover semantic parsing, geometric approximation, and planar graph optimization. Fulbright Postdoctoral Fellow Levin's research connects theoretical guarantees with practical implementations, bridging classical algorithm design with modern machine learning applications. His recent work explores primal-dual methods in online settings and robust subspace approximation techniques for streaming data environments.

Thomas GrafView profile

Associate Professor

• Theoretical Linguistics
• Computational Linguistics
• Syntax
• +5 more

Thomas Graf is an Associate Professor in the Department of Linguistics and an Affiliate Professor at the Institute for Advanced Computational Science (IACS) at Stony Brook University. He holds a Ph.D. from UCLA (2013) and an M.A. from the University of Vienna. His research focuses on the intersection of theoretical linguistics and computer science, exploring structural complexity in syntax, morphology, and phonology, and its implications for language processing and acquisition. Graf’s work emphasizes computational constraints on natural language, such as subregular complexity and parsing efficiency, and involves empirical studies across languages like English, Icelandic, and American Sign Language. Education: Ph.D., University of California, Los Angeles (2013) M.A., University of Vienna Research interests include computational syntax and phonology, parsing theory, and the formal characterization of linguistic universals. Key themes involve the computational power of linguistic frameworks (e.g., Minimalist grammars), the subregular hierarchy, and the typological implications of computational constraints. Graf’s recent work investigates how empirical phenomena like syntactic islands arise from complexity limits in natural language. His contributions to computational linguistics include Python tools for Minimalist grammar processing and collaborations in labs like the Computational Linguistics Lab (CompLab) at Stony Brook. He has also received a NSF CAREER grant for research on abstract universals in morphosyntax. Labs/Teams: Active member of the Computational Linguistics Lab (CompLab) at Stony Brook University. Leads the MathLing Reading Group and contributes to NLP research initiatives.

• Automata Theory
• Formal Methods
• Tree Automata
• +4 more

Christof Löding is an Adjunct Professor at the Department of Logic and Theory of Discrete Systems (Computer Science 7) at RWTH Aachen University. His research focuses on automata theory, formal verification, and logical foundations of computer science, with significant contributions to Büchi automata, tree automata, and stochastic games. Academic affiliation: RWTH Aachen University, Germany Research areas: Automata theory, Formal methods, Game theory, Logic in computer science Contact: loeding@informatik.rwth-aachen.de His recent work spans deterministic parity automata construction, finite-valued transducers, and algorithmic solutions for infinite games. Publications emphasize theoretical foundations and practical applications in program verification and XML processing. Articles analyze automata learning, uniformization problems, and lookahead degrees in infinite games, showing interconnections between automata theory and formal verification.

• Automata Theory
• Formal Verification
• Logic in Computer Science
• +3 more

Christof Löding , currently an Adjunct Professor at the Lehrstuhl für Logik und Theorie diskreter Systeme (Informatik 7) department of RWTH Aachen University , is a leading researcher in Automata Theory , Formal Verification , and Logic in Computer Science . His work bridges theoretical foundations with practical applications in software verification, automata minimization, and game theory. Research Interests include automata theory, formal verification, logic, tree automata, game theory, and computational models. Publications span topics like Finite-valued Streaming String Transducers , Deterministic Parity Automata , and Stochastic Game Strategies . Collaborations with researchers like Emmanuel Filiot , Sarah Winter , and León Bohn highlight his contributions to automata and verification. Email : loeding@informatik.rwth-aachen.de He has actively published in venues such as ICALP , LICS , and STACS , focusing on deterministic automata, transducers, and logic-based computational systems. His work on Hyperlogic for Strategies in Stochastic Games (2025) and Minimal History-Deterministic Automata (2025) showcases his ongoing influence in formal methods and automata theory.

José Pineda de GyvezView profile

Professor

• Ultra-Low Power Design
• Variability Tolerance
• Context-Aware Computing
• +3 more

José Pineda de Gyvez is Full Professor of Resilient Nanoelectronics at Eindhoven University of Technology (TU/e), affiliated with the Electronic Systems group in the Department of Electrical Engineering. He bridges academia and industry through practical experience in classrooms and technology innovation for industrial applications. His academic background includes a PhD from TU/e (1991), MSc from Instituto Nacional de Astrofísica, Óptica y Electrónica (Mexico) and University of Toronto (Canada) (1984). He previously served as faculty at Texas A&M University (1991–1999) and as Principal Scientist at Philips Research (1999–2006) and NXP Semiconductors (2006–present). Research interests focus on ultra-low power design , variability tolerance , and context-aware computing in semiconductor technology. Key trends in his publications include energy harvesting , subthreshold circuits , flip-flop optimization , and IoT power management . His work has shifted toward wearable medical devices and ultrasonic gesture recognition in recent years. Scientific Awards: IEEE Fellow (2009) He has co-authored over 100 publications, four books, and holds more than 30 US patents. His research is funded by the Dutch Ministry of Science, US Office of Naval Research, and National Science Foundation. Current projects include STW Zero 15-06 (energy harvesting), SILENSE (smart home transducers), and Wearable Brainwave Processing Platform (seizure detection).

Anca MuschollView profile

Professor

• Foundations of Formal Verification
• Automata Theory
• Logics and Games
• +2 more

Anca Muscholl is a Professor at the University of Bordeaux and holds the Hans Fischer Senior Fellowship at the Technical University of Munich (TUM-IAS). She leads the Formal Methods group at the Bordeaux Laboratory for Computer Science Research (LABRI). Her research focuses on foundational aspects of formal verification, automata theory, logics, concurrent systems, and database foundations. She has held academic positions at the University of Paris 7 and has been recognized with prestigious awards, including the Silver Medal from CNRS (2010) and membership in the Institut Universitaire de France (2007–2012). Education: Master’s from Technical University of Munich (TUM), PhD from University of Stuttgart (1994), and habilitation at the same institution. She has contributed to editorial roles for journals like Information Processing Letters and Discrete Mathematics & Theoretical Computer Science , and serves on the council of the European Association for Theoretical Computer Science (EATCS). Her work emphasizes automated controller synthesis for distributed systems and formal methods in concurrency. Notable achievements include advancements in distributed synthesis, temporal logic, and verification of reactive systems. She actively participates in organizing major conferences like ICALP and steering committees for theoretical computer science initiatives. Awards: Silver Medal (CNRS 2010), Junior Member of IUF (2007–2012), Best Paper Awards (PODS 2006, ETAPS 2001). Professional Roles: Editor for TheoretiCS , member of EATCS council, and leader of the Formal Methods group at LABRI. Research Themes: Formal verification, automata theory, concurrency, distributed systems, database logics.

Christoph LenzenView profile

Professor

• Distributed Computing
• Clock Synchronization
• Randomized Load Balancing
• +5 more

Christoph Lenzen is a Professor at CISPA Helmholtz Center for Information Security since July 2021. Previously, he served as a Group Leader at the Max Planck Institute for Informatics (2014-2021), and held postdoctoral positions at MIT CSAIL (2013-2014), Weizmann Institute (2012), and Hebrew University (2011). Research Interests Design and analysis of distributed algorithms Clock synchronization and adversarial fault tolerance Randomized and self-stabilizing systems Hardware algorithms for fault-tolerant systems Grants and Awards ERC Proof-of-Concept Grant (2021) ERC Starting Grant (2017-2022) ETH Zurich Medal for Outstanding Thesis (2011) Education Ph.D. in Computer Science (2011), ETH Zurich Diploma in Mathematics (2007), University of Bonn Teaching Clock Synchronization and Adversarial Fault Tolerance (2022 winter) How To Clock Your Computer (2022 summer) Theory of Distributed Systems (2019 winter, 2020 winter, 2018 winter, 2017 winter, 2016 winter, 2015 winter)

• Machine Learning
• Structured Prediction
• Tree Automata
• +6 more

Marc Tommasi is a Professor in Computer Science at the University of Lille, affiliated with the CRIStAL laboratory where he leads the Magnet research team. Previously, he was a founding member of the Mostrare project team at INRIA Lille. His academic career spans research in machine learning foundations and applications to structured data. His research focuses on: Machine learning theory and algorithms Structured prediction for trees and graphs Tree automata and set constraints Decentralized learning systems Sparse representations for structured data Natural language processing techniques Information extraction from semi-structured data His publication portfolio demonstrates consistent focus on spectral methods for graph learning, probabilistic tree modeling, and conditional random fields, with applications spanning network analysis, XML processing, and natural language tasks. Recent work emphasizes large-scale network modeling and spectral clustering techniques. He has supervised 13 PhD students including ongoing work in decentralized machine learning (Mahsa Asadi), privacy-preserving speech recognition (Brij Srivastava), and multilingual dependency parsing (Mathieu Dehouck), with completed theses covering graph construction, spectral clustering, and tree transducer learning. Significant research projects under his coordination include Pamela (decentralized ML), Lampada (structured data representations), Marmota (statistical ML for trees), Crotal (CRFs for NLP), ATASH (document transformations), and WebContent (information extraction). He maintains active involvement in the Magnet team at CRIStAL focusing on machine learning for graphs and NLP.

Matthew HagueView profile

Professor

• Infinite-State Verification
• Higher-Order Recursion
• Counter Systems
• +9 more

Matthew Hague is a Professor at the Department of Computer Science, Royal Holloway University of London. His research focuses on theoretical and practical aspects of infinite-state verification, with a particular emphasis on higher-order recursion and counter systems. Education: MEng in Computing, Imperial College London DPhil (PhD) in Computer Science, University of Oxford Research Interests: Matthew's work spans infinite-state systems verification , higher-order program analysis , string constraint solving , and pushdown automata . He develops practical tools like Ostrich (for string constraints), C-SHORe (for HORS analysis), TreePed (for CSS optimization), and PDSolver (for pushdown parity games). Scientific Contributions: His recent work includes symbolic Parikh's theorem applications (2024), regex-dependent string constraint solving (2022), collapsible pushdown parity games (2021), and path feasibility analysis with integer data types (2020). These span formal methods, automata theory, and programming language design. Awards & Grants: EPSRC Early Career Fellowship (2013-2018) EPSRC Grant for String Constraint Solving (PI, 2019-2022) Academic Leadership: Matthew has supervised numerous PhD students including Emma Lieu and Jonathan Hoyland, and organized key conferences like BCTCS 2018 and ICALP 2026. He maintains active involvement in program committees for POPL, LICS, and MFCS. Laboratory Tools: He leads development of Ostrich (string constraint solver), PDSolver (pushdown system analysis), and C-SHORe (higher-order verification) tools.

Sarah WinterView profile

Associate Professor

• Theoretical Computer Science
• Automata Theory
• Logic in Computer Science
• +7 more

Sarah Winter is a tenured Associate Professor (Maîtresse de Conférences) at Université Paris Cité and a member of the Automata and Applications team at IRIF (Institut de Recherche en Informatique Fondamentale). Previously, she was a postdoctoral researcher at Université libre de Bruxelles (2019–2023) in the Formal Methods and Verification group, and she completed her PhD in Computer Science at RWTH Aachen University under Christof Löding (2014–2018). Doctoral Degree: Computer Science, RWTH Aachen University, 2018 Master’s Degree: Computer Science, RWTH Aachen University, 2013 Bachelor’s Degree: Computer Science, RWTH Aachen University, 2011 Her research lies at the intersection of theoretical computer science, logic, and automata theory. She focuses on transducer synthesis, formal verification, streaming string transducers, delay games, and hyperproperties. Her work explores the computability and definability of functions and relations over infinite words and trees, often using logical and automata-theoretic frameworks. She investigates how systems can be synthesized from specifications, especially under constraints like delay or partial observability. Her recent publications, appearing in top-tier journals and conferences such as LMCS, TheoretiCS, LICS, and ICALP, show a consistent trend toward formal models of computation involving transducers, games with delay, and logical synthesis. Keywords across her work include reactive synthesis, automata on infinite structures, function uniformization, and model checking for hyperlogics. Her collaborations with researchers like Martin Zimmermann and Emmanuel Filiot reflect a strong network in European formal methods. Best Student Paper Award, MFCS 2018 Sarah Winter has advised students at the Master’s and PhD levels, as evidenced by her own academic lineage and supervision roles in publications, though no explicit list of advisees is provided. She has not mentioned specific grants, but her postdoctoral and faculty positions suggest funding support. She is actively involved in the theoretical computer science community, giving talks at international venues and workshops. She is a core member of the Automata and Applications team at IRIF, contributing to research on automata theory and its applications in verification and programming languages. Her work forms part of a broader effort to develop rigorous foundations for computing systems.

Olivier GauwinView profile

Assistant Professor

• Automata Theory
• Formal Languages
• Logic in Computer Science
• +6 more

Olivier Gauwin serves as an Assistant Professor at the University of Bordeaux, holding dual roles in academic instruction and research. He teaches within the Computer Science Department at the University Institute of Technology (IUT), while conducting research as a core member of LaBRI's Numeric and Sustainability team. His institutional presence spans both the IUT campus in Gradignan (office 111) and LaBRI's research facilities in Talence (office 311), reflecting his integrated contributions to theoretical computer science and applied sustainability initiatives. His educational trajectory demonstrates deep theoretical foundations: Habilitation à diriger des recherches (HDR) from University of Bordeaux (2020) titled Transductions: resources and characterization PhD in Computer Science from Université Lille 1 (2009) titled Streaming Tree Automata and XPath , conducted at LIFL/INRIA Master's degree (DEA) from Centre de Recherche en Informatique de Lens (2004) titled Fusion itérée de croyances Gauwin's research program bridges abstract theory and practical applications, with early work establishing fundamental results in automata theory for XML stream processing. His investigations into visibly pushdown automata, nested words, and transducers created novel frameworks for efficient query answering in data streams. Recent years show strategic expansion into sustainability, where he adapts formal methods to environmental modeling challenges. This evolution maintains rigorous theoretical grounding while addressing contemporary computational sustainability needs through the Numeric and Sustainability team. Analysis of his 15 most recent publications reveals consistent methodological excellence across theoretical computer science. Core themes include automata minimization (notably proving NP-completeness for visibly pushdown automata), logical characterizations of transductions, and streamability analysis for nested structures. His work demonstrates exceptional coherence—advancing from foundational XML processing (2008-2013) to resource-optimized transducers (2015-2018) and current sustainability applications, always maintaining focus on computational efficiency and formal verifiability. Dr. Gauwin actively mentors the next generation of computer scientists: Supervised PhD completion of Nathan Lhote (2015-2018) on logical characterizations of transductions Guided PhD research of Félix Baschenis (2014-2017) on transducer minimization and resource optimization His research is institutionally supported through LaBRI (UMR 5800), a joint CNRS-University of Bordeaux laboratory, though specific external grants aren't detailed in available materials. Current work continues through the Numeric and Sustainability team, where he integrates automata theory with environmental computation challenges in collaborative projects spanning theoretical innovation and real-world sustainability applications.