Find Academic Supervisors

Catherine GreenhillView profile

Professor

• Combinatorics
• Graph Theory
• Applied Probability
• +6 more

Professor Catherine Greenhill is a faculty member at the School of Mathematics and Statistics, UNSW Sydney , where she serves as Professor and head of the Combinatorics group. Her academic career spans institutions including the University of Queensland, University of Oxford, University of Leeds, University of Melbourne, and Australian National University. D.Phil., University of Oxford (1996) M.Sc. (Research) in Combinatorics (1992) B.Sc. (Hons) in Pure Mathematics (1991) Her research focuses on the intersection of discrete mathematics , theoretical computer science , and probability , particularly in asymptotic combinatorics , probabilistic methods , and analysis of algorithms . Her work includes asymptotic enumeration of combinatorial structures and design of randomized algorithms for graph sampling and counting. Her recent publications (2025–2021) center on random graphs and hypergraphs , with key contributions to switch Markov chains , degree sequence analysis , and chromatic number bounds . These works reflect her expertise in probabilistic combinatorics and algorithmic complexity . Scientific Awards: Fellow of the Australian Academy of Science (2022) Christopher Heyde Medal in Pure Mathematics (2015) June Griffith Fellowship (2013) Hall Medal (2010) Advising and Grants: She has supervised numerous PhD/Masters students and secured multiple ARC Discovery Grants (2019–2021, 2014–2016, 2012–2014). Her grants address topics like hypergraph modeling, random discrete structures, and network analysis in illicit drug trafficking.

Yee Whye TehView profile

Professor

• Statistical Machine Learning
• Probabilistic Learning
• Deep Learning
• +4 more

Yee Whye Teh is a Professor at the Department of Statistics, University of Oxford, and a research scientist at DeepMind. His work focuses on statistical machine learning, including probabilistic learning, Bayesian nonparametrics, deep learning, and Monte Carlo methods. He co-directs the ELLIS programme on Robust Machine Learning and has held roles such as Programme Co-chair for ICML 2017. Teh has delivered keynotes at UAI 2019, an IMS Medallion Lecture at JSM 2019, and the Breiman Lecture in 2017. His research emphasizes scalable inference algorithms, hierarchical models, and applications in genetics and natural language processing. Teh's educational background includes a PhD from the University of Toronto (2003) and a Master's from the same institution (2000). He has contributed to widely used software tools like the Sequence Memoizer and has been recognized for his work through prestigious lectureships. Research interests span Bayesian nonparametric models, MCMC methods, and their applications in genetics and data compression. His lab collaborates on projects like fragmentation-coagulation processes for genetic variation modeling and Mondrian forests for online learning. Teh advises students through Oxford's graduate programs, though he notes high demand for mentorship. His work often bridges theory and practice, addressing challenges in big data learning and small data problems.

Maya RamanathView profile

Associate Professor

• Database Systems
• Information Retrieval
• Semantic Web Data Management
• +3 more

Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.

Michael A OsborneView profile

Professor

• Machine Learning
• Bayesian Optimization
• Gaussian Processes
• +3 more

Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML

Daniel Dominic Kaplan SleatorView profile

Professor

• Algorithms
• Data Structures
• Theoretical Computer Science
• +5 more

Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.

Ewain GwynneView profile

Professor

• Probability Theory
• Liouville Quantum Gravity
• Random Planar Maps
• +7 more

Ewain Gwynne is a Professor of Mathematics at the University of Chicago, affiliated with the Committee on Computational and Applied Mathematics (CCAM) and the Statistics Department. He previously held postdoctoral positions at the University of Cambridge and earned his Ph.D. from MIT in 2018 under Scott Sheffield. His research focuses on probability theory, particularly random geometric structures in statistical mechanics, including Schramm-Loewner evolution (SLE), Liouville quantum gravity (LQG), and random planar maps. Education: Ph.D. in Mathematics, MIT (2018); M.Sc., MIT (2015); B.Sc., Northwestern University (2013). Research Interests: Random geometric objects in statistical mechanics Liouville quantum gravity and its metric properties Random planar maps and their scaling limits SLE and its relationship with LQG Random walks on random planar maps Percolation and permutons His recent articles explore topics such as supercritical LQG, Gaussian curvature on random maps, and harmonic balls in LQG. He has advised multiple Ph.D. students and serves as an associate editor for Probability and Mathematical Physics . His work bridges probability theory, geometry, and mathematical physics, with applications to understanding critical phenomena in random systems.

Annina IseliView profile

Lecturer

• Fractal Geometry
• Complex Dynamics
• Geometric Measure Theory
• +3 more

Annina Iseli is a Lecturer in the Department of Mathematics at École Polytechnique Fédérale de Lausanne (EPFL), affiliated with the College of Basic Sciences. She holds dual roles as both a Scientist and Lecturer, contributing to research and teaching within the Institute of Mathematics (MATH-GE). Her work bridges pure and applied mathematics, focusing on geometric and analytical properties of fractals. University: École Polytechnique Fédérale de Lausanne (EPFL) School: College of Basic Sciences Department: Institute of Mathematics (MATH-GE) Role: Lecturer and Scientist Research interests span multiple areas in mathematics: Fractal geometry and its connections to complex dynamics Geometric measure theory applications to projections in normed spaces Conformal and quasiconformal geometry Analysis in metric spaces Her publications include work on projection theorems, fractal dimensions, and hyperbolic space properties. She co-organizes the Quasiworld Seminar and EPFL Geometry Seminar, collaborating with researchers like Mario Bonk, Nicolas Monod, and Zoltán Balogh. Contact: annina.iseli@epfl.ch

