Find Academic Supervisors

Cao JiannongView profile

Academic

• Cloud and edge computing
• Parallel and distributed computing
• Big data analytics
• +2 more

Cao Jiannong is currently a Chair Professor and Director of the University Research Facility in Big Data Analytics at Hong Kong Polytechnic University . He has held academic roles including Assistant Professor at City University of Hong Kong and University Lecturer at the University of Adelaide and James Cook University. His research spans Cloud and Edge Computing , Parallel and Distributed Systems , Big Data Analytics , and Wireless Sensing . Ph.D. in Computer Science, Washington State University (1990) MSc in Computer Science, Washington State University (1986) BSc in Computer Science, Nanjing University, China (1982) His work focuses on solving theoretical and practical challenges in distributed computing , mobile cloud systems , and wireless sensor networks . Recent projects include coupled network embedding models for heterogeneous networks and SDN architectures for vehicular communication. His research also pioneers WiFi-based non-invasive health monitoring and fault-tolerant sensor deployment for structural health applications. Dr. Cao's publications highlight advancements in network embedding , edge computing , and WSN optimization . Key papers address multi-user computation partitioning , energy-efficient SHM systems , and consensus protocols for mobile networks. These works have been cited over 15,000 times, with an h-index of 60. Ministry of Education (China) Natural Science Award (2018) Distinguished Member, ACM (2017) Fellow, IEEE (2014) Best Paper Awards at IEEE DSAA, SMARTCOMP, and WCNC Dr. Cao has advised multiple PhD students, including Linchuan Xu and Weigang Wu , whose research on WSN-based SHM and coupled network embedding has practical impact. His leadership includes directing Hong Kong Polytechnic University's Big Data Research Facility and serving on technical committees for IEEE INFOCOM and ACM/IEEE conferences.

Aram HarrowView profile

Professor

• Quantum Information Science
• Quantum Algorithms
• Quantum Computing
• +3 more

Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.

Monika HenzingerView profile

Professor

• Algorithms
• Data Structures
• Dynamic Algorithms
• +3 more

Monika Henzinger is Professor at the Institute of Science and Technology Austria (ISTA), heading the research group of Theory and Applications of Algorithms. She also serves as Vice President for Technology Transfer at ISTA since 2024. Previously, she held professorships at the University of Vienna (2009-2023) and EPFL, Switzerland (2005-2009), was Director of Research at Google (1999-2005), and served as Assistant Professor at Cornell University. Professor Henzinger's research centers on efficient algorithms and data structures with three main thrusts. First, she investigates dynamic settings where program inputs are repeatedly updated, seeking solutions faster than restarting computations. Second, she develops privacy-preserving algorithms that add minimal noise to protect input data while maintaining efficiency. Third, she translates theoretically optimal algorithms into practical implementations for dynamically changing inputs. Her work consistently addresses resource conservation in data processing, particularly computing time and memory space, while exploring the theoretical limits of possible savings. Henzinger's recent publications (2024-2025) reveal strong trends in dynamic algorithms, differential privacy, and graph theory. Her research consistently bridges theoretical computer science with practical applications, focusing on algorithms that adapt to changing inputs while preserving computational efficiency and data privacy. She has made significant contributions to problems like dynamic matching, minimum cut computation, and privacy-preserving data analysis across various domains. Professor Henzinger has received numerous prestigious awards and honors: Wittgenstein Award (2021) Two ERC Advanced Grants (2014, 2021) Carus Medal of the German Academy of Sciences Leopoldina (2019) SIGIR Test of Time Award Fellow of the Association of Computing Machinery (2016) Member of the Austrian Academy of Sciences (2017) CAREER Development Award of the National Science Foundation Best paper Award at the Symposium on Discrete Algorithms (2024) Professor Henzinger currently advises PhD students Bardiya Aryanfard, Antoine El-Hayek, and Roodabeh Safavi Hemami, along with postdocs Anamay Chaturvedi and Niklas Hahn. Her research is supported by multiple significant grants including an ERC Advanced Grant for 'Design and Evaluation of Modern, Fully Dynamic Data Structures,' the FWF Wittgenstein Prize, and the WEAVE Project on 'Static and dynamic hierarchical graph decompositions.' She also serves as Principal Investigator for the FWF project 'Fast algorithms for a reactive network layer,' providing substantial funding for her innovative work in algorithms and data structures. Professor Henzinger leads the Theory and Applications of Algorithms research group at ISTA, which focuses on developing practical algorithms for dynamic environments. Her team investigates resource conservation in data processing, specializing in dynamic algorithms that efficiently handle changing inputs, privacy-preserving algorithms that minimize noise while protecting data, and translating theoretical algorithms into practical implementations. The group maintains a strong presence in theoretical computer science through regular publications in top conferences and journals, and collaborates extensively with institutions worldwide to advance algorithmic research.

