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.
Adrian Weller is a prominent researcher and academic at the University of Cambridge, serving as a Director of Research in Machine Learning within the Department of Engineering. He holds multiple significant leadership roles including Programme Director for Trust and Society at the Leverhulme Centre for the Future of Intelligence (CFI), and previously served as Programme Director for AI at The Alan Turing Institute, the UK national institute for data science and AI. His work bridges theoretical machine learning research with practical applications and societal implications of artificial intelligence. Weller's research interests span a broad spectrum of AI and machine learning topics with a particular focus on ensuring beneficial societal outcomes. His work encompasses explainability, fairness, robustness, scalability, privacy, safety, and ethics in AI systems. He has made significant contributions to trustworthy machine learning, including developing frameworks for AI governance, certification, and human-AI collaboration. His research group actively investigates neuro-symbolic approaches, privacy-preserving techniques, and methods for improving the reliability and interpretability of AI systems. His recent publications demonstrate a strong trend toward addressing the practical challenges of deploying AI systems in real-world contexts, particularly focusing on certification frameworks, governance mechanisms, and human-centered approaches. His work spans theoretical advances in machine learning architectures while maintaining a strong connection to societal impact, with publications appearing in top venues across AI, machine learning, and interdisciplinary applications. Scientific Awards: MBE for services to digital innovation (2022 Queen's Birthday Honours) Turing AI Fellowship for Trustworthy Machine Learning Weller actively supervises a large group of PhD students and postdocs, with current students including Juyeon Heo, Yanzhi Chen, Katie Collins, Isaac Reid, Yichao Liang, Herbie Bradley, and Shoaib Siddiqui. His former students have gone on to positions at leading institutions including Google DeepMind, ETH Zurich, NYU, and MPI-IS Tübingen. He has served on numerous advisory boards including the Centre for Data Ethics and Innovation, UNESCO's expert group on AI ethics, and the World Economic Forum's Global Future Council on AI. His research has been supported through his Turing AI Fellowship and various collaborative projects focused on safe and ethical AI development. Weller leads a vibrant research group focused on trustworthy machine learning, which actively organizes workshops and conferences including ICML 2024 (where he served as Program Chair), multiple workshops on responsible AI, and events through the ELLIS network. His group collaborates extensively across disciplines, working with researchers in computer science, social sciences, law, and policy to address the multifaceted challenges of developing beneficial AI systems.
Tomaso Aste is a Professor of Complexity Science at the Department of Computer Science, University College London (UCL). He founded the Financial Computing and Analytics group and co-founded the UCL Centre for Blockchain Technologies. His work bridges complex systems, data science, and finance, with applications in blockchain, fintech, and market modeling. Education: PhD in Physics (Politecnico di Milano, 1994); Laurea in Physics (University of Genoa, 1990) Prior Appointments: Reader at University of Kent's School of Physics; Associate Professor at Australian National University's Applied Mathematics His research focuses on data-driven modeling of complex systems , particularly financial systems, complex networks, and statistical physics. He has pioneered information filtering networks and topological machine learning methods for financial applications, including portfolio optimization, risk assessment, and cryptocurrency analysis. Recent publications highlight his expertise in financial time-series analysis, blockchain technology, and AI-driven modeling. Articles explore topics like limit order books, cryptocurrency market fragility, and topological neural networks. His work has influenced regulatory technology (RegTech) frameworks and digital economy strategies. Scientific Awards : Marie Curie Individual Fellowship University of Genoa graduate study specialization Fellowship Bacheflor Boncompagni-Ludovisi Foundation Fellowship Awarded fellowships from European Commission and academic foundations support his interdisciplinary research. He has held editorial roles at journals like Philosophical Magazine and Granular Matter , and contributed to professional societies including American Physical Society and Australian Research Council panels. Teaching & Academic Leadership : Co-created four UCL Master's programs: Financial Risk Management, Computational Finance, Financial Technologies, Emerging Digital Technologies Coordinates executive training on AI, blockchain, fintech, and regtech for regulators and private firms Teaches graduate-level courses in Data-Driven Modeling, Data Science, and Advanced AI
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.
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.
Osman Yağan is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University (CMU), with affiliate faculty status in the School of Computer Science. He is also a core member of CyLab Security and Privacy Institute. Prior to joining CMU in 2013, he was a Postdoctoral Research Fellow at CyLab. He holds a Ph.D. in Electrical and Computer Engineering from the University of Maryland (2011) and a B.S. from Middle East Technical University (2007). His research focuses on modeling, analysis, and optimization of computing systems, leveraging applied probability, network science, data science, and machine learning. Key areas include multi-armed bandits, resilient machine learning, contagion processes in networks, and cybersecurity. Research Interests include Machine Learning, Data Science, Network Science, Cybersecurity, and Robustness in Cyber-Physical Systems. He has advised numerous students, including current PhD candidates Yurun Tian, Orkun İrsoy, and Ishank Juneja, as well as notable alumni such as Mansi Sood (now at MIT) and Jun Zhao (Assistant Professor at Nanyang Technological University). Key Awards include the CIT Dean's Early Career Fellowship, IBM Academic Award, and Best Paper Awards at ICC 2021, IPSN 2022, and ASONAM 2023. His work spans theoretical contributions (e.g., contagion models in multi-layer networks) and applied research (e.g., mitigating cascading failures in power systems). He leads or co-leads grants from ONR, NSF, and ARO, focusing on resilient machine learning, network robustness, and pandemic modeling.
Bei Wang Phillips is an Associate Professor in the School of Computing and a faculty member at the Scientific Computing and Imaging (SCI) Institute at the University of Utah. She holds a Ph.D. in Computer Science from Duke University and an undergraduate degree from the University of Bridgeport. Her research focuses on Topological Data Analysis (TDA), data visualization, computational topology, and machine learning, with applications in scientific data exploration and analysis. She has received prestigious awards including the NSF CAREER Award (2022) and the PECASE Award (2025). Her work spans projects funded by NSF, NIH, and DOE, including multiparameter TDA and topology-aware data compression. She advises numerous students and collaborates on interdisciplinary initiatives in astrophysics, climate science, and AI fairness. Education: Ph.D. in Computer Science, Duke University (2010) B.S. in Computer Science and Mathematics, University of Bridgeport (2003) Research Interests: Topological techniques for large-scale data analysis Integration of topological, geometric, and machine learning methods Applications in visualization, bioinformatics, and network analysis Key Projects: NSF-funded TDA research (DMS-2301361, OAC-2313124) DOE project on topology-preserving data compression Collaborations with NASA, Argonne National Lab, and Carnegie Institution of Washington Awards: Presidential Early Career Award for Scientists and Engineers (2025) NSF CAREER Award (2022) DOE Early Career Research Program (2020) Advising and Grants: Mentored over 30 students and postdocs Recipient of multiple NSF and DOE grants totaling millions
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 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.
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.
Pierre Vandergheynst is a Full Professor at the Swiss Federal Institute of Technology Lausanne (EPFL) in the Department of Electrical Engineering, with a courtesy appointment in Computer and Communication Sciences. He serves as EPFL’s Vice-Provost for Education since 2015 and leads the Signal Processing Laboratory 2 (LTS2). His research spans harmonic analysis, sparse approximations, mathematical data processing, and applications in signal/image processing, computer vision, machine learning, and graph-based data analysis. PhD in Mathematical Physics (1998), Université catholique de Louvain Postdoctoral Researcher at EPFL (1998-2001) Assistant Professor at EPFL (2002-2007) His research explores geometry/symmetry in high-dimensional data, redundant dictionaries for dimensionality reduction, and computational harmonic analysis on manifolds. Recent work focuses on protein structure modeling, geometric deep learning, and graph-based signal processing. Key article trends include graph neural networks for protein analysis, geometric deep learning in neuroscience, and structured knowledge priors in neural models. His 2023-2025 publications emphasize interpretable AI, long-range dependencies in graphs, and molecular representation learning. Scientific Awards: IEEE Signal Processing Magazine Best Paper Award (2023) Signal Processing Society Best Paper Award (2022) Apple ARTS Award (2007) De Boelpaepe Prize, Royal Academy of Sciences of Belgium (2009-2010) He has supervised over 30 PhD theses and contributed to foundational work in graph signal processing, compressive sensing, and geometric deep learning. His lab develops tools for data science on non-Euclidean structures, with applications in medicine, astronomy, and wireless systems.
Ali H. Sayed is the Dean of the School of Engineering (Faculté des sciences et techniques de l'ingénieur - STI) at École Polytechnique Fédérale de Lausanne (EPFL), Switzerland, where he also directs the Adaptive Systems Laboratory (Laboratoire de systèmes adaptatifs). Previously, he served as an emeritus professor and chair of the Electrical Engineering Department at UCLA. He is a highly cited researcher and a member of the US National Academy of Engineering and the World Academy of Sciences. Sayed served as president of the IEEE Signal Processing Society in 2018 and 2019. Professor Sayed's research focuses on adaptation and learning theories, data and network sciences, statistical inference, multi-agent systems, adaptive networks, and optimization. His work bridges theoretical foundations with practical applications in signal processing, machine learning, and network science. He has made significant contributions to distributed learning algorithms, social learning over networks, and adaptive signal processing techniques that have influenced both academic research and practical implementations. His recent publications demonstrate a strong focus on multi-agent systems, distributed learning, privacy-preserving techniques, and social learning over networks. The research trends show increasing emphasis on federated learning with privacy guarantees, graph-based learning approaches, and the intersection of social dynamics with information processing. His work consistently addresses fundamental theoretical questions while maintaining relevance to practical applications in communication networks, social media analysis, and distributed artificial intelligence systems. Professor Sayed has received numerous prestigious awards throughout his career, including: IEEE Fourier Award (2022) Norbert Wiener Society Award (2020) IEEE Signal Processing Society Education Award (2015) Papoulis Award from the European Association for Signal Processing (2014) Technical Achievement Award from IEEE Signal Processing Society (2012) Terman Award from the American Society for Engineering Education (2005) IEEE Donald G. Fink Prize (1996) Multiple Best Paper Awards from IEEE and EURASIP Sayed has authored or co-authored over 570 publications and six monographs. He has mentored numerous PhD students and researchers in the fields of signal processing and adaptive systems. His editorial leadership includes serving as Editor-in-Chief of IEEE Transactions on Signal Processing (2003-2005) and EURASIP Journal on Advances in Signal Processing (2006-2007), as well as Founding Editor-in-Chief of the Open Access Book Series on Information and Learning Sciences. At EPFL, Professor Sayed leads the Adaptive Systems Laboratory, which focuses on developing theoretical frameworks and practical algorithms for adaptive systems, networked learning, and distributed signal processing. The lab's research encompasses both fundamental theoretical investigations and applications to real-world problems in communications, social networks, and computational biology.
Prof. David Kerr is a Professor at the University of Münster's Department of Mathematics, within the Faculty of Mathematics and Computer Science. His research focuses on operator algebras, ergodic theory, and mathematical physics. He has contributed to projects such as the CRC 1442 on entropy and group dynamics, and has organized conferences including 'Group Actions: Dynamics, Measure, Topology' in 2022. His work spans topics like C*-algebras, sofic groups, and dynamical systems. Education: Not explicitly detailed in the text, but his career indicates advanced training in mathematics. Research Interests: Operator algebras, ergodic theory, entropy theory, and their applications to group actions and dynamical systems. Grants/Projects: Involved in CRC 1442 projects D04 and D05, exploring entropy, C*-algebras, and dynamical tilings. Labs/Teams: Collaborates with researchers like Hanfeng Li and Robin Tucker-Drob on projects involving operator algebras and group dynamics.
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.
Sergio Bermudo Navarrete is a Professor at the Department of Economics, Quantitative Methods and Economic History, Universidad Pablo de Olavide. His research spans combinatorics, graph theory, and operator theory. Education: PhD in Mathematics (2003, University of Seville) with thesis on functional models of operators in Hilbert spaces. Research Interests: Focus on graph theory, domination problems, topological indices, and operator theory. Publication Trends: Recent work includes vertex-degree-based indices for oriented graphs, domination parameters in product graphs, and differential analysis of line graphs. Keywords span Computer Science , Mathematical Chemistry , and Operations Research . Collaborations: Frequent co-authors: José María Sigarreta Almira, José Manuel Rodríguez García, Juan Alberto Rodríguez-Velazquez. Contact: Email sbernav@upo.es .
