Kenneth McLaughlin is the Evelyn and John G. Phillips Distinguished Chair in Mathematics at Tulane University's School of Science & Engineering. He holds a Ph.D. and B.A. in Mathematics from New York University (1994 and 1989). Prior to Tulane, he served as faculty at the University of North Carolina, Chapel Hill, the University of Arizona, Universidade Federal de Brasília, and Colorado State University, where he also held leadership roles as Department Head and Chair. His research focuses on integrability, applying techniques across mathematics to study complex systems and phenomena. He has held visiting positions at institutions worldwide, including France, Italy, Brazil, Belgium, and the UK. McLaughlin’s research spans integrable systems, nonlinear dynamics, and asymptotic analysis. His work often involves the Riemann-Hilbert problem approach, orthogonal polynomials, and random matrix theory. Notable contributions include studies on soliton gases, the KdV equation, and universality in quantum operator dynamics. His recent articles explore topics such as asymptotic behavior of polynomials, soliton gas condensation, and hydrodynamic limits in integrable systems. McLaughlin’s academic career is marked by interdisciplinary collaboration and international research engagement.
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.
Alexander Gorodnik is a Professor of Mathematics at the University of Zurich, focusing on the interplay between dynamical systems and number theory. His work bridges ergodic theory, homogeneous dynamics, and Diophantine approximation, with applications to arithmetic counting problems and geometric distribution of lattice orbits. Current lectures include MAT121: Analysis I and MAT221: Analysis III at the University of Zurich Co-author of the book The ergodic theory of lattice subgroups (Princeton University Press, 2010) Editor of the journal Ergodic Theory and Dynamical Systems His research explores Diophantine approximation through dynamical systems, investigating how orbits of group actions distribute in homogeneous spaces. Key topics include mixing properties , central limit theorems , and metric theorems for multiplicative approximation. Recent publications address automorphic density estimates , discrepancy in intrinsic Diophantine approximation , and effective equidistribution of translated measures. His work often employs tools from representation theory and spectral analysis . Current working group members include Zhiyuan Deng , Zouhair Ouaggag , and Yuval Yifrach . He has taught courses at institutions in Zurich, Bristol, Princeton, and Mumbai, with lecture materials covering topics from ergodic theorems to Každan's property (T) .
Amit Kumar is the Jaswinder and Tarwinder Chadha Chair Professor in the Department of Computer Science and Engineering at IIT Delhi. His research focuses on combinatorial optimization, online algorithms, and algorithmic fairness. He has taught courses such as Approximation Algorithms (COL 754), Design and Analysis of Algorithms (COL 351), and Numerical Analysis (COL 726). His work spans theoretical computer science with applications to clustering, scheduling, and fairness in evaluation processes. Research Interests Kumar's research emphasizes developing efficient algorithms for online and dynamic settings, particularly in constrained optimization and biased evaluation systems. He explores theoretical foundations of clustering, load balancing, and resource allocation, with recent contributions to fair food delivery systems and coreset constructions. Publications His recent work includes advancements in online convex paging (STOC 2025), consensus clustering (SODA 2025), and fairness-aware algorithms (AAAI 2024). Over 70 papers across top venues like STOC, SODA, and ICML reflect his expertise in algorithm design and analysis. Awards Best Paper Award at ISAAC 2023 for 'Clustering What Matters in Constrained Settings' Teaching & Mentorship Kumar instructs graduate and undergraduate courses in algorithms, data structures, and numerical methods. He advises students through these courses and collaborates with researchers on NSF-funded projects related to approximation algorithms and streaming systems.
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.
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
Nicole Wein is an Assistant Professor in the Computer Science and Engineering Division of the Department of Electrical Engineering and Computer Science (EECS) at the University of Michigan, College of Engineering. Her research lies in theoretical computer science, focusing on graph algorithms, dynamic algorithms, parameterized algorithms, distributed algorithms, online algorithms, and fine-grained complexity. She is part of the Theory of Computation Lab and advises both PhD and undergraduate researchers. PhD, Massachusetts Institute of Technology (MIT), advised by Virginia Vassilevska Williams Postdoctoral Fellow, DIMACS Research Fellow, Simons Institute, UC Berkeley MS, Stanford University BS, Computer Science/Math, Harvey Mudd College Her research explores fundamental algorithmic questions in combinatorial settings, particularly how algorithms handle dynamic data, extract information efficiently (e.g., in linear time), and understand shortest path structures in graphs—especially directed ones. She investigates problems in distance estimation, spanners, hopsets, dynamic graph algorithms, and hardness of approximation. Her work combines theoretical depth with practical implications for algorithm design. The recent publications reflect a strong trend in fine-grained complexity and graph algorithm design, with a focus on proving tight bounds, developing efficient approximations, and understanding structural limitations in directed and dynamic graphs. Her work frequently appears in top venues such as STOC, FOCS, SODA, and ICALP, often in collaboration with leading researchers in the field. Scientific Awards and Recognition: Invited to special issue of SIAM Journal on Computing (SICOMP) (FOCS 2022 paper) Invited to Highlights of Algorithms (HALG) (FOCS 2022 paper) Invited to minisymposium at CANADAM (ESA 2022 paper) Work featured in Quanta Magazine Nicole Wein actively mentors students, including current PhD student Jubayer Nirjhor and former undergraduate researchers like Sam Hiken (now pre-doc at MIT). She has served on program committees for major conferences including SODA, FOCS, ICALP, and ITCS, and co-organized the DIMACS workshop on Modern Techniques in Graph Algorithms (2023). She also contributes to the academic community through outreach, such as her article offering reassurance to early-stage PhD students in theoretical computer science. She leads and participates in collaborative research groups and workshops, emphasizing supercollaboration and interdisciplinary communication in algorithms. Her lab fosters a strong research environment in theoretical computer science at the University of Michigan.
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.
Professor Marta Zofia Kwiatkowska is Professor of Computing Systems and Fellow of Trinity College at the University of Oxford, where she has held a faculty position since 2007. She previously served as Professor of Computer Science at the University of Birmingham (2001–2007), Reader and Lecturer at the University of Birmingham (1994–2001), and Lecturer at the University of Leicester (1986–1994). Her academic career began as Assistant Professor at the Jagiellonian University in Kraków, Poland (1980–1988). Education: BSc/MSc in Computer Science, Jagiellonian University, Kraków MA, University of Oxford PhD, University of Leicester Research Interests: Professor Kwiatkowska spearheaded the development of probabilistic and quantitative verification methods on the international stage. Her work bridges theory and practice through the PRISM model checker—the leading software tool in probabilistic model checking—used worldwide for research and teaching. Application domains include communication and security protocols , nanotechnology designs , power management , ubiquitous computing and systems biology . She investigates automated verification , temporal logics , semantic models for concurrency , real-time systems , and biological process modelling . Current grant funding exceeds £3.7 million from EPSRC, EU and ERC, including the prestigious ERC Advanced Grant VERIWARE. Scientific Awards & Honours: Fellow of the Royal Society Fellow of the ACM Fellow of the European Association for Theoretical Computer Science (EATCS) Fellow of the British Computer Society (BCS) Fellow of the Polish Society of Arts & Sciences Abroad ERC Advanced Grant VERIWARE (€2.046 M, 2010–2015) Top Cited Article Award, Theoretical Computer Science (2005–2010) Best Paper Award, QEST 2006 Doctoral Supervision & Grants: Professor Kwiatkowska actively supervises doctoral students (D.Phil. at Oxford) and post-doctoral researchers. She welcomes applications in areas aligned with her research interests, detailed here . Current students include Charlie Griffin, Daqian Shao, Matthew Yuan and Minghao Liu; past students and researchers number over twenty, many now in faculty or industry leadership roles. Laboratory & Teams: She leads the Oxford Quantitative Verification group within the Department of Computer Science. Ongoing projects include FUN2MODEL, ELSA, FAIR and the flagship PRISM probabilistic model checker. The group maintains strong collaborations with biological, robotics and engineering teams worldwide.
Ghaith Hiary is a Professor and Vice Chair for Graduate Recruitment in the Department of Mathematics at The Ohio State University. He holds a PhD from the University of Minnesota (2008). His research focuses on computational and analytic number theory, with emphasis on the Riemann zeta function, L-functions, random matrix theory, and asymptotic analysis. Hiary's work bridges theoretical mathematics and high-performance computation. He develops efficient algorithms (e.g., amortized-complexity methods) to evaluate zeta functions at extreme heights (e.g., near t=10 28 ), implemented in C++/Mathematica. His research uses random matrix models to study zeta-function moments and employs techniques like van der Corput estimates and hybrid methods for explicit bounds. His publications demonstrate consistent focus on zeta-function computations, factorization algorithms, and arithmetic biases. Recent work (2022-2025) explores invariant measures, Lehman's method generalizations, and sign changes in random multiplicative functions, maintaining strong ties to analytic and probabilistic number theory. Hiary shares code and datasets via GitHub, including implementations of T 1/3 algorithms for zeta computations. He collaborates with institutions like the University of Waterloo and maintains numerical databases of zeta zeros.
Dr. Susana Castro-Kemp is an Associate Professor in Psychology and Human Development at University College London's Institute of Education (IOE), where she serves as Director of the Centre for Inclusive Education (CIE) since September 2023. Previously, she was a Reader in Education at the University of Roehampton for eight years. Her work focuses on inclusive education policy and practice globally, with particular expertise in special educational needs and disabilities (SEND), early childhood intervention, and mental health in schools. The IOE has been ranked number one in the world for Education for several consecutive years, providing an ideal environment for her impactful research. Dr. Castro-Kemp holds a PhD in Psychology jointly awarded in 2012 by the University of Porto (Portugal) and the University of North Carolina at Chapel Hill (USA). Her doctoral research was fully funded by the Foundation for Science and Technology/European Commission and the Global Education and Development Studies scholarships. She is a Chartered Psychologist with the British Psychological Society, a Senior Fellow of Advance HE, and a Recognised Research Supervisor by the UK Council for Graduate Education. Dr. Castro-Kemp's research centers on policy regulating education, health, and welfare services for children, particularly those with support needs. She examines inclusive education practices from users' perspectives, policy models leading to effective inclusive pedagogy, and country-level policy impacts on outcomes for children with special educational needs. Her work moves away from diagnostic labels toward engagement and civic participation as educational outcomes. She also investigates inclusion and early intervention in low- and middle-income countries, mental health in schools, and quality of early childhood education. Her recent publications reveal several key trends in inclusive education research. There's growing emphasis on understanding educational experiences through the voices of children and families rather than diagnostic labels. Much of her work examines the implementation gap between inclusive education policy and classroom practice. She has conducted significant research on how children with special educational needs experienced the pandemic, revealing both challenges and unexpected "silver linings" for some groups. Her corpus analysis of Ofsted reports shows narrow focus in early childhood education inspections, while her work on SEND policy increasingly takes an international comparative approach. Dr. Castro-Kemp has received recognition for her impactful work, including: Best Digital Humanities Project for Community Engagement Prize (2023) from the National Institute of Humanities and Social Sciences of South Africa for her project "Optimising collaborations and reducing inequalities of Early Childhood Intervention in post-Covid-19 South Africa" Dr. Castro-Kemp has secured approximately £1.3 million in research funding from various sources including ESRC, British Academy/Leverhulme Trust, European Commission, and private sponsors. Her current major project is 'ScopeSEND' (2024-2026), funded by the Nuffield Foundation (£250,000), examining international SEND policies. She has led numerous projects including "Transdisciplinary provision for children with disabilities in the Global South" (£3,500), "Optimising collaborations in South Africa" (£47,200), and "Froebel meets Ofsted" (£19,185). As a supervisor, she mentors MA/MSc and PhD students in education policy, early childhood, and inclusive education, having been nominated for student choice awards for excellent feedback and outstanding research supervision. As Director of the UCL Centre for Inclusive Education since 2023, Dr. Castro-Kemp leads a team focused on advancing knowledge exchange and research in inclusion and special needs. The Centre works with schools, educators, parents, and early years settings to translate research into practice. Her international collaborations include work with the World Health Organization as a technical advisor on the use of the International Classification of Functioning, Disability and Health (ICF) system in educational contexts. She also serves on the SEN Policy Research Forum and has provided oral evidence to the House of Commons Education Select Committee.
Manfred Einsiedler is a Professor in the Department of Mathematics at ETH Zurich, Switzerland, with office HG G 64.2 at Rämistrasse 101, 8092 Zurich. He teaches undergraduate and graduate courses including Linear Algebra (HS 2019), Analysis I/II, and Functional Analysis I/II, using his co-authored textbook Functional Analysis, Spectral Theory, and Applications . His research centers on dynamical and equidistribution problems in homogeneous spaces, with focus on closed horocycle orbits, geodesic orbits on the modular surface, and measure rigidity. Key contributions include work on effective equidistribution, entropy methods, and connections between ergodic theory and number theory. He has co-authored foundational texts: Ergodic Theory with a view towards Number Theory and Functional Analysis, Spectral Theory, and Applications in Springer's Graduate Texts in Mathematics series, alongside multiple in-progress volumes on entropy, homogeneous dynamics, and unitary representations. Recent publications explore integer points on spheres, rigidity of invariant measures, and Diophantine approximation on fractals, emphasizing collaborations with Lindenstrauss, Ward, Margulis, and Venkatesh. His work demonstrates consistent focus on homogeneous dynamics with applications to arithmetic problems, particularly through effective methods and measure classification theorems. While no specific awards or student lists are documented in the source, his extensive publication record and textbook authorship establish significant scholarly impact.
Professor Victor Beresnevich of the University of York, Department of Pure Mathematics, is a leading researcher in Metric Number Theory and Diophantine Approximation . He leads the Number Theory Research Group and collaborates on problems involving algebraic numbers , manifold approximation , and ergodic theory . PhD and DSc from Minsk EPSRC-funded projects on Duffin-Schaeffer conjecture and rational points near manifolds Organiser of conferences on Diophantine approximation, dynamical systems, and quantum chaos His work connects Diophantine approximation with dynamical systems , fractal geometry , and p-adic analysis . Recent projects focus on inhomogeneous approximation and shrink targets problems . He supervises PhD students and mentors collaborations in analytic number theory and measure theory . Scientific Awards : Advanced Research Fellow Current PhD Student : Dorsa Vakilzadeh Hatefi
Ion Stoica is a Professor in the Electrical Engineering and Computer Sciences Department at the University of California, Berkeley, where he holds the Xu Bao Chancellor Chair. He serves as Director of the Sky Computing Lab and is Executive Chairman of both Databricks and Anyscale. His research spans distributed systems, cloud computing, and AI systems, with significant contributions to large-scale data processing frameworks. Stoica's research interests focus on the intersection of AI and systems, with emphasis on developing practical implementations that bridge theoretical foundations with real-world deployability. His work addresses fundamental challenges in distributed computing, resource management, and large-scale machine learning systems. Current projects include Ray (a distributed execution framework), vLLM (a high-throughput inference engine for LLMs), Chatbot Arena (an open platform for human preference evaluations), and SkyPilot (a framework for running AI workloads across clouds). His research output demonstrates a consistent trajectory toward more efficient, scalable systems for modern AI workloads, particularly focusing on optimizing inference performance, resource utilization, and cross-cloud deployment. Recent publications reflect growing interest in large language model serving, video generation optimization, and agent-based systems. ACM Fellow SIGOPS Hall of Fame Award (2015) SIGCOMM Test of Time Award (2011) ACM Doctoral Dissertation Award (2001) Member of National Academy of Engineering Honorary Member of the Romanian Academy Stoica has advised an extensive number of doctoral students who have gone on to prominent positions in academia and industry, including assistant professorships at Stanford, MIT, Carnegie Mellon, and other top institutions. He has received significant research funding through his lab activities and startup ventures. His research group has been particularly successful in translating academic research into widely adopted open-source technologies and commercial products. Stoica leads the Sky Computing Lab at UC Berkeley, which focuses on developing systems for AI workloads across multiple clouds. His research group has produced numerous influential open-source projects including Apache Spark, Apache Mesos, and Alluxio, which have become industry standards for large-scale data processing. The lab maintains strong industry partnerships while pursuing fundamental research in distributed systems and AI infrastructure.
Arnab Sen is an Associate Professor at the School of Mathematics, University of Minnesota. His research focuses on probability theory and discrete harmonic analysis, with emphasis on models from statistical physics such as spin glasses, random graphs, random matrices, and random polynomials. PhD in Statistics, UC Berkeley (2010), advised by Steven N. Evans and Elchanan Mossel Postdoctoral Fellow, Statistical Laboratory, University of Cambridge His research spans discrete probability , statistical physics , and random matrix theory , addressing topics like disorder chaos in spin glasses, eigenvalue distributions, and quantum percolation. He has taught graduate and undergraduate courses including Random Matrix Theory , Introduction to Stochastic Processes , and Multivariable Calculus . His recent publications analyze spin glass models, random matrices, and combinatorial systems.
