Tamara Broderick is an Associate Professor in the Department of Electrical Engineering and Computer Science at MIT, specializing in machine learning and statistics. Her research focuses on developing methods for uncertainty quantification in data analysis, Bayesian nonparametrics, and scalable inference algorithms. She leads a research group advising PhD students and postdocs in statistical machine learning. Her work spans Bayesian modeling, variational inference, spatial statistics, and applications in epidemiology and environmental science. Recent projects involve uncertainty-aware forecasting, robustness analysis of statistical methods, and efficient algorithms for high-dimensional inference. Broderick teaches Bayesian Modeling and Inference and contributes to MIT's statistics and data science initiatives.
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.
Neil Olver is an Associate Professor in the Department of Mathematics at the London School of Economics and Political Science (LSE), where he has held his current position since 2021. He is also affiliated with CWI in Amsterdam. His research focuses on combinatorial optimization, network design, algorithmic game theory, and probability, with applications to traffic networks and robust optimization. Olver has organized major events such as the Highlights of Algorithms conference and the Hausdorff Trimester Program on Discrete Optimization. He completed his PhD in Applied Mathematics at McGill University (2010), preceded by an MSc (2006) and BSc (2004) from the University of Cape Town and McGill University. His academic career includes roles at Vrije Universiteit Amsterdam (2013–2021) and MIT (2010–2013). Olver has been awarded grants from NWO (VIDI, TOP, VENI) and the NSF, supporting research on network optimization and robust design. His notable contributions include resolving the VPN Conjecture, advancing strongly polynomial algorithms for generalized flows, and analyzing dynamic traffic equilibria. Students advised include Dr. Dario Frascara and Dr. Madelon de Kemp. Current grants include a VIDI-funded project on 'Usable Algorithms for Network Design.'
Prof. Igors Gorbovickis is an Associate Professor of Mathematics at the Department of Mathematics, School of Computer Science and Engineering, Constructor University (formerly Jacobs University Bremen). His research focuses on complex dynamical systems, including topics such as renormalization theory, bifurcation analysis, Julia sets, and applications to mathematical physics. He also contributes to discrete geometry, particularly exploring conjectures like the Kneser-Poulsen problem. His work bridges pure mathematics with interdisciplinary applications, emphasizing rigorous analysis of nonlinear systems and geometric configurations. Key areas of investigation include critical point accumulations, Hausdorff dimension estimates, and equidistribution phenomena in parameter spaces. Recent publications highlight advancements in understanding chaotic systems, circle maps, and the interplay between algebraic structures and dynamical behavior. Prof. Gorbovickis collaborates internationally, with co-authored papers appearing in journals like Advances in Mathematics , Ergodic Theory and Dynamical Systems , and Nonlinearity . His office is located at Research I, Room 128 on the Constructor University campus in Bremen, Germany.
Kenneth J. Falconer is the Regius Professor of Mathematics at the University of St Andrews, where he is a member of the School of Mathematics and Statistics and the Analysis Research Group. He has held prestigious positions at the University of Bristol and Corpus Christi College, Cambridge, and has been a visiting professor at institutions including Oregon State University and the Australian National University. Regius Professor of Mathematics, University of St Andrews (2017–present) Professor of Mathematics, University of St Andrews (1993–2017) Reader, University of Bristol Lecturer, University of Bristol Research Fellow, Corpus Christi College, Cambridge His research centers on fractal and multifractal geometry, geometric measure theory, and related fields. He has made seminal contributions to the understanding of fractal projections, dimensional analysis of self-affine sets, and fractal processes. His work includes the concept of the digital sundial and the introduction of the affinity dimension and Falconer’s distance problem. His research spans dimensional analysis, random fractals, PDEs on fractal domains, and combinatorial geometry. The most recent publications show a sustained focus on intermediate dimensions, projections of fractal sets and measures, and the dimensional properties of stochastic processes. His work frequently involves collaboration with leading mathematicians and appears in top journals such as Transactions of the American Mathematical Society , Ergodic Theory and Dynamical Systems , and Journal of Fractal Geometry . Fellow of the Royal Society of Edinburgh (1998) Shephard Prize, London Mathematical Society (2020) CBE, King’s New Year’s Honours (2024) Kenneth Falconer has supervised numerous students and collaborated with many researchers including Jonathan Fraser, Pertti Mattila, and Xiong Jin. He has served on editorial boards for Fractals , Journal of Fractal Geometry , and Mathematical Proceedings of the Cambridge Philosophical Society . He has been active in professional service, including as Chair of the British Mathematical Colloquium 2018 and Publications Secretary of the London Mathematical Society (2006–2009). He organized major programs at the Isaac Newton Institute and Mittag-Leffler Institute. He is also known for his involvement in the Long Distance Walkers Association, where he served as Chairman and Editor of Strider , and for his mathematical poetry featured in publications like the London Mathematical Society Newsletter .
John MacLaren Walsh is a Professor in the Department of Electrical and Computer Engineering at Drexel University, where he leads the Adaptive Signal Processing and Information Theory Research Group. He holds BS, MS, and PhD degrees from Cornell University, all completed under Dr. C. Richard Johnson, Jr. His research spans information theory, network coding, distributed computing, and machine learning applications in patent analysis. His work focuses on: Bounding entropic vectors and their impact on communication networks Rate region computation for network coding and distributed storage Information theory for distributed function computation Machine learning-enhanced patent processing systems Publications emphasize entropy geometry, network coding complexity, distributed algorithms, and patent analysis, with consistent themes of optimization and combinatorial methods. Recent work (2016-2019) shows increased focus on probabilistic supports and computational efficiency in network coding. Awards: 2011 NSF CAREER Award for 'Entropy Geometry in Variational Inference Signal Processing' He has advised PhD students on topics like entropy region mapping, network coding, and distributed control. Key grants include NSF CAREER and AFOSR funding for wireless network overhead control. He directs the Adaptive Signal Processing and Information Theory Research Group, which develops algorithms for network coding, distributed storage, and patent analysis systems.
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.
Gil Kalai is a Professor of Mathematics at the Hebrew University of Jerusalem since 1992, where he holds the Henry and Manya Noskwith Chair. He also serves as an Adjunct Professor of Mathematics and Computer Science at Yale University since 2004 in a long-term part-time visiting position. His academic career includes visiting positions at prestigious institutions including MIT, Cornell, IAS Princeton, Berkeley, Bell-labs, IBM, and Microsoft. Professor Kalai's research spans multiple areas within mathematics and theoretical computer science. His work in combinatorics encompasses geometric, probabilistic, and topological approaches. He has made significant contributions to the study of convex sets and polytopes, linear programming, and theoretical computer science. His influential 1988 paper with Kahn and Linial on Boolean functions pioneered applications of Fourier analysis in theoretical computer science. Kalai's research has evolved to include the application of Fourier analysis to thresholds, influences, symmetries, noise, percolation, and social choice. He has developed theories in algebraic shifting and studied face-numbers and other combinatorial invariants of polytopes. His work on the diameter of polytopes and randomized simplex algorithms has been influential in optimization theory. In 1993, his collaboration with Kahn produced a groundbreaking counterexample to Borsuk's Conjecture in 1325 dimensions. Professor Kalai's publications reveal a consistent focus on the intersection of combinatorics, geometry, and theoretical computer science. His work shows a progression from foundational combinatorial geometry to increasingly sophisticated applications of harmonic analysis in discrete mathematics. The recurring themes across his 30+ year career include Boolean functions, polytope theory, and probabilistic methods in combinatorics, demonstrating remarkable coherence in his research trajectory. 2016 European congress of Mathematics, plenary speaker 2013 ERC advanced grant 2012 Rothschild Prize 1994 International Congress of Mathematicians invited section talk, Zurich 1994 Fulkerson Prize 1993 Erdos Prize 1992 Polya Prize Though specific details of his advising are not provided in the source material, Kalai has written over 70 scientific papers and maintains an active research blog entitled "Combinatorics and More." His 2013 ERC advanced grant indicates significant research funding for his work. His extensive collaborations with researchers across multiple institutions suggest a robust research program with numerous PhD students and postdoctoral researchers, though specific names are not mentioned in the provided texts. Professor Kalai maintains active research connections across multiple institutions including Hebrew University, Yale, and various research centers worldwide. His work bridges pure mathematics and theoretical computer science, creating a unique interdisciplinary research environment that influences both fields.
Paata Ivanisvili is an Associate Professor at the University of California, Irvine (UCI), Department of Mathematics, School of Physical Sciences. His research focuses on Analysis, Probability, Harmonic Analysis, and Functional Analysis, with a particular emphasis on isoperimetric inequalities, functional inequalities, and discrete structures such as the Hamming cube. He has held visiting positions at institutions including the Hausdorff Research Institute for Mathematics and Princeton University. Ivanisvili has organized conferences such as the Dual Trimester Program at the Hausdorff Institute on Boolean Analysis in Computer Science (2024) and annual Summer/Fall Schools since 2021. He earned his PhD in Mathematics from Michigan State University (2015) and a BS from Saint Petersburg State University (2011). His research interests include sharp inequalities in analysis (e.g., Poincaré, Beckner, Ehrhard), hypercontractivity, and applications to discrete mathematics and probability. He has collaborated with prominent mathematicians such as Fedor Nazarov, Alexander Volberg, and Roman Vershynin. Notable awards include the NSF CAREER Award (2021–2025) and Simons Fellowship in Mathematics (2025–2026). Ivanisvili’s recent work explores the interface between harmonic analysis and discrete mathematics, including studies on additive energies, convex hulls of space curves, and learning theory. His articles frequently address foundational questions in geometric functional analysis, often using tools like Bellman functions and optimal control theory. He actively advises PhD students and has mentored visiting researchers at UCI.
Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.
Prof. Dennis Komm is an Associate Professor at ETH Zurich's Department of Computer Science, leading the group for Algorithms and Didactics. He chairs the Center for Computer Science Education (ABZ) and serves on committees such as the Swiss Maturity Board (Schweizerische Maturitätskommission) and the STEM Commission of the Swiss Academies. Previously, he held roles at RWTH Aachen University (Master's, 2008), ETH Zurich (PhD, 2012), University of Zurich (external lecturer, 2014–2020), and PH Graubünden (including department head and professor of 'Fachdidaktik Informatik'). Education: He completed a Master's in Computer Science at RWTH Aachen (2008), a PhD at ETH Zurich (2012), and studies in Information Technology at Queensland University of Technology (2006). His academic journey includes visiting roles at King's College, Stanford, and Comenius University. He has taught extensively across institutions, emphasizing Python and LOGO-based approaches for beginners. Research focuses on algorithm design, approximation algorithms, reoptimization, and advice complexity in theoretical CS. His work in education explores computational thinking, programming pedagogy (especially for K–12), and interdisciplinary approaches (e.g., robotics in math). Recent trends in his articles highlight advancements in online algorithms, optimization under dynamic conditions, and initiatives to integrate CS into Swiss school curricula sustainably. He actively promotes CS education through platforms like WebTigerPython and collaborates on projects such as CyberQuest and MINTerlink. His outreach includes organizing conferences (e.g., STIU 2025) and workshops on programming and cybersecurity for teachers and students. Despite no listed scientific awards, his contributions to education and theoretical CS are recognized through editorial roles in journals like Informatics in Education and contributions to the TigerJython Group. Grant-related advising includes co-supervising doctoral theses on robotics, USOs, and programming didactics. He advocates for equitable educational opportunities via the Passerelle exam and the Swiss Beaver Competition. His team's work spans teacher training, didactic certifications, and bridging university-school collaborations through initiatives like MINTerlink. Labs and teams: Head of ABZ (ETH's CS education center), collaborator with the Computational Robotics Lab, and part of the TigerJython Group. He also co-organizes the Colloquium on Mathematics, Computer Science, and Education with ETH's Mathematics Department.
Tamás Budavári is an Associate Professor in the Department of Applied Mathematics and Statistics at Johns Hopkins University (JHU), with joint appointments in Physics and Astronomy and a secondary appointment in Computer Science. He is affiliated with the Whiting School of Engineering and the Institute for Data-Intensive Engineering and Science (IDIES). His research focuses on computational and statistical methods for big data in astronomy and interdisciplinary applications such as urban blight analysis. Education: PhD in Astrophysics (2001), Eötvös Loránd University, Budapest Master’s in Theoretical Physics (1997), Eötvös Loránd University Research Interests: Budavári develops algorithms for handling large astronomical datasets, including Bayesian inference, streaming algorithms, and GPU-accelerated processing. His work includes SkyQuery (an online astronomy data tool), photometric redshift estimation, and cross-matching catalogs. He also applies computational methods to urban planning, such as optimizing strategies to address vacant housing in Baltimore City. Publications & Tools: Budavári’s recent work spans topics like deep learning for astronomical image restoration, combinatorial optimization for urban policy, and probabilistic catalog matching. His tools, such as CUDAHM and NWAY, enable scalable analysis of multi-epoch survey data and N-way catalog cross-identification. Awards & Grants: Recipient of the Gordon and Betty Moore Fellowship and SAMSI Research Fellowship Funded by NSF, STScI, NIH, and others Leadership & Outreach: He serves on the Steering Committee of the 21st Centuries Cities Initiative and is a founding editor of the Journal of Astronomy and Computing. His interdisciplinary work bridges astrophysics, data science, and urban systems.
Aaron Smith is an Associate Professor in the Department of Mathematics and Statistics at the University of Ottawa, affiliated with the Faculty of Science. He holds a PhD from Stanford University. His research focuses on applied probability, computational statistics, Monte Carlo methods, and Markov chains, with an emphasis on advancing theoretical understanding and practical applications of these methodologies. Dr. Smith's work includes contributions to community detection algorithms, Markov chain mixing times, and synthetic health data generation. His recent publications explore topics such as nonstandard Dirichlet form representations, perturbation analysis of MCMC algorithms, and sparse Bayesian multidimensional scaling. He advises students in applied probability and has supervised postdoctoral researchers in related fields. His research interests span a wide range of topics, including stochastic processes, statistical inference, and algorithm design. He is particularly known for his analysis of convergence rates in Markov chains and the development of efficient sampling techniques for complex models. His interdisciplinary work bridges theoretical mathematics and practical computational challenges in data science and healthcare. Dr. Smith collaborates on projects involving synthetic data frameworks for privacy-preserving applications and has contributed to foundational work on mixing times and perturbation effects in stochastic systems.
LEE Wee Sun is a Professor in the Department of Computer Science at the National University of Singapore (NUS), where he previously served as Head of Department, Vice Dean of Undergraduate Studies, and Vice Dean of Research. His academic journey began with a B.Eng. in Computer Systems Engineering from the University of Queensland (1992) and a Ph.D. from the Australian National University (1996), followed by research roles at the Australian Defence Force Academy and MIT. Education: Ph.D., Australian National University, Canberra, Australia (1996) B.Eng. in Computer Systems Engineering, University of Queensland, Brisbane, Australia (1992) Research Focus: Professor Lee pioneers work in Machine Learning , Planning Under Uncertainty , and Approximate Inference , with emphasis on integrating AI subfields for holistic reasoning. His current projects include "Learning to Decompose for Reasoning and Planning" (enhancing LLMs via self-supervised problem decomposition) and "Learning to Reason with Visual-Linguistic Inputs" (unifying vision, language, and reasoning in single architectures). Publication Trends: Recent work (2023-2025) centers on bridging LLMs with classical AI techniques, featuring breakthroughs in uncertainty quantification, multi-task optimization, and graph-based reasoning. Key themes include sparsity-aware vehicle routing, epistemic uncertainty for reliable LLMs, and differentiable neural solvers for combinatorial problems. Awards: IJCAI-JAIR Best Paper Prize (2022) RSS Test of Time Award (2021) RoboCup Best Paper Award (IROS 2015) HRATC 1st Place (2015) IPPC POMDP Track 1st Place (2011, 2014) UAI Google Best Student Paper (2014) Semeval-1 1st/2nd Place (2007) J.G. Crawford Prize (ANU 1996) Leadership & Service: As steering committee chair for ACML and area chair for NeurIPS/ICML/AAAI/IJCAI, Professor Lee shapes global AI discourse. His administrative roles at NUS and collaborations with MIT/Singapore-MIT Alliance demonstrate commitment to advancing AI education and research infrastructure. While student advisees aren't listed, his leadership positions imply extensive mentoring. Research Ecosystem: His work drives NUS's AI initiatives including Knowledge@Computing projects on reasoning frontiers. Current efforts focus on making AI systems robust through uncertainty-aware planning and multi-modal integration, with applications in robotics, verification systems, and combinatorial optimization.