Primoz SkrabaView profile

Professor

• Applied Topology
• Geometry
• Algebra
• +5 more

Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.

Douglas K. SnyderView profile

Professor

• Couple and family therapy
• Marital assessment
• Psychotherapy process and outcome
• +5 more

Douglas K. Snyder is a Professor in the Department of Psychological and Brain Sciences within the College of Liberal Arts at Texas A&M University. He previously served as Director of Clinical Training from 1991 to 2012 and has been internationally recognized for his research on marital assessment and outcome research on marital therapy, particularly through his development of the Marital Satisfaction Inventory. Dr. Snyder earned his bachelor's degree from Wittenberg University in 1974, received his doctoral degree from the University of North Carolina at Chapel Hill in 1978, and completed his internship at Duke University Medical Center. Prior to his appointment at Texas A&M, he served on the faculty at Wayne State University in Detroit and at the University of Kentucky in Lexington, where he also served as Director of Clinical Training and Associate Dean in the College of Arts and Sciences. Dr. Snyder's research emphasizes the assessment, treatment, and prevention of couple relationship distress. His work centers on the Marital Satisfaction Inventory, a multidimensional measure of relationship accord now published in several languages and used worldwide. His treatment research focuses on tailoring therapy to specific partner and relationship characteristics by integrating cognitive, behavioral, emotion-focused, and insight-oriented interventions. His specific clinical interests include treating difficult couples with emotional, behavioral, and health problems, with particular attention to military and veteran couples and those dealing with infidelity. Dr. Snyder's recent publications demonstrate continued leadership in couple therapy, with emphasis on evidence-based approaches, treatment of infidelity, military couples, and cross-cultural applications of couple assessment tools. His work spans theoretical advancements and practical clinical applications. Outstanding Research Publication Award, Association for Marriage and Family Therapy, 1991 Professor of the Year Award, Texas Psychological Association - Division of Students, 1993 Award for Distinguished Contributions to Family Psychology, American Psychological Association, 2005 Outstanding Contributions to Science Award, Texas Psychological Association, 2008 Distinguished Alumnae Award, University of North Carolina (Chapel Hill), 2012 Distinguished Psychologist Award for Lifetime Contributions to Psychotherapy, American Psychological Association, 2015 Fellow of the American Psychological Association (Divisions 5, 12, 19, 29, 43) Fellow of the Association for Behavioral and Cognitive Therapies Fellow of the Society for Personality Assessment Dr. Snyder has served as Editor of the Clinician's Research Digest and as Associate Editor for the Journal of Consulting and Clinical Psychology and the Journal of Family Psychology. His research has been supported by the National Institute of Mental Health, with significant focus on military couples and relationship distress. He has developed evidence-based approaches for assessing and treating relationship problems across diverse cultural contexts. Dr. Snyder is affiliated with the Personality Processes research cluster at Texas A&M University, focusing on objective personality assessment and clinical assessment of couples and families. His work bridges research and clinical practice, with emphasis on developing practical assessment tools and treatment approaches for clinicians working with distressed couples.

Ann B LeeView profile

Professor

• Scientific Machine Learning
• Trust-Worthy UQ
• Likelihood-Free Inference
• +1 more

