Find Academic Supervisors

Daniel M. KaneView profile

Professor

• Number Theory
• Combinatorics
• Complexity Theory
• +3 more

Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.

Junjian QiView profile

Associate Professor

• Electric power systems
• Cascading failure
• Microgrid control
• +2 more

Junjian Qi serves as the Hohbach Endowed Associate Professor in the Department of Electrical Engineering and Computer Science at South Dakota State University's College of Engineering, holding this position since 2023. His academic journey includes prior appointments as Assistant Professor at Stevens Institute of Technology (2020-2023) and University of Central Florida (2017-2020), along with research roles at Argonne National Laboratory and University of Tennessee. His educational background includes: Ph.D. in electrical engineering from Tsinghua University, Beijing, China (2013) B.E. in electrical engineering from Shandong University, Jinan, China (2008) Dr. Qi's research centers on electric power systems resilience, with particular expertise in cascading failure mechanisms, microgrid control architectures, cyber-physical security vulnerabilities, and synchrophasor applications. His work integrates advanced data analytics and machine learning techniques to enhance grid stability against extreme weather events and cyber threats. Current investigations focus on developing distributed control strategies for inverter-dominated grids and modeling system interdependencies during failure propagation. Analysis of his 15 most recent publications (2021-2024) reveals a strong methodological shift toward data-driven approaches for power system challenges. Key trends include machine learning applications for cascading failure prediction, novel distributed control frameworks for AC/DC microgrids, and cybersecurity enhancements for inverter-based resources. His work consistently bridges theoretical models with real-world utility data, particularly evident in multiple Best Paper Award-winning publications analyzing actual outage sequences. Dr. Qi's scientific recognition includes: NSF CAREER Award (2020) Three consecutive Best Paper Awards at IEEE PES General Meetings (2022-2024) World's Top 2% Scientist designation in energy (2020-2023) IEEE PES Outstanding Working Group Award (2023) Multiple journal Best Paper Awards (IEEE Transactions on Power Systems, Journal of Modern Power Systems) He currently leads significant research initiatives including an NSF CAREER project ($500k) on cascading failure analysis and an NSF collaborative grant ($219k) for grid stability, alongside previous DOE funding ($1.8M) for cybersecurity of distributed energy resources. His service includes editorial roles for IEEE Transactions on Power Systems and IEEE Power Engineering Letters, plus leadership in IEEE PES technical committees focused on voltage control and smart grid security.

Kostas BekrisView profile

Professor

• Robotics
• Artificial Intelligence
• Computer Vision
• +7 more

Kostas Bekris is a Professor in the Department of Computer Science at Rutgers University, specializing in Robotics and Artificial Intelligence. His research focuses on motion planning, autonomous manipulation, and robot control, with notable contributions to tensegrity robotics, perception-driven systems, and large-scale package handling. He leads a team conducting groundbreaking work in robotics, supported by grants from NSF, NASA, and industry collaborators like ExxonMobil. His group emphasizes interdisciplinary approaches, combining machine learning, topological methods, and differentiable physics modeling to advance robot capabilities in complex environments. Education details are not explicitly stated in the provided texts, but his academic career has included significant mentorship of PhD students and postdoctoral researchers. Key projects involve vision-driven manipulation pipelines, obstacle detection systems (PROBE), and resilient robot designs inspired by biological structures. He has been recognized for his work through prestigious awards including the NASA Early Career Grant and multiple NSF grants, as well as team achievements in robotics competitions like the Amazon Picking Challenge. Research interests span robotics subfields such as: Autonomous manipulation in cluttered environments Learning-based control for dynamic systems Topological data analysis for motion reasoning Tensegrity and soft robotics architectures Sim-to-real transfer in robotic tasks His team's work has produced open-source software tools and datasets, advancing benchmarks in manipulation and perception. Recent articles emphasize scalable solutions for industrial automation and robust navigation strategies in unstructured settings. Scientific achievements include: Development of PROBE for proprioceptive obstacle detection Advances in differentiable physics engines for tensegrity systems NSF-funded projects on robotic rearrangement and modular morphologies Advising contributions span over a decade, with current advisees focusing on topics like non-prehensile manipulation and large-scale storage optimization. Collaborations with industry (e.g., ExxonMobil) and academic partners (Yale University) reflect his commitment to applied robotics research. Labs and teams under his leadership include the Rutgers CS Robotics Group, contributing to projects like the ARIAC challenge platform and packing/industrial automation systems. Future work targets improved robot resilience in disaster scenarios and enhanced human-robot collaboration paradigms.

