Viswanath Nagarajan is an Associate Professor of Industrial & Operations Engineering and Computer Science Engineering (courtesy) at the University of Michigan. His research focuses on combinatorial optimization, approximation algorithms, and stochastic models for routing, scheduling, and location problems. He previously served as an Assistant Professor at the University of Michigan (2014–2020) and a Research Staff Member at IBM T.J. Watson Research Center (2009–2014). He holds a Ph.D. in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University (2004–2009) and a B.Tech. in Computer Science from IIT Bombay (1999–2003). His research explores uncertainty management in optimization, including stochastic models and approximation algorithms for decision-making under uncertainty. He has contributed to adaptive algorithms, submodular optimization, and applications in logistics, network design, and scheduling. Education: Ph.D., Algorithms, Combinatorics, and Optimization (Carnegie Mellon University, 2009) B.Tech., Computer Science and Engineering (IIT Bombay, 2003) Prof. Nagarajan has organized major conferences like IPCO 2019 and served on editorial boards for journals including Operations Research , ACM Computing Surveys , and ACM Transactions on Algorithms . His service includes program committees for SODA, APPROX, and IPCO. He advises Ph.D. students focusing on optimization theory and applications, with advisees securing positions at Yahoo! Research, the University of Chicago, Ford Motor Company, and Georgia Tech.
Olga Veksler is a Professor at the University of Waterloo's Department of Computer Science, part of the Faculty of Mathematics. She holds a Ph.D. and M.Sc. from Cornell University (1999) and a B.A. from New York University (1995). Her research focuses on computer vision, machine learning, and discrete optimization, with notable contributions to image segmentation, graph algorithms, and deep learning integration. Her work emphasizes semantic segmentation, salient object detection, and efficient optimization techniques for graphical models. Education: Ph.D. in Computer Science, Cornell University, 1999 M.Sc. in Computer Science, Cornell University, 1999 B.A. in Computer Science, New York University, 1995 Her research explores intersections between machine learning and traditional computer vision challenges, particularly leveraging graph-based optimization and CRF models. Recent trends in her work include weakly supervised learning, sparse non-local CRF applications, and test-time adaptation strategies for salient object detection. She has pioneered methods for shape priors in multi-object segmentation and efficient graph-cut algorithms. Her advising and grant activities are foundational to her research, though specific grant details are not listed here. She maintains a lab focused on advancing computer vision through algorithmic innovation, with contributions to both theoretical frameworks and practical applications in medical imaging and scene understanding.
Krishna Gummadi is a Scientific Director and Professor at the Max Planck Institute for Software Systems (MPI-SWS) in Germany, where he leads the Networked Systems Research Group. He also holds a professorship at the University of Saarland, demonstrating his dual commitment to research and academic instruction in computer science. His educational background includes: Ph.D. in Computer Science and Engineering from the University of Washington (2005) B.Tech. in Computer Science and Engineering from the Indian Institute of Technology, Madras (2000) Gummadi's research spans networked and distributed computer systems with a current focus on social computing systems. His work addresses critical challenges in algorithmic fairness, privacy in social media, trustworthiness of online identities, and information dissemination in social networks. He approaches these problems through interdisciplinary methods combining user-centric studies, data-centric analysis, and systems-centric design to create practical solutions that enhance fairness, transparency, and user control in online platforms. His methodology integrates large-scale observational studies, computational modeling, and system implementation to tackle complex human-computer interaction challenges at societal scale. His recent publications reveal a strong emphasis on fairness in algorithmic decision making, with significant contributions to quantifying and addressing discrimination in machine learning systems. His work bridges computer science, social science, and ethics, creating frameworks for fair classification, understanding media bias, and developing privacy-preserving techniques that maintain functionality while protecting user data. The research demonstrates a progression from technical system design to addressing societal implications of computing systems. Among his notable scientific achievements: ERC Advanced Grant in 2017 for 'Foundations for Fair Social Computing' Test of Time Awards at ACM SIGCOMM and AAAI ICWSM Casper Bowden Privacy Enhancing Technologies (PET) and CNIL-INRIA Privacy Runners-Up Awards IW3C2 WWW Best Paper Honorable Mention Multiple Best Paper awards across prestigious conferences Gummadi has advised numerous PhD students and postdoctoral researchers who have gone on to prominent positions in academia and industry. His ERC Advanced Grant has supported extensive research into fair social computing, while his leadership in major conferences (including serving as General Chair for ICWSM 2016 and Program Chair for WWW 2015) has shaped research directions in the field. His teaching portfolio includes courses on Distributed Systems, Human-Centered Machine Learning, and Social Media Analysis. He leads the Networked Systems Research Group at MPI-SWS, which has developed several publicly available systems including tools for fair classification, privacy risk assessment, trust evaluation in social media, and information diet management. The group's work bridges theoretical advances with practical implementations that address real-world challenges in social computing, with numerous software releases and datasets made available to the research community.
Melanie Weber is an Assistant Professor of Applied Mathematics and Computer Science at Harvard University's John A. Paulson School of Engineering and Applied Sciences (SEAS), leading the Geometric Machine Learning Group. Her research focuses on leveraging geometric structures in data for designing efficient machine learning and optimization algorithms with theoretical guarantees. She holds a PhD from Princeton University (2021) and has held fellowships at the Mathematical Institute of Oxford, Brasenose College, and the Simons Institute. Her work bridges geometry, optimization, and machine learning, with funding from NSF, Sloan Foundation, and Harvard initiatives. Education : PhD in Applied Mathematics, Princeton University (2021) BSc/MSc in Mathematics and Physics, University of Leipzig (2016) Research Interests : Dr. Weber's research integrates geometric principles into machine learning and optimization, focusing on non-Euclidean spaces, graph structures, and manifold-based methods. Key areas include optimization on Riemannian manifolds, curvature-based analysis (e.g., Ricci curvature), and developing algorithms resilient to data geometry challenges like over-smoothing in graph neural networks. Her work emphasizes theoretical foundations while addressing practical scalability in high-dimensional data. Awards & Recognition : 2024 Sloan Research Fellowship 2023 Leslie Fox Prize in Numerical Analysis 2023 NSF Grant for Geometric Optimization Grants & Funding : Supported by National Science Foundation (NSF), Alfred P. Sloan Foundation, Aramont Foundation, Harvard Dean’s Fund, and Harvard Data Science Initiative. Labs & Collaborations : Leads the Geometric Machine Learning Group at SEAS, collaborating with institutions like MIT, Max Planck Institute, and industry labs (Facebook, Google, Microsoft). Active in organizing workshops on geometric methods and curvature analysis.
Bryon Aragam is an Associate Professor of Econometrics and Statistics and Robert H. Topel Faculty Scholar at the University of Chicago Booth School of Business. His research focuses on the intersection of causality, statistical machine learning, and probabilistic modeling, with particular emphasis on applications to artificial intelligence systems including large language models like ChatGPT and generative models like DALL-E. Dr. Aragam completed his PhD in Statistics and a Masters in Applied Mathematics at UCLA, where he was an NSF graduate research fellow. Prior to joining the University of Chicago, he was a project scientist and postdoctoral researcher in the Machine Learning Department at Carnegie Mellon University. Research Focus: Causal structure learning in probabilistic generative models Key Areas: Causal machine learning, deep generative models, latent variable models, statistical learning theory Applications: AI interpretability, ethics, and fairness in artificial intelligence systems Teaching: Business Statistics, Econometrics and Statistics Colloquium His recent publications demonstrate a strong theoretical foundation combined with practical applications, particularly in understanding and improving AI systems. His work spans causal discovery, graphical models, deep learning, and latent variable modeling, with particular attention to the theoretical properties of these methods and their applications to real-world AI challenges. The research shows a progression toward increasingly complex problems in causal representation learning and AI interpretability. Scientific Awards: Robert H. Topel Faculty Scholar NSF Graduate Research Fellow Dr. Aragam's work has been published in top statistics and machine learning venues including the Annals of Statistics, Neural Information Processing Systems (NeurIPS), the International Conference on Machine Learning (ICML), and the Journal of Machine Learning Research (JMLR). His research group publishes broadly across both statistical and machine learning communities, demonstrating the interdisciplinary nature of his work at the intersection of statistics, machine learning, and causal inference. As a data science consultant for technology and marketing firms, Dr. Aragam has applied his expertise to problems in survey design, customer retention, logistics, and ranking, bridging the gap between theoretical research and practical applications.
Andrew McCallum is a Distinguished Professor and Director of the Center for Data Science at the University of Massachusetts Amherst. He holds a PhD in Computer Science from the University of Rochester (1995) and a BS from Dartmouth College (1989). His research focuses on machine learning, natural language processing, and information extraction, with applications to scientific literature and knowledge base construction. He has pioneered work on conditional random fields and probabilistic databases, and led the development of systems like Rexa, an advanced research paper search engine. Affiliations: Center for Data Science, Center for Intelligent Information Retrieval, Computational Social Science Institute Key Projects: OpenReview.net, Unified Information Extraction, Automated Knowledge Base Construction His work emphasizes extracting actionable knowledge from unstructured text, with contributions to social network analysis, entity resolution, and semi-supervised learning. McCallum has over 300 publications and has received awards including the NSF ITR Grant, IBM Faculty Partnership Awards, and ACM/AAAI Fellowships. He has advised numerous students and served as ICML General Chair (2012). Recent Research Trends: Probabilistic box embeddings, case-based reasoning for knowledge bases, scalable clustering algorithms, and applications in biomedical informatics.
Andrew Li is an Associate Professor of Operations Research at Carnegie Mellon University's Tepper School of Business since 2024, previously serving as Assistant Professor since 2018. His research bridges statistics, optimization, and machine learning with applications to healthcare operations and retail management. Current teaching: Optimization, Business Analytics Capstone, and Topics in Optimization and Statistics PhD from MIT's Operations Research Center (2018), BS in Operations Research/Applied Mathematics from Columbia University (2012) Research Focus: Dr. Li develops data-driven decision frameworks for complex systems. Key areas include: Experience-based learning models with fairness constraints (organ allocation) Anomaly detection in low-rank matrices (retail inventory accuracy) Nanoparticle-based diagnostic systems for CAD and Alzheimer's Nonstationary demand forecasting in supply chains Publication Trends: Recent work combines bandit algorithms with healthcare applications (split liver transplants, CAD detection) and retail operations (inventory accuracy). Theoretical contributions include regret-optimal policies and entrywise anomaly detection guarantees. Scientific Honors: INFORMS Nicholson Award (2018) INFORMS Pierskalla Award (2021) NSF CAREER Award (2023) Professional Leadership: Active in INFORMS and CMU committees including MBA Analytics Curriculum, Thompson Award, and ENAiBLE AI-driven retail collaborative co-founder since 2021.
Mohammadtaghi Hajiaghayi is the Jack and Rita G. Minker Professor of Computer Science at the University of Maryland, College Park. He is affiliated with the Robert H. Smith School of Business and holds Research Affiliate positions at MIT CSAIL and the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). His research focuses on algorithms, game theory, and network design, supported by NSF, ONR, and industry grants. He has received prestigious awards including ACM Fellow (2018) and EATCS Nerode Prize (2015) for his work on bidimensionality theory. Education: PhD from MIT (2005), postdocs at CMU and MIT, MSc from University of Waterloo, and BSc from Sharif University. He teaches courses like Data Science and Algorithms at UMD. Industry experience includes roles at Amazon, Google, and AT&T Labs. Over 20 students have graduated under his advisement, many in academia and industry. His work spans approximation algorithms, game theory, and big data. Projects include BigDND with Erik Demaine. He serves on editorial boards of Algorithmica, SODA, and others. Awards also include IEEE Fellow (2020) and Blavatnik Honoree (2020).
Satish Rao is a Professor in the Computer Science Division at the University of California, Berkeley. He is affiliated with the Simons Institute for the Theory of Computing and the Center for the Theoretical Foundations of Learning, Inference, Information, Intelligence, Mathematics and Microeconomics at Berkeley (CLIMB). His research focuses on algorithms, combinatorial optimization, graph theory, and theoretical computer science with applications to computational biology and machine learning. Rao has held teaching roles for courses such as CS 70 (Discrete Mathematics and Probability Theory) and CS 270 (Spring 2024). He has been recognized with prestigious awards including ACM Fellow (2013), the Delbert Ray Fulkerson Prize (2012), and the Okawa Research Grant (1999). Research Interests: Algorithm design, graph algorithms, combinatorial optimization, computational biology, and machine learning. Key Contributions: Pioneering work on metric embeddings, approximation algorithms, and network flow problems. Notable publications include foundational papers on tree metrics, distributed object location, and electrical flow-based optimization. Rao’s work bridges theoretical computer science with practical applications, including contributions to phylogeny estimation, anomaly detection, and parallel computing frameworks like the BSP model.
Tomasz Strzalecki is a Professor in the Department of Economics at Harvard University. His research centers on decision theory, with a focus on ambiguity aversion , temporal preferences , stochastic choice , and bounded rationality . He earned his PhD in Economics from Northwestern University in 2008. Education: PhD in Economics (2008), Northwestern University His scholarly work spans theoretical and applied economics, including key contributions to random utility models , dynamic decision-making , and neuroeconomic modeling . Recent publications, such as Stochastic Choice Theory (2025) and Variational Bayes and non-Bayesian Updating (2024), reflect his ongoing exploration of Bayesian inference and behavioral deviations. Earlier work in Econometrica and American Economic Review established foundational models for choice aversion , time inconsistency , and ambiguity evaluation . Tomasz’s research has been published in top journals like Econometrica , American Economic Review , and Proceedings of the National Academy of Sciences , covering themes such as probabilistic sophistication , decision timing , and collective action in development economics. His co-authors include prominent economists like Drew Fudenberg, Mira Frick, and Larry Epstein.
Ying MacNab is an Associate Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver Campus. She holds an additional affiliation as an Associate Member in the School of Population and Public Health (SPPH). Her research focuses on Bayesian hierarchical modeling, spatial epidemiology, and disease mapping with applications to public health surveillance and aging populations. She has contributed extensively to methodological advancements in Gaussian Markov random fields and spatiotemporal modeling frameworks. Her work bridges statistical theory and practical health challenges, including pandemic-related stress in older adults, opioid treatment outcomes, and infectious disease forecasting. MacNab has collaborated on projects involving mental health assessments (e.g., sleep dysfunction, anxiety/depression in iOAT patients) and has developed novel statistical tools for analyzing spatially and temporally correlated health data. Her research also addresses methodological gaps in coregionalized multivariate models and constrained Bayesian estimation. MacNab's publications reflect a multidisciplinary approach, integrating epidemiological theory with advanced computational methods. Recent trends in her work emphasize dynamic modeling of infection risks, mediation analysis in aging populations, and validation of psychometric scales for health-related stress. She has maintained an active research agenda since the early 2000s, with notable contributions to neonatal health outcomes, injury surveillance, and healthcare quality improvement.
Anshumali Shrivastava is an Associate Professor of Computer Science, Electrical and Computer Engineering, and Statistics at Rice University, affiliated with the George R. Brown School of Engineering. His research focuses on large-scale machine learning, randomized algorithms for big data, and graph mining. He holds a PhD from Cornell University (2015) and an MSc from the Indian Institute of Technology Kharagpur (2008). His research interests span scalable deep learning, efficient neural network inference, and probabilistic algorithms. He has pioneered techniques in compressed learning, hashing-based search, and distributed optimization for handling massive datasets. Notable contributions include methods for accelerating LLM inference, memory-efficient quantization, and graph processing algorithms. Teaching: Probabilistic Algorithms, Large-Scale ML, and Machine Learning Seminars Awards: Charles W. Duncan Jr. Achievement Award (2023), Young Faculty Research Award (2021), NSF CAREER Award (2017), and multiple best paper awards His work bridges algorithm design with practical applications in recommendation systems, genomics, and edge computing. Current efforts focus on sustainable AI, hardware-aware compression, and efficient training/inference pipelines for large models.
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Uzi Vishkin is a Professor at the University of Maryland's Institute for Advanced Computer Studies (UMIACS) and Department of Electrical and Computer Engineering, with additional affiliation in the Department of Computer Science. His work focuses on parallel computing, including the PRAM-On-Chip vision to bridge parallel algorithms and hardware. He holds a D.Sc. from Technion (1981), M.Sc. and B.Sc. in Mathematics from Hebrew University (1975/1974). Research interests span parallel algorithms, PRAM (Parallel Random Access Machine) architecture, machine learning applications, and pattern matching. His PRAM-On-Chip project aims to create a coherent computing stack for many-core processors. Vishkin has contributed to theoretical foundations and practical implementations, including the XMT architecture and compiler. He has been recognized with ACM Fellow (1996), Highly Cited Researcher (2003), and National Academy of Inventors Fellow (2024). Awards highlight his pioneering work in parallel algorithms and computing systems. Teaching spans courses like Parallel Algorithms and Mathematical Foundations for Computer Engineering. He emphasizes parallel algorithmic thinking in education and has developed teaching materials for high school and university levels. Key projects include the XMT architecture, simulations, and tools for parallel programming. His work integrates algorithmic theory with hardware design to address programming challenges in many-core systems.
David Alan Goldberg is an Associate Professor in the School of Operations Research and Information Engineering (ORIE) at Cornell University, part of Cornell Engineering. He joined Cornell in 2017 and previously held the A. Russel Chandler III Associate Professorship at Georgia Tech’s Industrial and Systems Engineering department. Goldberg earned his Ph.D. in Operations Research from MIT (2011) and a B.S. in Computer Science from Columbia University (2006). Education: B.S. in Computer Science, Columbia University (2006) Ph.D. in Operations Research, MIT (2011) Research Interests: Goldberg’s work focuses on applied probability and stochastic processes, including optimal stopping, inventory and queueing models, combinatorial optimization, and robust optimization. He develops algorithms and insights for complex systems, addressing challenges like the curse of dimensionality. His research spans applications in data science, operations research, and stochastic modeling. Notable contributions include distributionally robust inventory control and high-dimensional decision-making frameworks. Awards and Honors: 2025 Community-Engaged Practice and Innovation Award (David M. Einhorn Center) 2023 Sunny Yau ’72 Teaching Award (Cornell) 2019 INFORMS Applied Probability Society Best Publication Award 2015 NSF CAREER Award Multiple INFORMS Nicholson Student Paper Competitions (First Place, 2019 & 2015) Teaching and Service: Goldberg leads Cornell ORIE’s undergraduate research program, connecting students to real-world applications of OR and data science. He teaches courses in probability modeling, stochastic models, and academic skills for PhD students. He chairs the INFORMS Applied Probability Society and serves on editorial boards for Operations Research and Stochastic Systems . At Cornell, he advises the Undergraduate ORIE Society and directs undergraduate studies in ORIE. Labs & Collaborations: Goldberg’s research integrates theoretical rigor with practical applications, often involving collaborations across disciplines. His work bridges operations research, statistics, and computer science to address modern challenges in inventory systems, queueing networks, and decision-making under uncertainty.