Ann B. Lee is a Professor and Co-Director of the PhD Program in Statistics at Carnegie Mellon University , with a joint appointment in the Department of Statistics & Data Science and the Machine Learning Department. Prior to joining CMU, she held positions as a J.W. Gibbs Assistant Professor at Yale University and a visiting research associate at Brown University. PhD in Physics, Brown University MSc/BSc in Engineering Physics, Chalmers University of Technology, Sweden Her research focuses on statistical methodology for complex data in the physical sciences , emphasizing trustworthy inference, uncertainty quantification, and integration of classical statistics with machine learning. Recent work includes likelihood-free inference, calibrated forecasting, and diagnostics for generative models. The STAMPS research group , which she co-founded in 2018, hosts weekly meetings and public webinars. In Fall 2024, STAMPS will transition into a CMU Research Center. Recent publications span likelihood-free inference , climate modeling , and astronomy . Notable collaborations include applications to hurricane intensity guidance , galaxy redshift estimation , and cosmological parameter biases . She mentors PhD students and has advised multiple award-winning researchers, including ASA Best Student Paper Award winners. Her teaching includes advanced courses on probability, regression, and AI for climate sciences.

Konstantin (Kostia) M. ZuevView profile

Teaching Professor

• Network Science
• Applied Probability
• Computational Statistics
• +4 more

Dr. Konstantin (Kostia) M. Zuev serves as Teaching Professor in the Computing + Mathematical Sciences Department at California Institute of Technology , where he has made significant contributions to network science and computational statistics since 2016. His dual PhDs in Mathematics (Moscow State University, 2008) and Civil Engineering (HKUST, 2009) underpin his interdisciplinary research spanning differential geometry, stochastic simulation, and network dynamics. Education PhD in Mathematics, Lomonosov Moscow State University (2008) PhD in Civil Engineering, Hong Kong University of Science & Technology (2009) His research focuses on network science , particularly course-prerequisite networks and complex financial systems , with recent work extending to network navigability in cosmological models and rare event simulation. Over his career, he has developed innovative Bayesian inference methods and geometric preferential attachment theories while maintaining active collaborations across mathematics, physics, and biomedical domains. Recent publications highlight network analysis in education ( 2023 ), hyperbolic graph theory ( 2024 ), and pandemic-informed cancer mortality studies ( 2023 ). His 15 most recent articles demonstrate methodological innovations across disciplines including statistics, physics, finance, and cosmology. Scientific recognition includes Humboldt Research Fellowship (2021) Carver Mead Seed Fund Grant (2023) ASCIT Teaching Award (2018, 2023) Northrop Grumman Teaching Excellence Prize (2019) As Graduate Option Representative for Information and Data Sciences at Caltech and faculty advisor for multiple student organizations including the Caltech Karate Club and Caltech Chess Club , he actively bridges academic rigor with community engagement through outreach initiatives like the virtual math education channel and university math circles for K-12 students.

Chaitanya SwamyView profile

Professor

• Combinatorial Optimization
• Approximation Algorithms
• Algorithmic Game Theory
• +4 more

Chaitanya Swamy is a Professor and University Research Chair in the Department of Combinatorics & Optimization at the University of Waterloo, Canada. His primary affiliation is within the Faculty of Mathematics, and he holds positions in both the Department of Combinatorics & Optimization and the School of Computer Science. He obtained his Ph.D. in Computer Science from Cornell University under the supervision of David Shmoys, followed by postdoctoral research at Caltech's Center for the Mathematics of Information. Swamy’s research focuses on algorithms, particularly in combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization, network design, scheduling, and online algorithms. His work spans theoretical contributions and practical applications, including algorithm design for facility location, network routing, and mechanism design. He has contributed to foundational results in approximation algorithms, such as the development of primal-dual methods and LP-rounding techniques. Swamy has held significant editorial roles, including as an associate editor for Discrete Optimization and SIAM Journal on Computing . He has organized major conferences like CanaDAM 2021 and sessions at ISMP 2018. His teaching record includes courses on combinatorial optimization, scheduling, and algorithmic game theory. He has advised numerous Ph.D. and Master’s students, many of whom have gone on to prestigious academic and industry positions. Swamy’s research has been recognized through awards for his students, including the University of Waterloo Alumni Gold Medal. He actively contributes to the academic community through committee work for conferences like STOC, APPROX, and SODA, and his publications reflect a deep engagement with both theoretical and applied aspects of algorithms and optimization.