• Artificial Intelligence
• Machine Learning
• Medical Imaging
• +3 more

Professor Daniel Rueckert is a leading academic in Artificial Intelligence and Medical Imaging, holding dual positions at Imperial College London (as Professor of Visual Information Processing) and Technical University of Munich (Alexander von Humboldt Professor for AI in Medicine and Healthcare). He obtained his MSc from Technical University Berlin (1993) and PhD from Imperial College London (1997), followed by postdoctoral work at King’s College London. At Imperial, he led the Department of Computing (2016–2020) and founded the Biomedical Image Analysis group. His research focuses on AI-driven medical image analysis, including algorithms for image reconstruction, registration, and clinical decision support. His research interests span AI applications in healthcare, machine learning for medical imaging, and computational methods for clinical diagnostics. Notable contributions include over 500 publications and 60+ PhD graduates, with key works in federated learning, cardiac motion analysis, and biomarker development. Awards include the Leibniz Prize (2025), Royal Academy of Engineering Fellowship (2015), and multiple ERC grants. He leads the BioMedIA research group and is an editorial board member of Medical Image Analysis . Recent publications highlight advancements in AI-driven medical imaging, such as secure federated learning frameworks and deep learning models for disease prediction. His work bridges academic and industrial sectors through initiatives like IXICO, an Imperial spin-out. Current affiliations include roles at both Imperial and TUM, emphasizing interdisciplinary collaboration in healthcare technology. Advising and grants: Supervised over 60 PhD students and 40 post-docs. Secured grants including ERC Synergy (2013) and ERC Advanced (2020). Active in labs focused on biomedical image computing and AI in healthcare systems. Collaborative efforts include the BioMedIA group and TUM’s AI initiatives. Labs/teams: Leads the Biomedical Image Analysis group at Imperial and the TUM AI in Medicine team. Collaborates extensively on projects like cardiac imaging analysis and federated learning for healthcare.

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.

• Trustworthy Machine Learning
• Conformal Prediction
• Explainable Artificial Intelligence
• +2 more

Henrik Boström is a Professor of Computer Science specializing in Data Science Systems at the Division of Software and Computer Systems, KTH Royal Institute of Technology. His research focuses on trustworthy machine learning , with emphasis on conformal prediction (for confidence-calibrated predictions) and explainable AI . He is the developer of Python packages crepes (conformal classifiers/regressors) and xrf (explainable random forests). His primary research domains include: Developing robust methods for uncertainty quantification in predictive models Creating interpretable machine learning frameworks Optimizing ensemble techniques for high-dimensional data Applying ML to healthcare informatics and industrial diagnostics Analysis of his recent publications reveals strong emphasis on: (1) advancing conformal prediction theory for trustworthy AI, (2) enhancing interpretability of complex models like random forests and GNNs, and (3) developing efficient algorithms for uncertainty-aware learning in domains including healthcare, graph data, and high-dimensional regression. He serves as examiner for multiple degree projects and teaches courses including Programming for Data Science (ID2214) and Research Methodology and Scientific Writing (II2202) . He leads development of open-source tools for conformal prediction and model interpretation.

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.

Karsten BorgwardtView profile

Professor

• Machine Learning
• Systems Biology
• Bioinformatics
• +3 more

Karsten Borgwardt is a Professor and Director of the Department of Machine Learning and Systems Biology at the Max Planck Institute of Biochemistry. He holds a PhD in Computer Science (2007) from LMU Munich and has held academic positions at ETH Zürich, Universität Tübingen, and the Max Planck Institutes in Tübingen. His research focuses on machine learning applications in biology and medicine, including biomarker discovery, personalized medicine, and systems biology. Education: PhD in Computer Science (2007), LMU Munich M.Sc. in Biology (2003), University of Oxford Diplom (M.Sc. equivalent) in Computer Science (2004), LMU Munich Research Interests: Development of machine learning algorithms for large biomedical datasets Pattern recognition in genomic and clinical data Applications in sepsis biomarkers, antimicrobial resistance prediction, and personalized medicine Grants & Projects: Scientific Coordinator of Marie Curie Networks (2013-2022) Swiss National Science Foundation Starting Grant (2014) Personalized Swiss Sepsis Study (CHF 5.3M, 2018) Awards: Krupp Award (2013), Golden Owl Teaching Award (2017), multiple 'Top 40 under 40' recognitions (2014-2016). Labs: Leads the Machine Learning and Systems Biology Department at MPI, collaborating with 22+ labs in sepsis research and international networks.

Shirshendu GangulyView profile

Associate Professor

