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.

Kevin JamiesonView profile

Associate Professor

• Machine Learning
• Active Learning
• Multi-Armed Bandits
• +4 more

Kevin Jamieson is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering and an Adjunct Professor in the Department of Statistics at the University of Washington . His academic journey includes a B.S. (2009) , M.S. (2010) , and Ph.D. (2015) in electrical engineering from the University of Washington, Columbia University, and University of Wisconsin–Madison respectively. He completed a postdoc at UC Berkeley's AMP Lab before joining UW in 2017. Ph.D., Electrical Engineering, University of Wisconsin–Madison (2015) M.S., Electrical Engineering, Columbia University (2010) B.S., Electrical Engineering, University of Washington (2009) Jamieson's research lies at the intersection of interactive machine learning , active learning , and sequential decision making . His work focuses on: Adaptive sampling strategies in multi-armed bandits and reinforcement learning (RL) Developing instance-dependent optimal algorithms that adapt to problem difficulty Applications in robotics , human perception studies , and hyperparameter optimization Representation learning for large models and experimental design frameworks His 15 most recent publications (2025-2022) demonstrate expertise in bandit theory , contextual RL , and game-theoretic learning . Notable trends include sample-efficient optimization , adaptive A/B testing , and sim-to-real transfer in robotics. Jamieson has received: NSF CAREER award for foundational contributions Amazon Faculty Research award for innovation in learning systems He actively recruits graduate students and postdocs , emphasizing collaboration in areas like: Multi-agent RL and strategic actor learning Empirical process suprema and adaptive sampling theory Applications in robotics , large language model finetuning , and biomedical data analysis Jamieson leads the Washington AI Lab (WAIL) and develops open-source learning systems like the NEXT framework for real-world adaptive data collection. He serves as co-PI for the Institute for the Foundations of Data Science (IFDS) and co-organizes the Distinguished Seminar in Optimization & Data .

Benjamin Van RoyView profile

Professor

• Reinforcement Learning
• Machine Learning
• Artificial Intelligence
• +4 more

Benjamin Van Roy is a Professor at Stanford University since 1998, affiliated with the Departments of Electrical Engineering and Management Science and Engineering, and the Institute for Computational and Mathematical Engineering. He leads the Efficient Agent Team at Google DeepMind and previously held leadership roles at Morgan Stanley, Unica, and Enuvis. He holds SB, SM, and PhD degrees in Computer Science and Electrical Engineering from MIT, advised by John Tsitsiklis. His research focuses on reinforcement learning, alignment, and information theory, with contributions to machine learning foundations, optimization, and finance. He has authored over 150 publications, including influential works on Thompson Sampling, approximate dynamic programming, and exploration strategies. His honors include INFORMS and IEEE Fellowships and the INFORMS Lanchester Prize. Van Roy advises doctoral students across academia and industry, with graduates at top institutions and companies like Meta, Tesla, and Citadel. He teaches courses on reinforcement learning, stochastic control, and optimization. His open-source projects include Epistemic Neural Networks and the Neural Testbed for evaluating machine learning models. Key contributions include foundational work in reinforcement learning theory, scalable methods for recommendation systems, and applications in finance and resource allocation. His research bridges theoretical insights with practical applications, emphasizing alignment and safety of AI systems.

David B. ShmoysView profile

Professor

• Operations Research
• Computer Science
• Optimization
• +4 more

David B. Shmoys is the Laibe/Acheson Professor of Business Management & Leadership Studies at Cornell University's School of Operations Research and Information Engineering (ORIE) and holds a joint appointment in the Department of Computer Science. He is a leading researcher in approximation algorithms, stochastic optimization, and computational sustainability. His work emphasizes data-driven decision-making in enterprise and society, with applications ranging from healthcare logistics to environmental conservation. Shmoys has advised 27 Ph.D. students and served as an editorial board member for top journals like Operations Research and Mathematics of Operations Research. Education: Ph.D. in Computer Science, University of California, Berkeley (1984). Postdoctoral positions at MSRI and Harvard University, followed by faculty roles at MIT before joining Cornell. Research Interests: Design and analysis of approximation algorithms for NP-hard problems, stochastic optimization, scheduling, facility location, and inventory management. Applications include computational sustainability, epidemiological modeling, and political districting optimization. Articles Trends: Focus on optimization under uncertainty, computational sustainability, and real-world applications like air ambulance routing, bike-sharing systems, and gerrymandering analysis. Notable works include the 2018 Wagner Prize-winning paper on bike-sharing analytics and the 2013 Lanchester Prize-winning textbook on approximation algorithms. Awards: Lanchester Prize (2013), Daniel H. Wagner Prize (2018), Fellowships from ACM, INFORMS, and SIAM, NSF Presidential Young Investigator (1987). Advising & Grants: Over 27 advised Ph.D. students, with former students at MIT, Waterloo, Brown, and D-Wave. Active in grants related to data science and sustainability. Labs/Teams: Involved in the Institute of Computational Sustainability at Cornell, focusing on applying algorithms to environmental challenges. Collaborates with organizations like Motivate (bike-sharing) and Ornge (air ambulance services).

