Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.
Renjie Feng is a Research Fellow in Mathematics and AI at the School of Mathematics and Statistics and the Sydney Mathematical Research Institute , University of Sydney. His work bridges probability theory, statistics, and applications in machine learning, deep learning, and artificial intelligence. His research interests focus on probability theory and its applications to machine learning , random matrix theory , and statistical physics . He investigates extreme value problems, spectral properties of random matrices, and topological features of random fields over Riemannian manifolds. Recent publications highlight trends in random matrix theory (GUE, GOE, GSE), extreme gap problems , determinantal point processes , and Wiener chaos . Collaborative works with F. Götze, D. Yao, and R. Adler emphasize U-statistics , multivariate linear statistics , and random topology inspired by Poisson point process studies.
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.
Kenneth McLaughlin is the Evelyn and John G. Phillips Distinguished Chair in Mathematics at Tulane University's School of Science & Engineering. He holds a Ph.D. and B.A. in Mathematics from New York University (1994 and 1989). Prior to Tulane, he served as faculty at the University of North Carolina, Chapel Hill, the University of Arizona, Universidade Federal de Brasília, and Colorado State University, where he also held leadership roles as Department Head and Chair. His research focuses on integrability, applying techniques across mathematics to study complex systems and phenomena. He has held visiting positions at institutions worldwide, including France, Italy, Brazil, Belgium, and the UK. McLaughlin’s research spans integrable systems, nonlinear dynamics, and asymptotic analysis. His work often involves the Riemann-Hilbert problem approach, orthogonal polynomials, and random matrix theory. Notable contributions include studies on soliton gases, the KdV equation, and universality in quantum operator dynamics. His recent articles explore topics such as asymptotic behavior of polynomials, soliton gas condensation, and hydrodynamic limits in integrable systems. McLaughlin’s academic career is marked by interdisciplinary collaboration and international research engagement.
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. 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.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Kurt Johansson is a Full Professor of Mathematics at KTH Royal Institute of Technology, Sweden. His academic journey includes roles as Associate Professor at KTH (1993-2001) and Uppsala University (1988-1993), alongside research funded by the Swedish Natural Science Research Council (1998-2003). His primary affiliations are within the Department of Probability, Mathematical Physics & Statistics at KTH, where he also coordinates courses on Differential Equations and Fourier Analysis. Education: BSc in Physics (1982) and PhD in Mathematics (1988), both from Uppsala University. Research interests focus on Probability Theory , Mathematical Physics , and Random Matrix Theory , with contributions to stochastic models, determinantal processes, and universality in statistical mechanics. Key Awards: Wallenberg Prize (1995), Rollo Davidson Prize (2000), Göran Gustafsson Prize (2002), Fellow of the American Mathematical Society (2012), and multiple Wallenberg Scholar grants (2011-2023). Grants: Major funding from the Swedish Research Council (VR), K&A Wallenberg Foundation, and others. His research group explores Random Matrices, Stochastic Models, and Analysis , with notable work on the Arctic Circle Theorem and KPZ universality class. Recent publications analyze Brownian directed percolation and domino tilings of the Aztec diamond, reflecting his focus on interdisciplinary applications of probability and mathematical physics.
Jon Keating is a Professor at the University of Oxford affiliated with the Mathematical Institute . His research spans Mathematical Physics , Number Theory , and Stochastic Analysis , with a focus on Random Matrix Theory and its applications to quantum systems and number theory. Research Trends: His recent work explores connections between random matrices and number-theoretic functions, with contributions to understanding moments of L-functions, characteristic polynomials, and quantum chaos. Key themes include asymptotic analysis, recursive structures, and interdisciplinary applications in nonlinear systems. Publications: Highlights include studies on CUE characteristic polynomials, the Ratios Conjecture, and collaborations in Nonlinearity , International Mathematics Research Notices , and Transactions of the American Mathematical Society .
Andrea Montanari is a Professor of Mathematics and Statistics at Stanford University, affiliated with the Department of Mathematics and Statistics. His research focuses on high-dimensional statistics, machine learning theory, optimization algorithms, and statistical physics, with applications to neural networks and complex systems. He has contributed extensively to understanding generalization in overparametrized models, spin glass theory, and algorithmic methods like approximate message passing. His work bridges theoretical computer science and mathematical physics, addressing challenges in data analysis and learning from high-dimensional datasets. Notable themes include analyzing neural network dynamics, optimizing high-dimensional landscapes, and developing efficient algorithms for sparse and low-rank matrix estimation. Montanari’s publications explore topics such as the interplay between statistical and computational limits, the behavior of gradient-based methods, and the theoretical foundations of modern machine learning. His recent research demonstrates a focus on fundamental questions in learning theory, including the study of phase transitions in statistical estimation, the role of overparametrization in generalization, and the mathematical underpinnings of contemporary algorithms. While no specific awards are listed here, his contributions reflect significant impact in interdisciplinary fields.
Benjamin Landon is an Assistant Professor in the Department of Mathematics at the University of Toronto, where he has been faculty since 2021. His office is located in the Bahen Centre for Information Technology, Room 6264. Prior to joining the University of Toronto, he was a CLE Moore Instructor at the Massachusetts Institute of Technology from 2018-2021. Education: PhD in Mathematics, Harvard University (2018). Advisor: Horng-Tzer Yau M.Sc. in Mathematics, McGill University (2013). Advisors: Vojkan Jaksic and Robert Seiringer B.Sc., McGill University (2012) Dr. Landon's research focuses on Probability and Mathematical Physics, with particular expertise in Random Matrix Theory. His work spans various aspects of spectral statistics, eigenvalue distributions, and universality phenomena in random matrix ensembles. He has made significant contributions to understanding the behavior of extremal eigenvalues, linear spectral statistics, and connections to other areas of mathematical physics such as spin glasses and the KPZ universality class. His research often involves developing novel analytical techniques to establish precise asymptotic behavior in complex random systems. Analysis of Dr. Landon's publication record reveals a strong focus on the intersection of probability theory and mathematical physics. His work consistently explores universality phenomena across different random matrix ensembles and related stochastic systems. A notable trend is his investigation of connections between random matrix theory and other areas of mathematical physics, particularly spin glass models and the KPZ equation. His research demonstrates both technical depth in establishing rigorous asymptotic results and breadth in connecting seemingly disparate areas of mathematical physics.
Jan de Gier is a Professor at the School of Mathematics and Statistics, The University of Melbourne . He is also the Founding Director of MATRIX , Australia’s residential research institute in the mathematical sciences, and a former Deputy Director and Chief Investigator in the Australian Research Council Centre of Excellence for Mathematical and Statistical Frontiers (ACEMS) . Additionally, he co-founded the Australian and New Zealand Association for Mathematical Physics (ANZAMP) in 2011 and served as its inaugural Chair. His research focuses on solvable lattice models at the intersection of mathematical physics and statistical mechanics . Key areas include the application of quantum integrability , algebraic structures like the Yang-Baxter equation, Hecke algebras, and quantum groups, as well as analytical methods such as complex analysis and elliptic curves. His work bridges pure and applied mathematics through connections between enumerative combinatorics , representation theory , and real-world phenomena like traffic flow modeling via exclusion processes . The 15 most recent articles reflect his expertise in integrable systems , non-equilibrium statistical mechanics , and algebraic combinatorics . Topics span Macdonald polynomials , stochastic duality , quantum spin chains , and traffic modeling , with methodologies involving matrix product forms , exact solutions , and critical phenomena analysis. He has contributed to editorial efforts through the AustMS Gazette and MATRIX Annals, and has been involved in public science communication via opinion pieces on mathematics funding and applications. His work emphasizes the importance of fundamental research in driving technological innovation, as highlighted in media articles discussing pi calculation , zero-knowledge proofs , and mathematics education .
Melanie Weber is an Assistant Professor of Applied Mathematics and Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), leading the Geometric Machine Learning Group. Her research focuses on leveraging geometric structures in data for designing efficient machine learning and optimization algorithms with theoretical guarantees. She holds a PhD from Princeton University (2021) and has held fellowships at the Mathematical Institute of Oxford, Brasenose College, and the Simons Institute. Her work bridges geometry, optimization, and machine learning, with funding from NSF, Sloan Foundation, and Harvard initiatives. Education : PhD in Applied Mathematics, Princeton University (2021) BSc/MSc in Mathematics and Physics, University of Leipzig (2016) Research Interests : Dr. Weber's research integrates geometric principles into machine learning and optimization, focusing on non-Euclidean spaces, graph structures, and manifold-based methods. Key areas include optimization on Riemannian manifolds, curvature-based analysis (e.g., Ricci curvature), and developing algorithms resilient to data geometry challenges like over-smoothing in graph neural networks. Her work emphasizes theoretical foundations while addressing practical scalability in high-dimensional data. Awards & Recognition : 2024 Sloan Research Fellowship 2023 Leslie Fox Prize in Numerical Analysis 2023 NSF Grant for Geometric Optimization Grants & Funding : Supported by National Science Foundation (NSF), Alfred P. Sloan Foundation, Aramont Foundation, Harvard Dean’s Fund, and Harvard Data Science Initiative. Labs & Collaborations : Leads the Geometric Machine Learning Group at SEAS, collaborating with institutions like MIT, Max Planck Institute, and industry labs (Facebook, Google, Microsoft). Active in organizing workshops on geometric methods and curvature analysis.
Steven N. Evans is a Distinguished Professor at the University of California, Berkeley , affiliated with the Department of Statistics and the Center for Computational Biology . With over three decades of service since 1987, his work bridges probability theory , stochastic processes , and their applications in mathematical biology , computational genetics , and phylogenetics . His research spans: Probability on Algebraic Structures , including random matrices and local fields. Measure-Valued Processes and coalescent models in population genetics. Phylogenetic Inference in historical linguistics and ecology. Stochastic Models for gene expression, fitness landscapes, and mutation-selection balance. Markov Processes and their applications in phylodynamics. Recent publications highlight his contributions to phylogenetic networks , Frechet mean sets , and Levy process analysis , with keywords spanning Probability , Computational Biology , and Population Genetics . He has mentored 10 PhD students, including Boyan Xu (2024) and Nicholas Bhattacharya (2022). His email is evans@stat.berkeley.edu .
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
