Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).
Ali Mostafazadeh is a Professor at the Department of Mathematics, College of Sciences, Koç University. His research spans Mathematical Physics, focusing on Quantum Mechanics, Scattering Theory, and PT-Symmetry. He has made significant contributions to understanding non-Hermitian Hamiltonians, electromagnetic wave propagation, and geometric scattering phenomena. Education: PhD in Physics (1994) from The University of Texas, BA in Physics and Mathematics (1989) from Boğaziçi University His work explores the intersection of mathematics and physics, particularly through spectral singularities, transfer matrix methods, and nonlinear optical systems. Recent publications highlight advancements in broadband directional invisibility, exact Born approximations, and time-dependent Hilbert spaces in quantum systems. 2011 Outstanding Success Award 2007 TÜBİTAK Science Award 2006 Werner-von-Siemens Excellence Award 2001 TÜBA Outstanding Young Scientists Award 2001 Parlar Foundation Research Incentive Award
David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.
Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .
Amir Ali Ahmadi is a Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE), with affiliations across multiple disciplines including PACM, Computer Science, Mechanical & Aerospace Engineering, Electrical Engineering, and the Center for Statistics and Machine Learning. He serves as Director of Princeton's Optimization and Quantitative Decision Science Certificate Program and has taken temporary roles at Citadel GQS (2021-2022) and Google Brain (2020-2021). His research bridges optimization theory , dynamical systems , and control theory , focusing on scalable algorithms for complex problems in robotics, autonomous systems, and machine learning. He has pioneered DSOS/SDSOS relaxations as alternatives to traditional sum-of-squares methods, enabling faster solutions through linear/second-order cone programming. Recent publications explore: Higher-order Newton methods for socially responsible investment Data-efficient learning of dynamical systems Computational complexity of local minima Robust-to-dynamics optimization frameworks Award highlights include: 2024 Egon Balas Prize in Optimization 2024 Princeton Engineering Council Teaching Award 2023 Distinguished Teaching Award (Princeton SEAS) 2019 NSF CAREER Award 2017 DARPA Young Faculty Award 2017 Sloan Fellowship in Computer Science He advises prominent researchers like Georgina Hall (Tucker Prize finalist) and Bachir El Khadir (Goldstine Fellow), and leads the Princeton Optimization Seminar and MURI project on Control-Oriented Learning on the Fly.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Dr. Primoz Skraba is a Professor in Applied and Computational Topology at the School of Mathematical Sciences, Queen Mary University of London. As Deputy Head of the Centre for Probability, Statistics and Data Science, he bridges theoretical topology with practical applications in data analysis, machine learning, and optimization. Education : PhD in Electrical Engineering from Stanford University (2009) Prior Roles : Positions at INRIA, France; Jozef Stefan Institute, Slovenia; University of Primorska; University of Nova Gorica His research focuses on applying topological methods to analyze complex data. Key areas include: Stability of persistence diagrams for quantitative control in finite sampling Variants of persistence (zig-zag, robustness, multiparameter) Algorithmic Complexity in computational topology Stochastic Topology for random geometric models (Poisson, Boolean) Recent publications emphasize persistent homology in random geometric complexes, universality theorems, and integrating topological methods into machine learning. He received grants from the Leverhulme Trust, EPSRC, and Alan Turing Institute for projects on topological universality and AI foundations. His advisee Gabryel Mason-Williams explores wireless sensor network applications of homology.
Adrian Lew is a Professor of Mechanical Engineering at Stanford University, specializing in computational solid mechanics and numerical algorithms. His research focuses on hydraulic fracturing simulation, embedded boundary methods, and material model design. He holds a PhD in Mechanical Engineering from Caltech (2003). His work bridges advanced numerical techniques with real-world applications in geophysics, material science, and structural engineering. Education: PhD, Mechanical Engineering, California Institute of Technology, 2003 Research Interests: Lew's group develops algorithms for time-integration embedded boundary methods and hydraulic fracturing simulations. Key areas include curvilinear crack propagation, universal meshing for complex geometries, and high-fidelity fracture mechanics. His work on variational integrators and discontinuous Galerkin methods has advanced computational efficiency in nonlinear elasticity and thermodynamics. Publications: Recent articles emphasize mesh optimization (DVRlib), fracture path instabilities, and magma chamber dynamics. His methodologies address challenges in 3D crack modeling, fluid-structure interaction, and high-order approximations in domains with singularities. Advising & Grants: Lew's research is supported by projects in computational geophysics and material science. Though no advisees are listed, his work involves collaborative teams focused on algorithmic innovation and high-performance computing.
John Baillieul is Distinguished Professor at Boston University with joint appointments in Mechanical Engineering, Systems Engineering and Electrical & Computer Engineering. He directs experimental laboratories for real-time control of lightweight robotic systems and applies nonlinear control theory to complex multi-body, networked, and bio-inspired systems. Education: Ph.D., Harvard University Research Interests: Baillieul’s work spans robotics, nonlinear control, and networked systems. Early contributions resolved motion-planning for kinematically redundant manipulators; current themes include neuromimetic learning, vision-based navigation, and resilience of infrastructure networks such as power grids. His group couples rigorous geometric control with real-time hardware to create lightweight, high-performance robots and to uncover fundamental information limits in feedback systems. Recent Publication Trends (2021-2025): Over the past five years his output has concentrated on three synergistic directions: (i) neuromimetic and Koopman-based data-driven methods for estimating and controlling nonlinear systems, (ii) vision-based guidance and sparse optical-flow primitives for agile autonomous flight, and (iii) network-theoretic decomposition and information-rate studies for resilient operation of power grids and collective dynamics. Honors & Awards: IEEE Fellow 2025 Roger W. Brockett Control Systems Award Former Editor-in-Chief, IEEE Transactions on Automatic Control Affiliations & Service: He is a member of Boston University’s Center for Information and Systems Engineering (CISE), has served as Editor-in-Chief of IEEE Transactions on Automatic Control, and remains active in editorial and organizational roles across the IEEE control systems community.
Maarten de Hoop is the Simons Chair and Professor of Computational and Applied Mathematics at Rice University, part of the George R. Brown School of Engineering. He holds visiting roles at MIT and the Chinese Academy of Sciences. His research spans seismic wave analysis, inverse problems, deep learning, and planetary seismology. He earned his Ph.D. in Technical Sciences from Delft University of Technology (1992), and earlier degrees from Utrecht University. Notable awards include the 1996 J. Clarence Karcher Award and 2001 Fellowship from the Institute of Physics. His work integrates computational mathematics with geophysics, focusing on extracting signal information from large datasets, developing novel inverse scattering methods, and applying deep learning to geoscience challenges. Recent studies include transformer models for in-context learning, semialgebraic neural networks, and seismic waveform foundation models like SeisLM. He leads the Geo-Mathematical Imaging Group, fostering interdisciplinary projects in planetary missions and data-driven discovery.
Aaron D. Ames is the Bren Professor of Mechanical and Civil Engineering, Control and Dynamical Systems, and Aerospace at the California Institute of Technology (Caltech). He serves as the Booth-Kresa Leadership Chair and Director of the Center for Autonomous Systems and Technologies since 2025. His academic journey includes a BS in Mechanical Engineering and BA in Mathematics from the University of St. Thomas (2001), followed by an MA in Mathematics and a PhD in Electrical Engineering and Computer Sciences from UC Berkeley (2006). Research Interests span theoretical and experimental work in hybrid systems, nonlinear control, and bipedal robotic locomotion. Specific focus areas include: Control Barrier Functions (CBFs) for safety-critical systems Powered prostheses and robotic assistive devices Legged locomotion for bipedal and quadrupedal robots Cyber-physical systems and autonomous control Model predictive control and real-time optimization Humanoid robotics and geometric safety filters Recent publications emphasize risk-aware control, safety verification, and locomotion on constrained environments, with applications to drones, exoskeletons, and quadrupedal robots. His work often integrates theoretical advancements with practical validation through the AMBER Lab. Scientific Awards & Honors : NSF CAREER Award (2010) Donald P. Eckman Award (2015) Leon O. Chua Award (2005) Bernard Friedman Prize (2006) Teaching includes graduate courses on nonlinear control, hybrid systems, and robotics at Caltech, alongside prior roles at Georgia Tech and Texas A&M. He leads the AMBER Lab (Bipedal Robotics) and has secured major grants from the National Science Foundation, NASA, and industry partners like Miso Robotics and SRI International.
Dr. Lucas Pahl is a Lecturer in Economics at the University of Sheffield, School of Economics since 2024. His research specializes in mathematical game theory, particularly in equilibrium refinements, fixed point theory, and real algebraic geometry. He holds a PhD in Economics from the University of Rochester, an MSc in Mathematics from IMPA (Brazil), and a BSc in Social Sciences from the University of São Paulo. Previous positions: Postdoctoral Scholar at Hausdorff Institute for Mathematics and Institute for Microeconomics, University of Bonn His research interests include advanced topics like fixed point theory applications in game theory, algebraic topology intersections with economic models, and equilibrium refinement methodologies. Recent work explores information spillover in zero-sum games and polytope-form game structures. Key publications focus on O’Neill’s theorem extensions, sustainable equilibria analysis, and finite characterizations of perfect equilibria. He serves as a reviewer for top journals including Econometrica and Games and Economic Behavior. No scientific awards explicitly mentioned. His advisory and grant activities remain unspecified in current records. Labs/teams: No lab affiliations explicitly stated in provided information.
Prof. Dr. Philipp Habegger is a faculty member at the University of Basel's Department of Mathematics and Computer Science . His research focuses on Number Theory , specifically Diophantine Geometry, heights on abelian varieties, unlikely intersections, and algebraic number theory. He leads the Research Group in Number Theory and participates in collaborative seminars like the Number Theory Web Seminar with Mike Bennett and Alina Ostafe. Contact : philipp.habegger@unibas.ch | +41 61 207 26 98 Office : Spiegelgasse 1, 4051 Basel, Switzerland Academic Role : Research and teaching in number theory and Diophantine problems Research Overview Habegger's work addresses fundamental questions about the distribution of special points on algebraic varieties and the arithmetic properties of polynomial dynamics. His recent publications analyze degeneracy loci in abelian families, canonical heights, and the geometric Bogomolov conjecture. The 15 most recent articles reflect a focus on number theory, algebraic geometry, and effective bounds in Diophantine problems. Scientific Collaborations Collaborated with Ziyang Gao, Harry Schmidt, Umberto Zannier, and others Contributed to journals: Annals of Mathematics , Forum of Mathematics, Sigma , Compositio Mathematica Key themes: Abelian varieties , Heights , Unlikely intersections , CM jacobians
Laura DeMarco is a Professor of Mathematics at Harvard University and holds the Radcliffe Alumnae Professorship at the Radcliffe Institute for Advanced Study. She is affiliated with the Department of Mathematics at Harvard's Science Center (Office 337). Her research focuses on dynamical systems, arithmetic geometry, and complex analysis, with a particular emphasis on algebraic dynamics and the interplay between geometry and number theory. DeMarco earned her Ph.D. in Mathematics from Harvard University in 2002, with a thesis on holomorphic families of rational maps. Her work explores topics such as preperiodic points, moduli spaces of dynamical systems, and arithmetic equidistribution. She has organized events like the Algebraic Dynamics Seminar and participates in conferences worldwide, including the 2025 Diophantine approximation conference in France. Her research publications analyze geometric and arithmetic properties of dynamical systems, such as the geometry of preperiodic points, bifurcation measures, and the classification of polynomial basins of infinity. Her studies often bridge algebraic geometry, complex dynamics, and number theory, contributing to foundational questions in arithmetic dynamics. DeMarco has collaborated extensively with researchers like N. M. Mavraki, H. Krieger, and X. Wang, advancing topics like bounded geometry in dynamical families and uniform results in the Manin-Mumford conjecture. Her work has been published in leading journals such as the Annals of Mathematics, Compositio Mathematica, and the Journal of the European Mathematical Society.
Mikaela Iacobelli is an Associate Professor in the Department of Mathematics at ETH Zürich. During the 2024-25 academic year, she was a von Neumann Fellow at the Institute for Advanced Study in Princeton. Previously, she held faculty positions at Durham University and a research fellowship at the University of Cambridge. Her educational background includes: PhD in Mathematics from Sapienza University of Rome and École Polytechnique in Paris (2015) Master's degree from Sapienza University of Rome (2012) Bachelor's degree from Sapienza University of Rome (2009) Mikaela's research lies at the interface of analysis, kinetic theory, and statistical mechanics. She studies partial differential equations that model the collective behavior of many-particle systems, with a focus on Vlasov-type plasmas and gravitational dynamics. Her current projects range from quasineutral and singular-limit problems for Vlasov-type systems to quantization of measures, ultrafast diffusion, and gradient-flow structures that link microscopic particle models to macroscopic fluid descriptions. She makes extensive use of PDEs techniques, optimal transport, probability, calculus of variations, and Riemannian geometry in her work. Her recent publications demonstrate a strong focus on Vlasov-type equations, particularly examining quasineutral limits, stability properties, and connections to other physical systems like Euler equations and magnetohydrodynamics. She has made significant contributions to understanding Landau damping, quantization problems on manifolds, and the mathematical foundations of plasma physics. Her notable scientific awards include: SNSF Starting Grant (Swiss ERC) Challenges and Breakthroughs in the Mathematics of Plasmas (2025-2030) von Neumann Fellow at the Institute for Advanced Study, Princeton (2024-2025) Invited speaker at the International Congress of Mathematical Physics (2021) CO-PI of the Germaine de Staël Funding Program for French-Swiss cooperation (2021-2023) L'Oréal prize for Women in Science (2015) Mikaela actively mentors postdocs, PhD, Master's, and Bachelor's students. Her current mentees include postdocs Dennis Chemnitz, Rishabh Gvalani, Stefano Rossi, and Simon Becker, as well as PhD students Thérèse Moerschell, Ata Deniz Aydin, and Antoine Gagnebin. She has served as PI for the Starting Research Grant from the University of Rome Sapienza and is currently the PI for the SNSF Starting Grant. She co-organizes several academic seminars including the Zurich Colloquium in Mathematics, the PDE and Mathematical Physics seminar at ETH Zürich and UZH, and the Analysis Seminar. She also serves on various committees including as Chair of the European Mathematical Society Committee for Women in Mathematics.