Sicun GaoView profile

Associate Professor

• Algorithms and Optimization
• Automated Reasoning
• Cyber-Physical Systems
• +3 more

Sicun Gao is an Associate Professor in the Computer Science and Engineering department at the University of California, San Diego. His research focuses on practical algorithms for NP-hard search and optimization problems in computational systems, emphasizing combinatorial perspectives in numerical and statistical contexts to achieve reliable autonomy. Research Interests: Automated reasoning, Hamilton-Jacobi reachability, safe reinforcement learning, control barrier functions, and optimization in cyber-physical systems. Teaching: Courses on AI search, optimization, and graduate research seminars. The 15 most recent publications highlight advancements in safe AI control, motion planning, and policy optimization, often integrating neural networks with formal verification. Awards include the IEEE Power & Energy Society Technical Committee Prize Paper Award and the IROS RoboCup Best Paper Award. He advises PhD students working on AI-driven control and robotics, with alumni placed at institutions like Seoul National University, Amazon, and Apple. Grants include NSF Career, Air Force Young Investigator, and DARPA Assured Autonomy funding. His lab develops tools like dReal for automated reasoning in nonlinear theories over the reals.

• Nanotechnology
• Materials Science
• Photovoltaics
• +4 more

Professor Thomas Bein is affiliated with the Department of Chemistry at Ludwig-Maximilians-Universität München (LMU) , where he leads the Functional Nanosystems research group. His work focuses on synthesizing and characterizing nanostructured materials with applications in energy, catalysis, and biomedical delivery. Mesoporous nanoparticles for drug delivery Semiconductor nano-morphologies for photovoltaics Photoelectrochemical water splitting Metal-organic frameworks (MOFs) Electroactive networks His research emphasizes atomic-scale control of material architectures using self-assembly, hydrogen bonding, and covalent interactions, enabling precise tuning of electronic, optical, and catalytic properties. A review of his recent publications reveals cutting-edge investigations into covalent organic frameworks (COFs), perovskite-inspired solar materials, and functional nanoparticle systems. Key trends include optimizing energy conversion efficiency, enhancing stability in optoelectronic devices, and exploring bio-compatible nanocarriers for targeted therapies. Professor Bein’s group actively contributes to interdisciplinary projects at the intersection of chemistry, physics, and biomedical engineering, with ongoing collaborations in solar energy, sustainable materials, and nanomedicine.

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.

• Applied Topology
• Dynamical Systems
• Algebraic Topology
• +5 more

Robert Ghrist is the Andrea Mitchell University Professor at the University of Pennsylvania with dual appointments in the Department of Mathematics and the Department of Electrical and Systems Engineering. He serves as Associate Dean for Undergraduate Education for Penn Engineering. His educational background includes a B.S. in Mechanical Engineering from the University of Toledo (1991), and M.S. and Ph.D. degrees in Applied Mathematics from Cornell University (1994, 1995). Ghrist's research bridges pure and applied mathematics, focusing on applied algebraic topology , dynamical systems , and geometric methods in data science. His work extends to network theory, topological data analysis, and computational geometry, with applications spanning robotics, neuroscience, and social dynamics. Key innovations include developing sheaf-theoretic approaches for networked systems and persistence homology techniques for high-dimensional data. Analysis of his recent publications reveals a strong emphasis on lattice-theoretic frameworks , topological robotics , and network dynamics , with emerging applications in neural data interpretation and geometric computing. His research consistently integrates category theory with real-world engineering challenges. Significant scientific recognition includes: Presidential Early Career Award (PECASE, 2004) Scientific American 'Top 50' Research Leader (2007) Mathematical Association of America's Chauvenet Prize (2013) University of Pennsylvania Lindback Award for Distinguished Teaching (2015) DoD National Security Science and Engineering Faculty Fellowship (NSSEFF, 2015) Ghrist leads multiple federally funded research initiatives supported by AFOSR, DARPA, NSF, and ONR. He directs the development of educational tools including the Calculus BLUE/GREEN Project video series and custom GPTs for mathematical pedagogy. His open online courses have reached over 100,000 learners globally.

Caglar GulcehreView profile

Assistant Professor

• Reinforcement Learning
• Foundation Models
• Large Language Models
• +6 more

