Quanquan C. Liu is an Assistant Professor in the Department of Computer Science at Yale University, part of the School of Engineering & Applied Science. His research focuses on algorithms for large data, dynamic/distributed/parallel graph algorithms, and differential privacy. He holds a PhD from MIT's Theory Group, advised by Erik Demaine and Julian Shun, with postdoctoral experience at Northwestern University and MIT. Liu has authored over 50 publications in top venues like FOCS, SPAA, and STACS, and received a Best Paper Award at SPAA 2022. He advises a team of 12+ students, including PhD and undergraduate researchers. His service roles include PC membership for PPoPP, ESA, and SPAA, and coaching for the USA Computing Olympiad (USACO) and ICPC teams. Notable research contributions include advancements in parallel algorithms for graph problems and privacy-preserving techniques.
Steve Mussmann serves as an Assistant Professor in the School of Computer Science at the Georgia Institute of Technology, where he joined in Fall 2024. His research centers on data-centric machine learning, with emphasis on active labeling, data selection, and adaptive experimental design methodologies. He maintains active collaborations through Georgia Tech's Foundations of AI (FoAI) and ML@GT research groups. Mussmann earned his PhD in Computer Science from Stanford University in 2021 under Percy Liang's supervision, following a BS in Math, Statistics, and Computer Science from Purdue University in 2015. His professional trajectory includes a machine learning researcher role at Coactive AI and an IFDS postdoctoral fellowship at the University of Washington's Paul Allen School of Computer Science and Engineering. His research program investigates theoretical and practical aspects of data efficiency in machine learning systems, particularly focusing on active learning frameworks, statistical properties of data algorithms under concept drift, and task specification via prompts or demonstrations. Current projects address challenges in label-efficient training of large language models and multimodal dataset development. Analysis of his 15 most recent publications reveals a consistent focus on advancing data-centric methodologies, with increasing emphasis on large-scale applications like multimodal datasets and language model fine-tuning. His work bridges theoretical guarantees in experimental design with practical frameworks like LabelBench for benchmarking label efficiency. Mussmann has received recognition through the IFDS postdoctoral fellowship. His contributions to the field include foundational work on active learning theory and data selection algorithms. IFDS postdoctoral fellow He currently advises five graduate students including PhD candidates Kangping Hu (CS) and Hangyu Zhou (ML), alongside MS students Kabir Kang and Kalp Vyas, and undergraduate Saloni Bedi. Former advisee Wei-Liang (Edison) Liao completed BS research under his supervision. His teaching portfolio includes graduate courses CS 7545 (Machine Learning Theory) and CS 8803-DML (Data-centric Machine Learning). Mussmann operates within Georgia Tech's Foundations of AI initiative and ML@GT collective, which provide infrastructure for large-scale data-centric research. His lab develops open-source tools like LabelBench for reproducible evaluation of data selection techniques, with ongoing projects exploring video data exploration systems and adaptive finetuning frameworks for foundation models.
Shipra Agrawal is an Associate Professor at the Department of Industrial Engineering and Operations Research, Columbia University, with affiliations to the Data Science Institute and the Department of Computer Science. Her research bridges optimization and machine learning, focusing on decision-making in uncertain environments. PhD in Computer Science from Stanford University (2011) Researcher at Microsoft Research India (2011–2015) Her work addresses online optimization , reinforcement learning , and game theory , aiming to develop algorithms that balance exploration and exploitation for long-term goals. Applications include internet advertising , revenue management , and resource allocation . Recent publications examine dynamic pricing models, regret bounds in reinforcement learning, and convex knapsack optimization. Her research has been supported by NSF CAREER , Google Faculty Research , and Amazon Research Awards . NSF CAREER Award CMMI-1846792 (2019) Google Faculty Research Award (2017) Amazon Research Award (2017) She has advised PhD students who now hold positions at institutions like Google DeepMind, Amazon, and Facebook. Agrawal serves as an associate editor for Management Science , INFORMS Journal on Optimization , and Journal of Machine Learning Research , and co-chaired major conferences such as COLT 2024 and AISTATS 2025.
Stefano NASINI is an Associate Professor at the University of Lille 3, specializing in Quantitative Methods within the Economics and Mathematics Sciences. He holds a HDR (Habilitation à Diriger des Recherches) from the University of Lille 3 (2021), a Ph.D. in Statistics and Operations Research from the Polytechnic University of Catalonia (2015), and a Master in Statistics (2011). His research focuses on optimization, complex networks, statistical inference, and microeconomic applications. He has held academic positions including a post-doctoral role at IESE Business School (2014–2016) and a visiting researcher role at the University of Lisbon (2014). His work spans scheduling optimization, network analysis, financial contagion modeling, and energy system planning. Key contributions include specialized algorithms for large-scale optimization problems and frameworks for decentralized portfolio management. He is a member of the LEM research group and teaches courses in optimization, econometrics, and social network analysis at the Grande École and MSc levels. Publications highlight interdisciplinary applications, including network-based diffusion models, multi-market financial strategies, and dynamic choice analysis. His research bridges theoretical advancements in operations research with practical challenges in economics, energy, and transportation systems. No scientific awards are explicitly listed in the provided materials. His advising roles and grants are not detailed here, but his extensive publication record reflects active collaboration within academic and applied domains.
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.
Bernhard J. Berger is a Lecturer in the Department of Computer Engineering at the Institute of Embedded Systems, Hamburg University of Technology (TUHH). His research focuses on software security, static code analysis, machine learning, optimization, and research data management. He has held significant roles such as Program Committee member for ICPC 2025 and MSR 2025, and has received awards including the Best Reviewer Award (ICPC 2023) and Best Engineering Paper Award (SCAM 2019). His work spans interdisciplinary applications including maritime systems security, GPU-accelerated AI, and evolutionary algorithms. Recent studies emphasize AI-driven security tools (e.g., ML-SAST) and domain-specific language approaches to optimization (EvoAl). He has contributed to over 30 peer-reviewed publications, with notable work in IEEE Transactions on Software Engineering and Science of Computer Programming. Berger collaborates closely with industry through DAAD review committees and serves on artifact evaluation boards for ISSTA and ARES conferences. Education: Doctoral Thesis (2022), Diploma in Computer Science (2007) Key Projects: ArchSec tool suite, Threat Modeling Frameworks, Bauhaus static analysis methodology Lab Affiliation: Embedded Systems Design Group His advisory roles include Deputy of TUHH's Election Verification Committee and Session Chair at IEEE Congress on Evolutionary Computation 2023. Current research trends integrate machine learning with static analysis for automated vulnerability detection, while also exploring explainable AI techniques for neural network optimization.
Rina Dechter is a Professor of Computer Science at the University of California, Irvine (UCI), affiliated with the Donald Bren School of Information and Computer Sciences (ICS). She specializes in automated reasoning, probabilistic and constraint-based graphical models, and causal inference. Dechter has held leadership roles, including Co-Editor-in-Chief of Artificial Intelligence since 2011 and editorial board memberships in journals such as the Constraint Journal and Journal of Machine Learning Research . Education : Ph.D., Computer Science, University of California, Los Angeles (UCLA) M.S., Applied Mathematics, Weizmann Institute B.S., Mathematics and Statistics, Hebrew University of Jerusalem Research Interests : Dechter’s work focuses on computational aspects of automated reasoning, constraint processing, probabilistic reasoning, and causal inference. She develops efficient algorithms for graphical models, emphasizing tractable reasoning tasks and anytime search strategies. Her recent projects include causal decision-making frameworks funded by a $5M NSF grant. Awards : Presidential Young Investigator Award (1991) AAAI Fellow (1994) ACP Research Excellence Award (2007) ACM Fellow (2013) Elected to the American Academy of Arts & Sciences (2025) Grants & Collaborations : She leads a multi-institutional NSF-funded project on causal foundations of AI decision-making. Her work emphasizes trustworthiness in AI through causal models, with applications in robotics and public health.
Mohsen Ghaffari is an Associate Professor at MIT's Department of Electrical Engineering and Computer Science (EECS), holding the Steven and Renee Finn Chair. His research focuses on theoretical computer science, particularly distributed and parallel algorithms, graph theory, and network optimization. Formerly, he was a tenured CS faculty member at ETH Zurich until 2022. PhD in Computer Science from MIT (2016) His research interests include distributed algorithms, parallel computing, graph decomposition, and network congestion management. His recent work addresses coreness decomposition, spanner construction, and Euclidean k-center optimization in massive parallel computation frameworks. Notable scientific awards include the ACM Doctoral Dissertation Award (Honorable Mention), ACM-EATCS Doctoral Dissertation Award, and multiple best paper awards at FOCS, PODC, and SODA. He has advised numerous PhD and Master's students, many of whom have transitioned to academic and industry roles. He has taught courses at MIT and ETH Zurich on distributed algorithms, advanced algorithms, and massively parallel computation. His professional activities include serving on program committees for SODA, FOCS, STOC, and organizing workshops like Highlights of Algorithms (HALG) and Workshop on Local Algorithms (WOLA).
Jan Dreier is a Research Fellow at the Institute of Logic and Computation at Vienna University of Technology. His research centers on structural graph theory and algorithmic meta-theorems, particularly exploring the boundaries of tractability for model checking problems. Dreier's work bridges theoretical computer science and discrete mathematics, focusing on graph decompositions, parameterized complexity, and logical expressiveness. Key research themes include monadic stability in graph classes, applications of model theory to computer science, and efficient algorithms for logical queries on structured graphs. His publication record shows consistent focus on graph sparsity concepts and algorithmic applications of logic, with recent work expanding into approximation methods for counting queries. Research demonstrates sophisticated applications of combinatorial methods to fundamental problems in computational complexity.
Alexandra Boldyreva is a Professor at the Georgia Institute of Technology, holding joint appointments in the School of Cybersecurity and Privacy and the School of Computer Science. She serves as Associate Chair for Graduate Studies in the School of Cybersecurity and Privacy and coordinates the Information Security Master’s program in the College of Computing. Her affiliations include the Institute for Information Security & Privacy (IISP), the Algorithms, Combinatorics and Optimization (ACO) program, and the Algorithms and Randomness Center (ARC). She earned her Ph.D. in Computer Science from the University of California, San Diego, and holds bachelor’s and master’s degrees in applied mathematics from St. Petersburg State Technical University, Russia. Her research focuses on cryptography and information security, with notable contributions to encryption methods, authentication protocols, and privacy-preserving systems. Boldyreva’s work emphasizes provable security analysis of protocols like FIDO2 and TLS 1.3, as well as searchable encryption and data privacy techniques. Her recent studies include secure communication channel establishment, leakage quantification in encryption systems, and applications of fuzzy search in encrypted databases. She has received Test of Time Awards for foundational contributions to cryptography. Boldyreva leads initiatives in cybersecurity education and has secured grants for research in secure communication protocols and human-computing approaches to key exchange. Her interdisciplinary collaborations span computer science, mathematics, and privacy engineering.
John Paisley is an Associate Professor of Electrical Engineering at Columbia University's Fu Foundation School of Engineering and Applied Science, and a member of Columbia's Data Science Institute (DSI). He holds a B.S., M.S., and Ph.D. in Electrical and Computer Engineering from Duke University (2004-2010), followed by postdoctoral research in Computer Science at Princeton University and UC Berkeley. His research focuses on Bayesian models, posterior inference techniques for Big Data, and applications in data analysis, recommendation systems, information retrieval, and compressed sensing. He has pioneered methods like Bayesian Gaussian Process ODEs and Double Normalizing Flows, with recent work emphasizing uncertainty quantification in environmental modeling and neuroimaging analysis. His collaborative workflows (e.g., bneR ) address air pollution exposure and PM2.5 concentration uncertainties, combining Bayesian nonparametric ensembles with geospatial data. He has also developed frameworks for neural network interpretability, image denoising, and compressed sensing MRI. Paisley's work bridges statistical theory and applied machine learning, with applications in healthcare, environmental science, and geophysics. His academic contributions include over 50 publications since 2016, spanning topics like deep metric learning, adversarial learning, and variational inference optimization. He maintains an active research group and serves on editorial boards for machine learning and signal processing journals.
Navid Azizan is the Alfred H. (1929) and Jean M. Hayes Career Development Assistant Professor at Massachusetts Institute of Technology (MIT), holding dual appointments in the Department of Mechanical Engineering (in Control, Instrumentation & Robotics) and the Schwarzman College of Computing's Institute for Data, Systems & Society (IDSS). He is also a Principal Investigator in the Laboratory for Information & Decision Systems (LIDS), and a faculty member of the MIT Statistics and Data Science Center, the Center for Computational Science and Engineering, and the Operations Research Center. Dr. Azizan received his PhD in Computing and Mathematical Sciences from the California Institute of Technology (Caltech) in 2020, his MSc in Electrical Engineering from the University of Southern California in 2015, and his BSc in Electrical Engineering with a minor in Physics from Sharif University of Technology in 2013. Prior to joining MIT, he completed a postdoc at Stanford University's Autonomous Systems Laboratory and was a research scientist intern at Google DeepMind. His research spans the intersection of machine learning, systems and control, mathematical optimization, and network science. Dr. Azizan's work focuses on developing principled learning and optimization algorithms for reliable intelligent systems, with applications to autonomy and sociotechnical systems. His research has significant implications for creating trustworthy AI systems that can operate effectively in complex, uncertain environments. Dr. Azizan's recent publications demonstrate a strong focus on uncertainty quantification, reliable AI systems, constrained optimization, and control-oriented learning. His work bridges theoretical foundations with practical applications, particularly in autonomous systems where safety and reliability are paramount. His research group has made notable contributions to areas including neural network verification, multi-agent reinforcement learning, and adaptive inference techniques for large language models, with several papers featured on MIT News and selected for oral presentations at top conferences. Alfred H. (1929) and Jean M. Hayes Career Development Professorship (2025-present) Frank E. Perkins Award for Excellence in Graduate Advising (2025) List of Outstanding Academic Leaders in Data from the CDO Magazine (2024, 2023) Amazon Science Hub Research Award (2023) Outstanding UROP Faculty Mentor (2023) Esther and Harold E. Edgerton (1927) Career Development Chair (2022-2025) Information Theory and Applications (ITA) Gold Graduation Award (2020) Dr. Azizan has been recognized for his excellence in graduate advising, receiving the Frank E. Perkins Award for Excellence in Graduate Advising in 2025. During the pandemic, he founded and co-organized the 'Control meets Learning' virtual seminar series, connecting researchers across disciplines. His work has attracted significant research funding from industry partners including Google, Amazon, and MathWorks, supporting both fundamental research and practical applications in reliable intelligent systems. The Azizan Lab at MIT brings together researchers from mechanical engineering, computer science, and applied mathematics to tackle challenges at the intersection of learning and control. The lab emphasizes both theoretical foundations and practical implementations, with a particular focus on developing algorithms that provide guarantees of performance and safety. Current research directions include uncertainty quantification in AI systems, constrained optimization for neural networks, and control-oriented learning for autonomous systems, with applications spanning robotics, transportation, and complex sociotechnical systems.
Zachary Ives is the Adani President's Distinguished Professor and Department Chair of the Computer and Information Science Department at the University of Pennsylvania. He holds affiliations with the ASSET Center for Safe, Explainable and Trustworthy AI, the Warren Center for Network and Data Science, the Center for Neuroengineering and Therapeutics, and serves as a Distinguished Research Fellow at the Annenberg Center for Public Policy. His research focuses on data integration and sharing, data provenance and trustworthiness, and machine learning systems. He develops data science platforms at the intersection of databases, machine learning, and distributed systems, with applications in Web question answering and scientific domains like genetics and neuroscience. His work addresses fundamental challenges in integrating heterogeneous data, ensuring trustworthy results, and facilitating collaborative data science. His recent publications demonstrate a strong focus on data lakes, learned database systems, fine-grained provenance, and question answering systems. These works span top conferences including SIGMOD (where his paper was selected as Best Paper in 2024), VLDB, ACL, and PODS, showing the breadth of his contributions across database systems, natural language processing, and data management. NSF CAREER award recipient Fellow of the ACM Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching IEEE Technical Committee on Data Engineering Education Award SIGMOD Best Paper Award ICDE 2013 ten-year Most Influential Paper award As Department Chair, Ives has overseen significant departmental growth, hiring 25 new faculty since 2018. He advises numerous PhD students and postdocs, and maintains extensive collaborations across Penn and with external institutions. His research has been funded by NSF, NIH, DARPA, Google, Amazon, and other organizations. He has developed courses including NETS 212 'Scalable and Cloud Computing' and teaches Big Data Analytics. His research group, the Penn Database Group, works on projects including data lake management, data provenance, and collaborative data science platforms. His work with neuroscientists on seizure prediction has received significant attention, including a competition with 504 teams achieving 82% accuracy.
Kuldeep S. Meel is the Stephen Fleming Early-Career Associate Professor at the School of Computer Science, Georgia Institute of Technology, and an Associate Professor at the University of Toronto (on leave). He previously held a NUS Presidential Young Professorship at the National University of Singapore. His research focuses on automated reasoning, aiming to enable computing systems to handle uncertain real-world environments through scalable techniques integrating randomized algorithms, statistical inference, formal methods, distribution testing, and software engineering. Core research areas: Automated Reasoning, Formal Methods, Approximate Model Counting, Probabilistic Inference, Constraint Solving His research group has achieved significant recognition in both individual awards and publications. Key trends in his recent work include advancing model counting algorithms, developing frameworks for probabilistic explanations, and improving scalability in formal verification and constraint satisfaction. His tools have consistently ranked top in international competitions, demonstrating practical impact in automated reasoning. 2019 NRF Fellowship for AI 2022 ACP Early Career Researcher Award 2020 IEEE Intelligent Systems AI's 10 to Watch Top placements in Model Counting, SAT, and CAV competitions He mentors a diverse group of PhD and Master's students and collaborates with institutions worldwide. His group's publications span premier conferences in AI, formal methods, and design automation, reflecting interdisciplinary contributions to theoretical and applied computer science.
David Bindel is an Associate Professor in the Department of Mathematics at Cornell University, affiliated with the College of Arts and Sciences, College of Engineering, and Cornell Ann S. Bowers College of Computing and Information Science. He earned his Ph.D. in Mathematics from the University of California, Berkeley in 2006. His research focuses on applied numerical linear algebra, eigenvalue problems, and their applications in plasma physics, network analysis, and nonlinear systems. He develops methods for analyzing complex systems, including magnetic confinement in stellarators, stability of MHD systems, and community detection in networks. His work bridges theoretical foundations with practical computational tools, such as formal verification of linear algebra algorithms and scalable Gaussian process models. Bindel’s research explores the interplay between structure and computation, leveraging eigenvalue analysis to address challenges in computer vision, opinion dynamics, and engineering design. He has contributed to advancements in numerical methods for large-scale systems, including iterative solvers, spectral approximation techniques, and stochastic optimization. His interdisciplinary approach spans applied mathematics, computer science, and physics, with applications in fusion energy, machine learning, and network science. Recent work highlights include high-order expansions for magnetic confinement, adaptive filtering for dynamical systems, and Bayesian optimization strategies. His publications emphasize rigorous analysis alongside computational scalability, addressing both theoretical and practical aspects of modern scientific computing. Despite no explicitly listed awards, his contributions reflect significant impact in his fields.