Daniel A. SpielmanView profile

Professor

• Spectral Graph Theory
• Algebraic Graph Theory
• Laplacian Matrices
• +7 more

Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.

• Causal Inference
• Experimental Design
• Statistical Methods
• +3 more

Peter Aronow is a Professor at Yale School of Public Health , with appointments in the Department of Statistics and Data Science , Economics Department , and the Institute for Social and Policy Studies . His interdisciplinary work bridges political science, biostatistics, and epidemiology. Professor of Public Health (Biostatistics) Secondary appointments in Political Science and Economics Associate Professor in the Institute for Social and Policy Studies Dr. Aronow specializes in causal inference and statistical methodology, particularly in non-traditional field research contexts. His research encompasses: Design-based approaches to causal inference Complex experimental designs Social network analysis Survey methodology with incomplete data His recent publications focus on spatial experiments under unknown interference, bias correction in RCTs, and temporal validity challenges. While no formal awards are listed, his work is cited across disciplines including: Political Analysis Econometrics Biostatistical Modeling Observational Study Design

Linyi LiView profile

Assistant Professor

• Deep learning
• Trustworthy machine learning
• Computer security
• +4 more

Linyi Li is an Assistant Professor in the School of Computing Science at Simon Fraser University (SFU), leading the Trustworthy Artificial Intelligence (TAI) Lab. His research focuses on certifiably trustworthy deep learning systems, combining machine learning and computer security. He holds a PhD from the University of Illinois Urbana-Champaign (UIUC) and a B.Eng. from Tsinghua University. Affiliations: Simon Fraser University, TAI Lab Education: PhD in Computer Science, UIUC, 2023 B.Eng (Cum Laude), Tsinghua University, 2018 His research interests include deep learning , trustworthy machine learning , large language models , and software engineering . He emphasizes rigorous certification of robustness, fairness, and numerical reliability in AI systems. Recent work includes the InfiBench benchmark for evaluating code LLMs and advancements in neural network verification. Recent Research Trends: His publications span certified robustness, fairness guarantees, and scalable verification techniques for deep learning models. He also explores scientific evaluation of foundation models and adversarial defense mechanisms. Awards: Rising Stars in Data Science AdvML Rising Star Award Wing Kai Cheng Fellowship Finalist: Qualcomm Innovation Fellowship (2022) Winner: VNN-COMP'23 Competition (Team α, β-CROWN) Advising & Grants: As a PI, he oversees the TAI Lab's research. Though no specific grants are listed, his work is funded through competitive awards and university resources. Labs/Teams: Leads the TAI Lab at SFU, focusing on foundational and applied research in trustworthy AI.

Harri LähdesmäkiView profile

Associate Professor

• Probabilistic Machine Learning
• Deep Generative Models
• Artificial Intelligence
• +4 more

Harri Lähdesmäki is an Associate Professor (tenured) at the Department of Computer Science, Aalto University, where he leads the Computational Systems Biology research group. His work focuses on probabilistic machine learning and deep generative models with applications in biomedicine and molecular biology. Key Research Interests: Probabilistic machine learning, deep generative models, computational biology, bioinformatics, longitudinal data modeling Contact: harri.lahdesmaki@aalto.fi | Konemiehentie 2, 02150 Espoo, Finland His recent publications highlight advancements in: Gaussian process priors for scalable deep generative models Single-cell analysis of immune repertoires in leukemia and diabetes Probabilistic deconvolution methods for RNA-seq data Epigenetic analysis using hidden Markov and mixed models Transformer-based survival prediction and missing data handling Harri’s work integrates mechanistic modeling with Bayesian inference, particularly applied to immunology, cancer biology, and early disease prediction.

• Virology
• Molecular Biology
• Genomics
• +6 more

