Clifford Stein is a Professor of Industrial Engineering and Operations Research (IEOR) and Computer Science at Columbia University, and Associate Director for Research at the Data Science Institute. He holds a Ph.D. (1992), M.S. (1989), and B.S.E. (1987) from MIT and Princeton University, respectively. His research focuses on algorithms, combinatorial optimization, operations research, scheduling, and computational biology. A co-author of the best-selling textbook Introduction to Algorithms , Stein has published widely in top venues and holds prestigious awards like ACM Fellow and NSF Career Award. His work includes foundational contributions to minimum cut algorithms, scheduling theory, and network optimization, supported by NSF and Sloan Foundation grants. Stein has advised over 40 graduate and undergraduate students, many now in academia and industry.
Andrea Coladangelo is an Assistant Professor at the Allen School of Computer Science & Engineering , University of Washington , co-leading the Quantum group and contributing to the Theory and Crypto groups. He coordinates the NSF-funded Quantum@UW REU program , fostering undergraduate research in quantum information. Previously, he was a postdoctoral researcher at UC Berkeley and the Simons Institute , advised by Umesh Vazirani , following a PhD in Computer Science at Caltech under Thomas Vidick . His academic journey began with a B.A. in Mathematics from Oxford and a Master in Mathematics from Cambridge . He co-founded qBraid , a platform for quantum computing education. Research Interests : Andrea explores the intersection of quantum computation and cryptography , focusing on foundational questions in entanglement , quantum correlations , and quantum learning theory . His work investigates quantum pseudorandomness , device-independent security , quantum algorithms , and quantum copy-protection , often leveraging computational assumptions to bridge quantum information theory with cryptographic applications. Scientific Awards : 2025 Google Research Scholar Program Award in Quantum Computing 2023 CSE Undergraduate Teaching Award for his course on quantum computation 2019 Best Student Paper Award at QIP Teaching & Outreach : Andrea designed and taught CSE 434: Intro to Quantum Computation (Spring 2023, 2024, 2025), CSE 534: Quantum Information and Computation (Autumn 2023), and CSE 599C: Quantum Learning Theory (Winter 2025). He also delivered lectures at the 22nd Bellairs Crypto Workshop (2024) and led a quantum programming tutorial using qBraid . Labs & Teams : As co-leader of the Quantum group at the Allen School, he collaborates with researchers in Theory and Crypto , advancing quantum computing through interdisciplinary projects and educational initiatives.
Moe Z. Win is the Robert R. Taylor Professor at the Massachusetts Institute of Technology (MIT), specializing in wireless communications, optical communications, and space communications systems. His research bridges theoretical and applied domains, including quantum sensing, network localization, and signal processing. B.S.E.E., Texas A&M (1987) M.S.E.E. & Ph.D., University of Southern California (1989, 1998) Recent work focuses on quantum-enhanced positioning, machine learning for localization, and next-generation (xG) non-terrestrial networks. He leads research at the Quantum neXus Laboratory (QX Lab), Wireless Information & Network Sciences Lab, and Laboratory for Information and Decision Systems. His career spans the Jet Propulsion Laboratory (1987-1995) and AT&T Research Laboratories (1998-2002). Key methodologies include soft information fusion, variational quantum sensing, and robust beam tracking for terahertz communications.
Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Lijie Chen is an Assistant Professor in the Department of Electrical Engineering and Computer Sciences at UC Berkeley, where he is part of the Berkeley Theory Group. Previously, he was a Miller Research Fellow at UC Berkeley, hosted by Avishay Tal and Umesh Vazirani, and earned his Ph.D. from MIT under Ryan Williams. His research focuses on theoretical computer science, particularly computational complexity theory, with applications to quantum physics and AI safety. Education: Ph.D. in Computer Science from MIT (2022), B.Sc. from Yao Class at Tsinghua University. Research Interests: Complexity theory, quantum complexity, derandomization, circuit lower bounds, and foundational aspects of AI safety. Chen has made significant contributions to understanding fundamental questions in complexity theory, including circuit lower bounds and the connections between randomness and computation efficiency. His work often bridges theoretical insights with practical implications in quantum computing and algorithm design. Awards and Honors: Machtey Award for Best Student Paper (2019). Danny Lewin Best Student Paper Award (2019). Invited to SICOMP Special Issues for FOCS and STOC papers. He has organized workshops on complexity theory and derandomization, and his research has been recognized in venues like STOC, FOCS, and the Journal of the ACM.
Florentina Bunea is a Professor in the Department of Statistics and Data Science at Cornell University’s Bowers College of Computing and Information Science, and an active member of the Graduate Fields of Statistics, Applied Mathematics, and Computer Science. She also serves on the Diversity and Inclusion Council of her college, championing workforce diversity in data-science disciplines. Education & Institutional Roles Professor, Department of Statistics and Data Science, Cornell University Member, Graduate Fields of Statistics, Applied Mathematics, Computer Science Member, Diversity and Inclusion Council, Bowers College of Computing and Information Science Research Interests Professor Bunea’s research lies at the intersection of statistical machine-learning theory and high-dimensional inference. She develops rigorous methodology supported by sharp theoretical guarantees to tackle core problems in modern data science. Recent themes include: Soft-max mixtures for understanding large-language-model/AI algorithms Optimal transport for high-dimensional mixture distributions Wasserstein-distance inference for sparse mixing measures in topic models Latent-space clustering and cluster-based inference in high dimensions Network modeling and hidden-structure inference Applications spanning genetics, systems immunology, neuroscience, sociology, and economics Research Funding & Awards Her work is supported by grants from the National Science Foundation (NSF-DMS). She is a Fellow of the Institute of Mathematical Statistics and a recipient of the IMS Medallion Award. Editorial & Service Contributions Associate Editor: Annals of Statistics, Bernoulli, JASA, JRSS-B, EJS, Annals of Applied Statistics Co-Editor: Chapman & Hall/CRC Statistics and Applied Probability Monograph Series Advising & Collaboration Professor Bunea has mentored numerous doctoral and post-doctoral researchers, including Xin Bing, Shuyu Liu, Seth Strimas-Mackey, and Yang Ning, among others. Collaborative projects extend across Cornell and external institutions, producing widely-used software packages and high-impact publications. Contact Office: 1184 Comstock Hall, Cornell University Email: fb238@cornell.edu Phone: (607) 255-8449
Dean Eckles is an Associate Professor of Marketing at MIT Sloan School of Management and serves as an Associate Director of the MIT Institute for Data, Systems, and Society (IDSS). He is also affiliated with the MIT Schwarzman College of Computing through the Institute for Data, Systems & Society and its Statistics and Data Science Center. Additionally, he leads the analytics research area at the Initiative on the Digital Economy and organizes the annual Conference on Digital Experimentation (CODE@MIT). His educational background includes a BA in philosophy, BS and MS in cognitive science, MS in statistics, and PhD in communication, all from Stanford University. Prior to joining MIT, Eckles worked as a scientist at Facebook, where he contributed to areas including News Feed, messaging, advertising, tools for randomized experiments, and survey methods. He previously held research positions at Nokia and Yahoo. Eckles's research primarily focuses on social influence mediated by interactive technologies, examining how communication technologies mediate, amplify, and direct social influence. His work spans multiple specific areas including social interactions, contagion, and interventions in networks; experimental design and inference in networks; and methods for causal inference. His research often combines social science with advanced statistical methods. His notable publications include research on long ties in social networks and their relationship to economic prosperity, how network structure affects social contagions, and algorithmic transparency in social media platforms. His work has appeared in prestigious journals including PNAS and Nature Human Behaviour, and he has provided expert testimony before the US Senate on algorithmic ranking. Long ties, disruptive life events and economic prosperity (PNAS) Long ties accelerate noisy threshold-based contagions (Nature Human Behaviour) Algorithmic transparency and assessing effects of algorithmic ranking (Senate testimony) Eckles actively shares his research through social media platforms including Bluesky, Twitter, and Mastodon, as well as through his blog and contributions to the Gelman et al. blog. His work bridges academic research with practical applications in technology and policy.
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.
Daniel M. Roy is a Full Professor at the University of Toronto, with cross-appointments in the Department of Computer Science, Department of Statistical Sciences, and Department of Electrical and Computer Engineering. He serves as Research Director at the Vector Institute and holds the CIFAR Canada AI Chair. Research Focus: Foundational principles of prediction, inference, and decision-making under uncertainty across machine learning, statistics, mathematical logic, applied probability, and computer science. Scientific Contributions: Key work in learning theory, statistical network analysis, probabilistic programming, and information-theoretic frameworks for generalization. Awards: ICML 2024 Best Paper Award for "Information Complexity of Stochastic Convex Optimization" and promotion to Full Professor in 2024. Student Advising: Actively mentors Ph.D. candidates and postdoctoral researchers with strong quantitative backgrounds, particularly at the intersection of machine learning, statistics, and computer science. Email: daniel.roy@utoronto.ca
Zaid Harchaoui is an Adjunct Professor in the Department of Statistics at the University of Washington. His research focuses on machine learning, generative AI, and algorithmic optimization, with applications spanning ecology, neuroscience, and artificial intelligence. He explores learning under distributional shifts and develops tools for scalable generative models in language and vision domains. University: University of Washington Department: Statistics Research Focus: Learning from data with computational, inferential, and mathematical rigor; distributional shift adaptation; generative model scaling Email: zaid@uw.edu His recent work emphasizes generative AI applications in ecology and neuroscience, stochastic optimization for robustness, and algorithmic efficiency in large-scale learning. Key contributions include techniques for distributionally robust optimization, interpretable authorship obfuscation, and uncertainty quantification in behavior classification. Scientific awards and honors are not explicitly mentioned in the provided text. Collaborative efforts often intersect with nonlinear control algorithms, spectral analysis, and privacy-preserving machine learning frameworks.
Professor Richard Samworth is a leading academic at the University of Cambridge , affiliated with the Department of Pure Mathematics and Mathematical Statistics and serving as Director of the Statistical Laboratory . His research focuses on Nonparametric and High-dimensional Statistics , addressing challenges in data analysis, statistical learning, and computational methods. Research Interests : Richard Samworth's work emphasizes Nonparametric Statistics , High-dimensional Data , and Statistical Learning . His research spans topics such as Missing Data , Changepoint Detection , Log-concave Density Estimation , and Subgroup Analysis , with applications in Machine Learning and Data Science . Key methodologies include Score Matching , Random Projections , and Minimax Estimation . Recent publications highlight advancements in Semi-Supervised Learning , Robust Statistical Testing , and High-dimensional PCA with heterogeneous missingness. His work bridges theoretical rigor with practical applications, particularly in Statistical Algorithms and Optimization .
Nils Fleischhacker is an Assistant Professor for Cryptography at Ruhr University Bochum, where he leads the Theoretical Cryptography group within the Faculty of Computer Science. His research focuses on foundational aspects of cryptography with particular emphasis on zero-knowledge proofs, digital signatures, and secure computation. Prior to joining Ruhr University, he held postdoctoral positions at Johns Hopkins University and Carnegie Mellon University. Dr. Fleischhacker received his PhD in Computer Science from Saarland University in February 2017, advised by Dominique Schröder. During his doctoral studies, he was a research intern at Microsoft Research with Chris Brzuska and a research visitor at the University of Maryland, College Park with Jonathan Katz and Dana Dachman-Soled. His research spans theoretical cryptography with significant contributions to zero-knowledge proofs, multi-signature schemes, property-preserving hash functions, and security proofs for cryptographic primitives. Fleischhacker's work often addresses fundamental questions about the limits and possibilities of cryptographic constructions, with particular attention to black-box separations and lower bounds. His recent publications demonstrate a strong focus on lattice-based cryptography and post-quantum secure protocols. Fleischhacker's publications over the past five years reveal a consistent research trajectory focused on improving the efficiency and security of cryptographic primitives, with particular emphasis on signature schemes, zero-knowledge protocols, and secure computation frameworks. His work frequently appears in top-tier cryptography venues including CRYPTO, EUROCRYPT, and CCS. Dr. Fleischhacker actively mentors PhD students, with numerous successful graduations spanning from 2010 to 2024. His former PhD students include Önder Askin (2024), Floyd Zweydinger (2023), and Lars Schlieper (2022), among others. His research is supported through various academic channels and collaborations. He is affiliated with several prominent research organizations including the Horst Görtz Institute (HGI) for Information Security, the DFG Excellence Cluster CASA, the EU Marie Curie Network QSI, and the International Association for Cryptologic Research (IACR). These affiliations provide a strong institutional framework for his theoretical cryptography research.
Jacob Fox is a Professor at Stanford University, specializing in Combinatorics and Probability. His research focuses on extremal combinatorics, Ramsey theory, graph theory, and additive combinatorics. He advises students like Maya Sankar. His work explores structural and enumerative aspects of graphs, hypergraphs, and combinatorial configurations. Recent studies include advancements in Ramsey numbers, sumset theory, and probabilistic methods in discrete mathematics. Key research areas include Ramsey numbers for sparse structures, hypergraph properties, and applications of combinatorial geometry. His publications often bridge theoretical insights with algorithmic applications. No scientific awards are listed in the provided text. His advising includes Maya Sankar, with research aligned to combinatorial problems. Collaborative projects involve extremal graph theory and probabilistic combinatorics. No labs or dedicated research groups are explicitly mentioned.
LEONG Tze Yun is a Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). She holds S.B., S.M., and Ph.D. degrees in Computer Science from the Massachusetts Institute of Technology (MIT). Her academic career spans both research and industry experience, with significant contributions to the fields of artificial intelligence and health informatics. Dr. Leong's educational background includes: Ph.D. in Electrical Engineering & Computer Science, Massachusetts Institute of Technology S.M. in Electrical Engineering & Computer Science, Massachusetts Institute of Technology S.B. in Computer Science & Engineering, Massachusetts Institute of Technology Her primary research interests focus on responsible AI, dynamic decision-making, neurocognitive modeling, reinforcement learning, artificial general intelligence, and biomedical and health informatics. Her work bridges the gap between theoretical AI development and practical healthcare applications, with an emphasis on ethical considerations and human-centered design. She directs the Medical Computing Laboratory at NUS, a multidisciplinary research program exploring human-aware decision modeling in complex environments. Analysis of her recent publications reveals a strong trend toward responsible AI development, with significant contributions to reinforcement learning techniques, causal inference methods, and applications of AI in healthcare. Her work increasingly integrates ethical considerations with technical AI development, particularly evident in her 2024 publications on medical AI and human values. Her scientific recognition includes: Fellow of the American College of Medical Informatics (ACMI) Founding Fellow of the International Academy of Health Sciences Informatics (IAHSI) Member of Eta Kappa Nu (Honor Society for Electrical Engineers) Dr. Leong has supervised numerous doctoral and master's students throughout her career, many of whom have gone on to prominent positions at institutions like Google, Netflix, Mayo Clinic, and academic institutions worldwide. Her advisory work extends to significant policy development, including contributions to WHO guidance on ethics and governance of AI for health. She currently serves on the World Health Organization (WHO) Expert Group on Ethics and Governance of AI for Health, the World Economic Forum (WEF) AI Governance Alliance, and the Advisory Council on AI in Uzbekistan. Her laboratory work focuses on developing adaptive systems that evolve with changing technical functionalities, system infrastructures, usage patterns, and operational contexts, with applications spanning prediction and decision analytics, human-aware robotics, game artificial intelligence, personalized education, and assistive care for elderly with neurocognitive disorders.
Alexis Battle is an Associate Professor at Johns Hopkins University with appointments in Biomedical Engineering , Computer Science , and Genetic Medicine (secondary). She directs the Malone Center for Engineering in Healthcare and serves as Deputy Director of the Data Science and AI Institute . Educated at Stanford University (PhD in Computer Science, 2013), Battle transitioned to academia after leadership roles at Google. Research Focus: Battle’s work bridges genomics and machine learning , emphasizing the impact of genetic variation on human health. Her lab develops tools like Watershed to predict functional effects of rare variants, aiming to enhance rare disease diagnosis. Key themes include non-coding DNA analysis , personalized genomics , and systems biology , with applications in cardiovascular disease and neurodegenerative disorders . Publications & Awards: Over 60 peer-reviewed articles in journals like Nature , Science , and Genome Biology , with recent emphasis on single-cell transcriptomics , multiomics integration , and telomere biology . Recipient of the President’s Frontier Award (2022), Microsoft Investigator Fellowship (2019), and Searle Scholar (2016). Scientific Awards: 2022 President’s Frontier Award 2019 Microsoft Investigator Fellowship 2019 Johns Hopkins Discovery Award 2017 Johns Hopkins Catalyst Award 2016 Searle Scholar Advising & Funding: Mentors 11 PhD students, 3 undergraduates, and postdoctoral fellows. Her research is funded by NIH, Searle Scholars, and institutional grants. The Battle Lab collaborates on projects like the GTEx Consortium , focusing on gene regulation and clinical genomics .
