Aram Harrow is a Professor of Physics at the Massachusetts Institute of Technology (MIT) , affiliated with the MIT Center for Theoretical Physics and MIT Center for Quantum Engineering . He focuses on quantum information science and quantum algorithms , with additional interests in representation theory and optimization . His recent work explores quantum computing applications in chemical physics and statistical mechanics . Undergraduate and graduate degrees in Physics at MIT Faculty positions: MIT (2013-present), University of Washington (2010-12), University of Bristol (2005-10) Research Interests: His work bridges quantum information theory and many-body physics , including: Quantum algorithm design for chemistry and optimization Quantum circuit complexity and t-designs Entanglement dynamics in quantum systems Quantum-classical hybrid computing models Key Publications: Recent articles demonstrate quantum speedups for biomolecular free energy calculations , Hamiltonian simulation , and jet clustering algorithms . His research combines quantum complexity theory with practical implementations on near-term quantum devices. Scientific Awards: 2023 Simons Investigator 2018 APS Bennett Award 2017 IEEE Best Paper Award 2016 Kavli Frontiers Fellow Mentorship: He advises current PhD students Shankar Balasubramanian , Angus Lowe , and Norah Tan , with 12 former advisees including Anand Natarajan and Saeed Mehraban . His 2026 recruitment seeks one new graduate student.
Monika Henzinger is Professor at the Institute of Science and Technology Austria (ISTA), heading the research group of Theory and Applications of Algorithms. She also serves as Vice President for Technology Transfer at ISTA since 2024. Previously, she held professorships at the University of Vienna (2009-2023) and EPFL, Switzerland (2005-2009), was Director of Research at Google (1999-2005), and served as Assistant Professor at Cornell University. Professor Henzinger's research centers on efficient algorithms and data structures with three main thrusts. First, she investigates dynamic settings where program inputs are repeatedly updated, seeking solutions faster than restarting computations. Second, she develops privacy-preserving algorithms that add minimal noise to protect input data while maintaining efficiency. Third, she translates theoretically optimal algorithms into practical implementations for dynamically changing inputs. Her work consistently addresses resource conservation in data processing, particularly computing time and memory space, while exploring the theoretical limits of possible savings. Henzinger's recent publications (2024-2025) reveal strong trends in dynamic algorithms, differential privacy, and graph theory. Her research consistently bridges theoretical computer science with practical applications, focusing on algorithms that adapt to changing inputs while preserving computational efficiency and data privacy. She has made significant contributions to problems like dynamic matching, minimum cut computation, and privacy-preserving data analysis across various domains. Professor Henzinger has received numerous prestigious awards and honors: Wittgenstein Award (2021) Two ERC Advanced Grants (2014, 2021) Carus Medal of the German Academy of Sciences Leopoldina (2019) SIGIR Test of Time Award Fellow of the Association of Computing Machinery (2016) Member of the Austrian Academy of Sciences (2017) CAREER Development Award of the National Science Foundation Best paper Award at the Symposium on Discrete Algorithms (2024) Professor Henzinger currently advises PhD students Bardiya Aryanfard, Antoine El-Hayek, and Roodabeh Safavi Hemami, along with postdocs Anamay Chaturvedi and Niklas Hahn. Her research is supported by multiple significant grants including an ERC Advanced Grant for 'Design and Evaluation of Modern, Fully Dynamic Data Structures,' the FWF Wittgenstein Prize, and the WEAVE Project on 'Static and dynamic hierarchical graph decompositions.' She also serves as Principal Investigator for the FWF project 'Fast algorithms for a reactive network layer,' providing substantial funding for her innovative work in algorithms and data structures. Professor Henzinger leads the Theory and Applications of Algorithms research group at ISTA, which focuses on developing practical algorithms for dynamic environments. Her team investigates resource conservation in data processing, specializing in dynamic algorithms that efficiently handle changing inputs, privacy-preserving algorithms that minimize noise while protecting data, and translating theoretical algorithms into practical implementations. The group maintains a strong presence in theoretical computer science through regular publications in top conferences and journals, and collaborates extensively with institutions worldwide to advance algorithmic research.
Prof. Dr. Eva Viehmann is a leading mathematician at the University of Münster within the Faculty of Mathematics and Computer Science and a key figure in the Mathematics Münster cluster. She was awarded the prestigious Gottfried Wilhelm Leibniz Prize 2024 for her groundbreaking work in arithmetic algebraic geometry and representation theory within the Langlands program . University: University of Münster Department: Mathematical Institute Her research focuses on the intersection of algebra , geometry , and analysis , particularly through the lens of Shimura varieties and moduli spaces of local G-shtukas . She has pioneered the study of affine Deligne-Lusztig varieties in equal and mixed characteristics, advancing understanding of their dimension , connectedness , and irreducible components . Recent publications highlight her work on Newton stratification , Harder-Narasimhan theory , and p-adic moduli spaces . Her scientific advisory contributions include mentoring former doctoral student Stefania Trentin and collaborating with Prof. Urs Hartl over 15 years. Awards and honors include the Leibniz Prize 2024 , reflecting her status as a trailblazer in arithmetic geometry and p-adic geometry . Her research projects span the CRC 1442 and EXC 2044 , aiming to unify Galois representations , automorphic forms , and geometric methods .
Ciprian Manolescu is a Professor of Mathematics at Stanford University, where he joined after serving as a professor at UCLA since 2008. He holds both his undergraduate degree and doctorate from Harvard University, advised by Peter Kronheimer. His research focuses on gauge theory, low-dimensional topology, and symplectic geometry, with notable contributions to Heegaard Floer theory, Khovanov homology, and the resolution of the Triangulation Conjecture. Manolescu’s academic accolades include the 2019 E.H. Moore Research Article Prize, the 2012 European Mathematical Society Prize, and a 2004 Clay Research Fellowship. He delivered an invited lecture at the 2018 International Congress of Mathematicians and became a Fellow of the American Mathematical Society in 2017. His work bridges advanced algebraic structures with geometric problems, particularly in understanding manifold invariants and topological constraints. His teaching includes the Polya Problem Solving Seminar (Math 193) at Stanford, and he advises students competing in the Putnam Mathematics Competition. Research trends in his publications emphasize applications of Floer homology to knot theory, 4-manifold topology, and the interplay between algebraic topology and quantum field theories. Education: PhD and BA in Mathematics, Harvard University Key Research Themes: Floer homology frameworks, geometric topology, knot invariants, and manifold classification Grants & Collaborations: Involved in NSF-funded projects like the FRG: Collaborative Research: Floer Homotopy Theory (2016)
Assia Mahboubi is a tenured researcher ( directrice de recherche ) at INRIA in the Gallinette team, Nantes, France, and an endowed professor in the Algebra and Number Theory section of the Vrije Universiteit Amsterdam, Netherlands. Her work bridges theoretical computer science and formal mathematics, with significant contributions to proof assistants and formal verification. Her research focuses on the foundations and formalization of mathematics in type theory, particularly on the automated verification of mathematical proofs. She explores the interplay between computer algebra and formal proofs, and is a key contributor to the Rocq prover (formerly Coq) and the Mathematical Components libraries. Her work often examines how familiar mathematical objects can be optimally represented for computer-aided proof checking. Recent publications show a strong trend toward categorical reasoning, diagram chasing, and continuity properties in constructive type theory, with increasing focus on practical applications of formal methods in computational mathematics. Her work demonstrates the maturation of formal verification techniques from theoretical foundations to practical tools for mathematical research. ERC Consolidator grant for the FRESCO (Fast and Reliable Symbolic Computation) project Mahboubi actively supervises doctoral students including Vojtěch Štěpančík, Tomás Vallejos Parada, and Alain Chavarri Villarello. She has received significant research funding through her ERC Consolidator grant for the FRESCO project, which aims to develop fast and reliable symbolic computation techniques. She is deeply involved in the international research community, serving on program committees for major conferences including POPL, CPP, and ICFP. She leads research in the Gallinette team at INRIA, which focuses on the intersection of proof assistants, programming languages, and formal mathematics. Her work has helped establish formal verification as a practical tool for mathematical research, moving beyond theoretical foundations to real applications in computational mathematics.
Rahul Sarkar is a Postdoctoral Fellow at the University of California, Berkeley, affiliated with the Department of Mathematics . He was previously a Ph.D. student in the Institute for Computational and Mathematical Engineering (ICME) at Stanford University, graduating in 2022 under the advisement of Biondo Biondi and András Vasy. Research Interests : Quantum information theory, inverse problems, machine learning, microlocal analysis, and numerical methods for PDEs. Scientific Contributions : Developed novel quantum computing algorithms and numerical schemes for geophysical imaging, with applications in seismic tomography and quantum signal processing. Teaching : Taught courses at Stanford including Introduction to Quantum Computing and 3D Seismic Imaging , with roles as instructor and course assistant. Awards : Schlumberger Innovation Fellowship (2019-2020). His work bridges mathematical analysis and quantum computation , with a focus on solving real-world problems through interdisciplinary approaches. He has collaborated with institutions like IBM and Schlumberger to apply quantum algorithms to geoscience and financial optimization.
Kevin Coulembier is a Professor in the Algebra Research Group at the University of Sydney . He has held a continuing position since 2017 and received prestigious awards including the Christopher Heyde Medal (2021), G. de B. Robinson Award (2022), and the Frontiers of Science Award (2024). Research Focus: Representation theory of algebraic groups, Lie (super)algebras, quantum groups, and monoidal categories; tensor ideals; and homological algebra. Grants: ARC Future Fellowship (2023), ARC Discovery Projects (2021, 2018), and DECRA Fellowship (2017). Students: Supervised postdocs and PhD students including Nick Bridger, Joseph Newton, Bregje Pauwels, Alexander Sherman, and Willow Stewart. Editorial Roles: Editor for Annals of Representation Theory and Mathematische Zeitschrift .
Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.
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.
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.
Howard Elman is a Professor in the Department of Computer Science at the University of Maryland, with affiliations to the Institute for Advanced Computer Studies (UMIACS) and as an Affiliate Professor in the Department of Mathematics. His research spans numerical analysis, computational fluid dynamics, and uncertainty quantification, focusing on iterative solvers for partial differential equations. Education: PhD in Computer Science, Yale University (1982); BA in Mathematics, Columbia University (1975); Stuyvesant High School (1971) Elman's research integrates Scientific Computing with Numerical Linear Algebra , Computational Fluid Dynamics , and Uncertainty Quantification . His work addresses Stochastic Galerkin Methods , Reduced-Order Modeling , and Low-Rank Approximations for PDEs with random data. Recent publications emphasize Surrogate Models and Deep Learning in Bayesian inverse problems. His scientific awards include SIAM Fellowship (2009) and roles as Associate Editor for journals like Mathematics of Computation and SIAM Journal on Scientific Computing . He served as SIAM Editor-in-Chief (1998-2004) and Vice President for Publications. Contact: helman@umd.edu | Office: 4210 Iribe Center | Courses: AMSC/CMSC 460 Computational Methods
Jaclyn Lang is the Selma Lee Bloch Brown Assistant Professor of Mathematics at Temple University. Her research centers on algebraic number theory, focusing on modular forms, Galois representations, elliptic curves, motives, and p-adic methods. Education: Ph.D. in Mathematics, UCLA (2016), advised by Haruzo Hida Part III of the Mathematical Tripos, University of Cambridge (2010), supervised by Tom Fisher MA in Mathematics, Bryn Mawr College (2009), supervised by Helen Grundman Research Interests: She works on advanced problems in number theory, including the Eisenstein ideal, pseudorepresentations, and arithmetic geometry of elliptic curves. Her work often bridges algebraic geometry and automorphic forms using p-adic techniques. Scientific Awards: Churchill Scholarship (2009–2010) Clare Booth Luce Scholarship (2007–2009) NSF Graduate Research Fellowship (2010–2015) Charles E. and Sue K. Young Graduate Student Award (2015) NSF Mathematical Sciences Postdoctoral Research Fellowship (2016–2020) AWM Travel Grant (2023) Fulbright U.S. Student Program Grant (2016) Simons Travel Support for Mathematicians (2023–2028) Grants: She has received NSF Standard Grant DMS-331117 (2023–2026) and participated in programs like the Park City Math Institute and Women in Numbers Europe (WINE3).
Dr. Dmytro Matsypura is an Associate Professor in the Discipline of Business Analytics at the University of Sydney Business School. He holds a BA (Hons) from Kyiv Polytechnic Institute (KPI), an MS (Hons) from KPI, and a PhD from the University of Massachusetts Amherst. His research focuses on optimization methodologies, network science, and their applications in finance, transportation, ecology, and graph theory. He is a recipient of multiple teaching awards, including the Wayne Lonergan Outstanding Teaching Award (Early Career) in 2010. Education: PhD in Management Science, University of Massachusetts Amherst (2006) MS (Hons) in Information Systems, Kyiv Polytechnic Institute (2000) BA (Hons) in Business Administration, Kyiv Polytechnic Institute (1998) Research Interests: Dr. Matsypura’s work spans operations research and management science, with a focus on mathematical optimization and network science. His methodological contributions include developing efficient optimization algorithms, while his applied research addresses real-world challenges in finance, engineering, and ecology. Notable applications include wildfire fuel management, portfolio margining, and credit card fraud detection via graph-based models. Awards and Recognition: Teaching Excellence Award (2008, 2013, 2018) Wayne Lonergan Outstanding Teaching Award (Early Career) (2010) Grants and Projects: Current projects include Bushfire Analytics: Optimization of Fuel Reduction (2023, ARC Discovery Project). His research frequently integrates interdisciplinary collaborations, such as applying graph theory to biomedical problems and cybersecurity. Labs/Teams: Active in the Sydney Environment Institute, contributing to projects at the intersection of analytics and sustainability. Collaborates with industry on fraud detection and supply chain optimization.
Florian Schäfer is an Assistant Professor at the School of Computational Science and Engineering at Georgia Tech. His research spans numerical computation, statistical inference, and competitive games, with applications in materials science, turbulence modeling, computer graphics, and computational geometry. He will join the Courant Institute at NYU in September 2025. PhD in Applied and Computational Mathematics, Caltech Bachelor’s and Master’s in Mathematics, University of Bonn His work focuses on information geometric mechanics to design structure-preserving numerical methods for continuum mechanics. This includes: State-of-the-art solvers for elliptic PDEs via Gaussian elimination and conditional independence Efficient multi-agent optimization algorithms Information geometric regularization for compressible fluid dynamics Enabling the first compressible fluid simulation exceeding 100 trillion grid cells His recent research trends integrate: Machine learning for materials science (e.g., active learning, Bayesian approaches) Stochastic modeling of microstructures and phase-field problems Neural operators for super-resolution fluid dynamics Generative models for polycrystalline material datasets Optimal transport and diffusion models for conditional density transformations High-performance computing at extreme scales Florian collaborates with researchers including Houman Owhadi, Jessie Liu, Spencer Bryngelson, Tamer Zaki, and Ali Mani. He actively presents at conferences like SIAM and UCLA seminars, and is recruiting PhD students for work at the Courant Institute starting 2025.