Andrew ChildsView profile

Professor

• Quantum Algorithms
• Quantum Information Processing
• Quantum Simulation
• +2 more

Andrew Childs is a Professor at the University of Maryland, affiliated with the Department of Computer Science and the Institute for Advanced Computer Studies (UMIACS). He serves as Director of the NSF Quantum Leap Challenge Institute for Robust Quantum Simulation (RQS) and is a Fellow at the Joint Center for Quantum Information and Computer Science (QuICS). His research focuses on quantum algorithms for simulating physical systems, algebraic problems, and quantum walk protocols, with applications in quantum computing and computational complexity. University of Maryland Institute for Advanced Computer Studies (UMIACS) Joint Center for Quantum Information and Computer Science (QuICS) NSF Quantum Leap Challenge Institute for Robust Quantum Simulation Childs' research spans quantum simulation, quantum Fourier transform, phase estimation, and Hamiltonian dynamics. He has developed techniques to reduce quantum computational resources for simulating quantum systems and explored limitations of quantum computers through hidden subgroup problems and non-unitary dynamics. His publications cover diverse areas including quantum walk optimization, Hamiltonian simulation methods, and applications to cryptography and condensed matter physics. Recent works address spatial search algorithms, product formulas for commutators, and quantum routing protocols. As an educator, Childs has taught courses on quantum algorithms and information processing at both the University of Maryland and University of Waterloo, with lecture notes and materials spanning multiple years. Contact: amchilds@umd.edu | Office: ATL 3359 | Affiliated with University of Maryland's quantum research institutes.

Florian KerschbaumView profile

Professor

• Data security and privacy
• Confidentiality and integrity in data science
• Applied cryptography
• +4 more

Florian Kerschbaum is a Professor and NSERC/RBC Industrial Research Chair in Data Security at the Cheriton School of Computer Science, University of Waterloo. His research focuses on data security and privacy, applied cryptography, and confidentiality in data science. Research interests span data collection/preparation management, secure multi-party computation, homomorphic encryption, differential privacy, and machine learning robustness/privacy. His work develops cryptographic solutions for practical data management challenges in distributed systems.

Mohsen GhaffariView profile

Associate Professor

• Theoretical Computer Science
• Distributed Algorithms
• Parallel Algorithms
• +3 more

Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).

Nina GantertView profile

Professor

• Probability Theory
• Stochastic Processes
• Large Deviations
• +4 more

Prof. Dr. Nina Gantert is a distinguished Professor of Probability Theory at the Technical University of Munich (TUM) , affiliated with the TUM School of Computation, Information and Technology . She has held faculty positions at Karlsruhe Institute of Technology and the University of Münster prior to joining TUM in 2011. Her research focuses on probability theory , particularly stochastic processes , large deviations , and random media . She investigates random walks in random environments as models for transport in disordered systems and explores applications in physics and biology . Recent publications highlight her work on branching random walks , mixing times , biased random walks , and large deviation principles for complex stochastic systems. She has co-authored studies on random walks in dynamical percolation , interacting edge-reinforced processes , and extremal point processes in branching models. Scientific Awards: Elected fellow of the IMS (2016) Her academic career spans institutions including ETH Zürich, University of Bonn, Technical University of Berlin, and TUM. She has supervised numerous Bachelor’s and Master’s theses on topics ranging from mixing time analysis to percolation theory , often collaborating with international co-authors.

Ali VakilianView profile

Academic

• Algorithmic Foundations of Machine Learning
• Data Science
• Streaming Algorithms
• +18 more

Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.

Brett KolesnikView profile

Research Fellow

• Probability Theory
• Random Structures
• Bootstrap Percolation
• +4 more

Brett Kolesnik is a Research Fellow in the Department of Statistics at the University of Warwick. His research focuses on probability theory, random structures, bootstrap percolation, and interactions with combinatorics. He has held postdoctoral fellowships at UC Berkeley, San Diego, and the University of Oxford, and was a Senior Demy at Magdalen College. His work includes organizing workshops on bootstrap percolation and collaborating with leading researchers in probability and combinatorics. Education: PhD in Mathematics from the University of British Columbia (advised by Omer Angel). Notable awards include the NSERC Postdoctoral Fellowship and the Florence Nightingale Bicentennial Fellowship in Statistics. Research interests span bootstrap percolation models, random graph dynamics, and stochastic processes. Recent work includes studies on Brownian map geometry, tournament score sequences, and Coxeter group structures. Selected articles explore topics such as critical beta-splitting processes, Catalan percolation, and random walks on algebraic structures. His publications appear in top journals like Electronic Journal of Probability and Annals of Applied Probability . Awards include the Florence Nightingale Fellowship and NSERC Postdoctoral Fellowship. Professional involvement includes organizing the 2024 BIRS workshop on Bootstrap Percolation and contributing to interdisciplinary collaborations in probability and combinatorics.

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.