Caglar Gulcehre is a Tenure Track Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL) and Principal Investigator of the CLAIRE (Caglar Gulcehre Laboratory of Artificial Intelligence Research) lab. Previously, he worked as a Staff Research Scientist at Google DeepMind, Microsoft Research, and IBM Research. His research focuses on reinforcement learning , foundation models , LLM alignment , and sequence modeling . Current Position : Assistant Professor, EPFL Lab : CLAIRE Lab Previous Roles : Staff Research Scientist at DeepMind, MSR, IBM Research His work spans reinforcement learning , deep learning , and neural architecture design , with a focus on safety , trustworthy AI , and real-world applications . He has published in top venues including Nature , NeurIPS , ICML , and JMLR . Scientific contributions include: Best paper award at NeurIPS Nonconvex Optimization workshop Honorable mention for best paper at ICML 2019 Co-organizer of seven workshops at NeurIPS, ICML, and ICLR He supervises PhD students in areas related to AI for algorithm discovery , neural architectures , and foundation models , including: Skander Moalla Justin Samuel Deschenaux Liangze Jiang Xiuying Wei Yitao Xu

Paul GölzView profile

Assistant Professor

• Social Choice Theory
• Algorithmic Fairness
• AI Ethics
• +3 more

Paul Gölz is an Assistant Professor at Cornell University's School of Operations Research and Information Engineering (ORIE), with affiliations in Computer Science. His research focuses on computational social choice, algorithmic fairness, and AI ethics, addressing topics like democratic innovation, fair resource allocation, and AI systems for diverse users. Education: Undergraduate studies at Saarland University (Germany), PhD in Computer Science from Carnegie Mellon University, followed by postdoctoral research at Harvard University, UC Berkeley, and the Simons Laufer Mathematical Sciences Institute. His work has been recognized with awards including the JPMorgan Chase AI Research Fellowship (2021) and honorable mentions for prestigious dissertation awards (Dantzig and ACM SIGecom). Research Highlights : Developed Panelot, a tool for selecting citizens' assemblies using state-of-the-art algorithms. His work on fair refugee resettlement and apportionment methods has been featured in Operations Research and Nature . Recent projects include AI alignment distortion analysis and generative social choice mechanisms. Teaching : Teaches Optimized Democracy (Spring 2025) and Mathematical Programming (Fall 2024). Supervises PhD students in ORIE, focusing on interdisciplinary applications of optimization and social choice. Awards & Grants : Received a $40K Structural Democracy Fellowship (Crankstart) and an OpenAI grant for Democratic Inputs to AI. Active in policy briefs (e.g., mini-public selection strategies). Labs/Tools : Co-developed Panelot.org , a nonprofit platform for fair citizen assembly selection. Active in open-source tool development for social choice applications.

Clifford SteinView profile

Professor

• Algorithms
• Combinatorial Optimization
• Operations Research
• +4 more

Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.

Suhas DiggaviView profile

Professor

• Information Theory
• Machine Learning
• Differential Privacy
• +9 more

Suhas Diggavi is a Professor in the Department of Electrical and Computer Engineering at the University of California, Los Angeles, within the Henry Samueli School of Engineering and Applied Science. His primary research area is Signals and Systems, with a strong focus on information theory and its interdisciplinary applications. His research interests span Information Theory , Machine Learning , Differential Privacy , Federated Learning , Cyber-Physical Systems , and Bio-informatics . He investigates fundamental limits and practical algorithms for secure, efficient, and robust data processing in distributed and networked environments. The recent publications highlight a strong trend in privacy-preserving machine learning, particularly in the shuffled model of differential privacy , communication-efficient distributed SGD , and robust optimization . His work bridges theoretical information-theoretic foundations with real-world applications in federated learning, wireless networks, and genomic data analysis. Notable scientific awards include: Guggenheim Foundation Fellow (2021) ACM CCS Best Paper Award (2021) IEEE Fellow (2013) IEEE Donald G. Fink Prize Paper Award (2006) Multiple Google, Amazon, and Facebook Research Awards Suhas Diggavi actively advises graduate students and leads a research group focused on learning, information, and optimization. His work is supported by major industry grants and collaborations, particularly in privacy and distributed learning. He has made significant contributions to information-theoretic models in bio-sequencing and wireless security. He leads the LIOS (Learning, Information, Optimization, and Stochastic Systems) research group at UCLA, where his team develops theoretical frameworks and practical algorithms for next-generation data-driven systems.

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.

Paul GoldbergView profile

Professor

• Algorithmic Game Theory
• Computational Complexity Theory
• Machine Learning
• +3 more

Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.

Lijie ChenView profile

Assistant Professor

• Theoretical Computer Science
• Computational Complexity Theory
• Quantum Complexity Theory
• +4 more

Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.