James Van Etten is the William Allington Distinguished Professor of Plant Pathology at the University of Nebraska-Lincoln, affiliated with the School of Biological Sciences and Nebraska Center for Virology. His research focuses on chloroviruses—large dsDNA viruses infecting Chlorella-like algae—with emphasis on DNA replication, restriction systems, and membrane transport proteins. Key research themes include: Viral DNA modification systems Host-virus interactions Structural virology Evolution of organellar genomes Recent work analyzed: SMRT sequencing of viral methylation patterns Chlorovirus cryopreservation methods Potassium channel biophysics Host chemical signaling mechanisms Lab webpage: vanettenlab.unl.edu

Nils HolzenbergerView profile

Assistant Professor

• Natural Language Processing
• Artificial Intelligence
• Legal AI
• +3 more

Nils Holzenberger is an Assistant Professor at Télécom Paris, France, since February 2023, affiliated with the Data Intelligence Graphs (DIG) research team within the Information Processing and Communication Laboratory (LTcI). His work bridges artificial intelligence, natural language processing, and legal domains through neuro-symbolic approaches to statutory reasoning, particularly in tax law. Education: PhD in Computer Science, Johns Hopkins University (2017-2022) Master's in Engineering, Mines ParisTech (2013-2017) Preparatory Classes, Lycée Louis-le-Grand (2011-2013) Holzenberger's research centers on legal artificial intelligence with emphasis on statutory reasoning limitations in large language models. He pioneered the SARA dataset for tax law reasoning and LegalBench benchmark, developing hybrid symbolic-neural frameworks that expose LLMs' shortcomings in precise legal interpretation. His work integrates Prolog solvers with NLP techniques to create executable tax code mappings and contract analysis tools, establishing foundational methods for verifiable legal AI systems. Analysis of his 15 most recent publications (2019-2024) reveals three dominant research thrusts: (1) Tax law reasoning benchmarks exposing LLM hallucinations, (2) Neuro-symbolic integration for statutory interpretation, and (3) Low-resource template extraction for legal documents. His work consistently demonstrates that pure neural approaches fail at precise legal reasoning, necessitating symbolic grounding for reliable legal AI applications. The DIG research team at Télécom Paris, where Holzenberger leads legal AI initiatives, is actively hiring faculty for neuro-symbolic projects. While specific grant details aren't public, his collaborations with HEC Paris, Copilex startup, and featured podcast appearances indicate substantial industry-academia engagement in legal tech development. Holzenberger directs the legal AI vertical within LTcI's DIG team, focusing on data intelligence for statutory reasoning. His group develops tools for tax minimization strategy discovery, contract analysis, and legal information extraction, maintaining close ties with legal practitioners through projects like the Prolog-based tax code interpreter. The team's infrastructure supports both academic research and startup partnerships in computational law.

Karoline FaustView profile

Associate Professor

• Microbial community dynamics
• Microbial systems biology
• Bioinformatics
• +6 more

Karoline Faust is an Associate Professor at KU Leuven, affiliated with the Laboratory of Molecular Bacteriology (Rega Institute) and the Faculty of Medicine . She contributes to the iSi Health and Leuven One Health institutes, and serves on senior academic councils. Her research spans microbial systems biology, focusing on community dynamics and network analysis. Education: PhD in bioinformatics (2010, KU Leuven) Affiliations: KU Leuven, ISME Journal editorial board, Belgian Society for Microbiology Her research investigates microbial community dynamics , systems biology approaches to microbiomes, and bioinformatics tool development . She specializes in modeling human gut microbiota , synthetic microbial communities , and environmental microbiomes (e.g., microplastic impacts on Daphnia microbiomes). Her work integrates metabolic modeling , network analysis , and experimental systems to understand microbial interactions. Recent publications highlight her contributions to microbial network inference , 16S rRNA sequencing protocols , microfluidics , and ecological modeling of microbiomes. She develops tools like manta , miaSim , and CoNet to analyze community structures. Teaching: Karoline co-teaches courses in microbiology, bioinformatics, and network analysis at KU Leuven, and has contributed to international workshops on microbial network inference. Scientific Engagement: She serves as Senior Editor at ISME Journal and Secretary of the Belgian Society for Microbiology .