• Probability Theory
• Statistical Mechanics
• Markov Chains
• +3 more

Shirshendu Ganguly is an Associate Professor in the Department of Statistics at the University of California, Berkeley. His research focuses on probability theory, statistical physics, and their applications, including percolation models, phase transitions, Markov chains, and random graphs. He holds a PhD in Mathematics from the University of Washington and has held postdoctoral positions at UC Berkeley. Ganguly has been recognized with the 2019 Sloan Research Fellowship. Education: PhD in Mathematics, University of Washington, 2011–2016 Miller Postdoctoral Fellow, UC Berkeley, 2016–2018 Research Interests: Probability Theory, Statistical Mechanics, Markov Chains, Random Graphs, Percolation Theory, Sparse Combinatorial Structures His work explores geometric and probabilistic phenomena in disordered systems, including polymer models, self-organized criticality, and random matrix theory. He has advised multiple PhD students and contributes to teaching advanced probability courses at Berkeley. Awards: 2019 Sloan Research Fellowship

Aditya JoshiView profile

Senior Lecturer

• Natural Language Processing (NLP)
• Machine Learning
• Cybersecurity
• +4 more

Dr. Aditya Joshi is a Senior Lecturer in the School of Computer Science & Engineering at the University of New South Wales (UNSW). He specializes in Natural Language Processing (NLP), with a focus on sarcasm detection, dialectal NLP, and ethical AI applications in public health and cybersecurity. He joined UNSW in 2023 following industry roles at SEEK, Notiv, and Fractal Analytics, where he developed NLP systems for recommendation engines and meeting analytics. His research has garnered over 3,000 citations (h-index 26) and secured $3.1M in grants, including Defence Trailblazer and Google exploreCSR awards. Education: Joint PhD (2018) from IIT Bombay (India) and Monash University (Australia); MTech in CSE (2011) from IIT Bombay. Research Interests: Making NLP models robust for non-native English speakers and the LGBTI+ community, algorithmic enhancements to transformers, and applications in public health, cybersecurity, and societal issues. His work spans epidemic intelligence (collaborations with EPIWATCH and IFCYBER), cybersecurity tools like AuditNet, and inclusive AI initiatives such as queer-inclusive workshops funded by Google. He designed UNSW's new NLP course (COMP6713) and co-authored a Wiley textbook on NLP. Notable grants include the A$1.4M 'Comprehensive Defence Data Platform' (Lead CI) and A$92K Google exploreCSR grant for benchmarking dialectal sentiment. His awards include the Best PhD Thesis from IITB-Monash and Best Paper accolades at FAccT 2023 and MoMM 2020. He supervises projects on kernel-based attention reformulation, prompt-based sarcasm detection, and multilingual small-scale LLMs. His service roles include Executive Committee Member at ALTA and arXiv moderator for computational linguistics.

Chandra ChekuriView profile

Professor

• Theoretical Computer Science
• Design and Analysis of Algorithms
• Discrete and Combinatorial Optimization
• +6 more

Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.

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.

• Embedded Machine Learning
• High-Performance Computing
• Computer Architecture
• +6 more

Holger Fröning is a full professor at Heidelberg University’s Institute of Computer Engineering (ZITI), where he leads the Hardware and Artificial Intelligence (HAWAII) Lab. His research focuses on embedded machine learning , high-performance computing , and hardware-software co-design , with emphasis on resource efficiency, power optimization, and emerging architectures like analog , photonic , and resistive memory systems. He has held leadership roles including Managing Director of ZITI (2023–present) and Dean of Studies for Computer Science (2019–2022) , and has collaborated with institutions such as NVIDIA Research, Chinese Academy of Sciences, and Graz University of Technology. Research Trends : His recent publications explore Bayesian neural networks , green machine learning , analog computing noise mitigation , and GPU/FPGA optimization . Articles highlight photonic computing for AI , memory-efficient training , and hardware-aware DNN compression . Scientific Awards : 2025 HiPEAC Paper Award (Nature Computational Science) 2014 Google Faculty Research Award Multiple Best Paper Awards (IPDPS, ICPP, ECML-PKDD workshops) Leadership & Service : Organized workshops (WEML, ITEM, F4HD), chaired tracks at EuroPar and ISC, and served on program committees for ICPR, ECAI, and FPL. Education & Affiliations : PhD and MSc from University of Mannheim (2007/2001). Sponsors include DFG, FWF, FFG, NVIDIA, SAP, and XILINX.

Asaf FerberView profile

Assistant Professor

• Combinatorics
• Random Graphs
• Probabilistic Methods
• +1 more

Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.

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.