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 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 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.
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.
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 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ö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.
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 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.
Kazuhiro Saitou is a Professor of Mechanical Engineering at the University of Michigan, affiliated with the College of Engineering. His research focuses on computational design synthesis, topology optimization, and manufacturing process integration. He leads the Algorithmic Synthesis Laboratory (ASL), advancing algorithms for automated design and optimization of mechanical systems. Education: Ph.D. (1996), MIT; M.S. (1992), MIT; B.Eng. (1990), University of Tokyo. He has held tenured positions since 1997, including roles as Founding CEO of Comnext, Inc. (2007–2012) and visiting professorships at École Centrale Paris and Donghua University. Research interests include multi-material topology optimization (M^3 TO), AI-driven design, and sustainable manufacturing. Key projects address additive manufacturing, composite structures, and energy-efficient production systems. He has pioneered methods for manufacturability-driven design and assembly optimization. Notable awards include IEEE Fellow (2018), ASME Kos-Ishii Award (2015), and NSF CAREER Award (1999). He serves as Editor-in-Chief for IEEE Transactions on Automation Science and Engineering and holds leadership roles in ASME and IEEE societies. Teaching includes courses on design optimization, CAD, and global product development. His lab has advised over 30 students, with alumni in academia and industry. Current research explores biomechanical modeling, traffic flow optimization, and medical image registration algorithms.
Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.
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.
Ajit Rajwade is a Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay. His research spans Artificial Intelligence , Compressed Sensing , and Medical Imaging , with affiliations to the Centre for Machine Intelligence and Data Science and the Koita Centre for Digital Health . Education : PhD in Computer and Information Science and Engineering, University of Florida (2010) MSc in Computer Science, McGill University (2004) BTech in Computer Engineering, University of Pune (2002) His research interests focus on intelligent data acquisition, particularly in neural network analysis , graph signal processing , and medical imaging . He develops compressed sensing algorithms for inverse problems like tomography and MRI reconstruction , alongside applying group testing to pandemic response. Scientific awards include the Prof. S. P. Sukhatme Award (2024) and Departmental Teaching Excellence (2019). His publications demonstrate expertise in image restoration , noise modeling , and epidemiological algorithms . He has advised PhD students like Sabyasachi Ghosh and Jerin Geo James , with a focus on computationally efficient methods in medical imaging and machine learning .
Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.
Bradley Olsen is a Professor of Chemical Engineering at the Massachusetts Institute of Technology (MIT), holding the Alexander and I. Michael (1960) Kasser Chair in Chemical Engineering. He is affiliated with MIT's School of Engineering and directs research in the Plastics and the Environment Program. His academic career spans over two decades with numerous prestigious appointments and recognitions. Olsen earned his S.B. from MIT in 2003 followed by a Ph.D. from the University of California Berkeley in 2007. His educational background is complemented by postdoctoral fellowships including NIH and Beckman Institute Postdoctoral Fellowships (2008-2009) and the Hertz Fellowship (2003-2007). Research Interests Professor Olsen's research focuses on designing materials to address important challenges while understanding the fundamental science necessary for materials design. His primary research areas include block copolymers, soft condensed matter physics, protein-based materials, and bioelectronics. His group specializes in polymer networks, protein-polymer conjugates, self-assembly phenomena, and sustainable polymer development. The research has significant implications for biomaterials, sustainable polymers, and advanced materials design. Publication Trends Analysis of Professor Olsen's recent publications reveals a strong focus on polymer network topology, protein-polymer conjugates, and sustainable materials. His work increasingly integrates computational methods with experimental approaches, particularly in polymer characterization and data science applications to materials science. Recent publications show growing emphasis on biodegradable polymers, polymer informatics, and biomedical applications of advanced materials. Scientific Recognition Professor Olsen has received numerous prestigious awards throughout his career, including: American Physical Society (APS) Fellow (2023) Fulbright Amazonia Scholar (2023) Alexander and I. Michael Kasser Chair in Chemical Engineering (2021) ACS Macro Letters/Biomacromolecules/Macromolecules Young Investigator Award (2021) AIChE Owens Corning Early Career Award (2019) American Physical Society Dillon Medal (2018) Alfred P. Sloan Research Fellow in Chemistry (2014) Advising and Funding Professor Olsen has secured significant research funding from multiple federal agencies including NSF, NIH, AFOSR, and DOE. His group has produced numerous high-impact publications across top journals in polymer science, materials science, and chemistry. He has advised multiple graduate students and postdoctoral researchers who have gone on to successful careers in academia and industry. The MIT OGE's Committed to Caring Honor (2019) recognizes his excellence in graduate student mentoring. Research Infrastructure Professor Olsen leads a research group with capabilities spanning polymer synthesis, protein engineering, materials characterization, and computational modeling. His lab maintains strong collaborations with other MIT departments, national laboratories, and international research institutions. The group participates in several interdisciplinary initiatives including the Plastics and the Environment Program and has developed significant data infrastructure for polymer science through projects like CRIPT and BigSMARTS.
