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).
Andrea Bajcsy serves as an Assistant Professor in the Robotics Institute and School of Computer Science at Carnegie Mellon University, leading the Interactive and Trustworthy Robotics Lab (Intent Lab). Her work focuses on enabling robots to safely interact with open-world environments through novel algorithms in control theory and machine learning. Her educational background includes a Ph.D. in Electrical Engineering & Computer Science from UC Berkeley under Anca Dragan and Claire Tomlin, followed by a postdoctoral position with Jitendra Malik and industry experience at NVIDIA's Autonomous Vehicle Research Group. Research centers on quantifying robot confidence, computing safe interaction policies for nuanced hazards (tearing, spilling, breaking), and aligning AI with human values. Key methodologies integrate optimal control, reinforcement learning, dynamic game theory, and deep learning, applied to robotic arms, quadrotors, quadrupeds, and autonomous vehicles. Core areas include safety for physical human-robot interaction, robot learning for manipulation, and world modeling. Recent publications (2024-2025) reveal a concentrated effort on uncertainty-aware safety mechanisms, out-of-distribution adaptation, and language-based safety specification. Her work increasingly bridges conformal prediction with interactive learning while leveraging vision-language models for real-time policy steering, as evidenced by multiple CoRL, RSS, ICRA, and ICLR acceptances. Scientific Awards: NSF CAREER Award (2025) Advises four active PhD students (Kensuke Nakamura, Ravi Pandya, Junwon Seo, Yilin Wu) and leads research funded by the NSF CAREER grant. Organizes community initiatives including the Northeast Systems and Control Workshop and ICRA workshops on Safely Leveraging VLMs in Robotics and Public Trust in Autonomy. Directs the Intent Robotics Lab, which develops theoretical frameworks and practical implementations for open-world robot safety. The lab maintains strong industry ties through NVIDIA collaborations and emphasizes real-world deployment across multiple robotic platforms.
Eric V. Mazumdar is an Assistant Professor at the California Institute of Technology (Caltech), jointly appointed in the departments of Computing and Mathematical Sciences and Economics. He holds a B.S. from MIT (2015) and a Ph.D. from UC Berkeley (2021), co-advised by Michael Jordan and Shankar Sastry. His research bridges machine learning and economics, focusing on deploying algorithms into societal systems through theoretical and practical lenses. Key areas include strategic classification, multi-agent reinforcement learning, and distributionally robust optimization, with applications in healthcare, online markets, and intelligent infrastructure. Education: B.S., Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2015 Ph.D., Electrical Engineering and Computer Science, University of California, Berkeley, 2021 Research Interests: Mazumdar’s work emphasizes understanding learning algorithms in strategic environments, including min-max optimization, game theory, and multi-agent systems. He explores how algorithms interact with human and algorithmic agents in dynamic systems, with practical applications in healthcare delivery, e-commerce, and autonomous systems testing. Awards: NSF CAREER Award (2023) Simons Institute Research Fellowship in Learning in Games Grants & Funding: Supported by NSF, DARPA, Amazon, and other organizations. His NSF CAREER grant focuses on strategic interactions in societal-scale systems. Teaching: Courses include Networks: Structure & Economics (CMS/CS/EE/IDS 144) and Topics in Learning and Games (CMS/Ec 248). At UC Berkeley, he contributed to courses like Data, Inference, and Decisions (DS 102). Students & Postdocs: Current students: Lauren Conger, Tinashe Handina, Yizhou Zhang Postdocs: Zaiwei Chen, Laixi Shi, Kishan Panaganti (co-advised with Adam Wierman)
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.
Yang Zhou is an Associate Professor in the Department of Computer Science and Software Engineering at Auburn University, part of the Samuel Ginn College of Engineering. His research focuses on big data algorithms, machine learning, data mining, and distributed computing. He has contributed to advancements in federated learning frameworks, graph mining tools, and spatial machine learning for environmental applications like flood mapping. Education includes a Ph.D. in Computer Science from Georgia Tech (2021), M.E. in Computer Application Technology from Chongqing University (2016), and B.E. in Engineering from Jiangnan University (2014). His work emphasizes scalable algorithms for large-scale systems, with tools like DirDense for dense subgraph mining and FedASMU for federated learning optimization. Recent publications explore adversarial robustness, blockchain strategies in IoT, and curriculum-based learning for large language models. He advises on interdisciplinary projects at the intersection of AI and environmental science.
Peter Selinger is a Professor in the Department of Mathematics and Statistics at Dalhousie University , with a cross-appointment in Computer Science. He specializes in mathematical methods in computer science, particularly quantum computing and combinatorial game theory . His work on quantum programming languages like Quipper and foundational research in category theory has garnered international recognition. Education : Ph.D. in Mathematics (University of Pennsylvania, 1997), undergraduate studies in Mathematics (Technische Universität Darmstadt). Research Interests span quantum computing, category theory, and combinatorial game theory. He has pioneered formalisms for quantum programming languages, developed categorical models for quantum mechanics, and analyzed game-theoretic structures in games like Hex. His recent work includes linear dependent type theory , quantum circuit synthesis , and combinatorial game classification . Publications demonstrate expertise in quantum programming languages, categorical semantics, and game theory. Key trends include Hamiltonian simulation , Clifford+T circuits , and monotone game realization . Scientific Honors include the Killam Professorship (2017–2022), Faculty of Science Award for Excellence in Teaching (2023), and fellowships from the Alfred P. Sloan Foundation and German National Scholarship Foundation . Students he has supervised include PhD graduates Xiaoning Bian , Francisco Rios , and Neil J. Ross , along with MSc students like Fahimeh Bayeh and Seth Greylyn . He has advised 16 postdoctoral researchers.
Sainyam Galhotra is an Assistant Professor in the Department of Computer Science at Cornell University. His research focuses on developing data science tools for trustworthy analytics, integrating causal inference, data management, and machine learning to enhance robustness, explainability, and fairness in algorithmic systems. PhD: University of Massachusetts Amherst (2020), advised by Barna Saha B.Tech: Indian Institute of Technology Delhi (2014), advised by Amitabha Bagchi Postdoctoral Research: University of Chicago (Computing Innovation Fellow) His work spans artificial intelligence, causal inference, and responsible data science, emphasizing ethical algorithm design and reliable data integration. Recent publications highlight advancements in fair clustering, causal feature selection, and entity resolution frameworks. His research trends from 2023–2024 include contributions to spatio-temporal data correlation, community detection in geometric graphs, and distribution-aware dataset search. Key themes are fairness in machine learning, causal modeling, and scalable data management solutions. Computing Innovation Fellowship (2021) DAAD AInet Fellow (2021) ACM SIGMOD Entity Resolution Programming Contest Finalist (2021) Krithi Ramamritham Computer Science Scholarship (2019) BEST Paper Award in SIGSOFT FSE 2017 He actively seeks PhD or Master’s students interested in data science and trustworthy AI. Contact via email: sg@cs.cornell.edu .
Marek Pycia serves as Professor of Organizational Economics at the University of Zurich and Co-Director of the Zurich Center for Market Design. His research has driven tangible policy impacts including the U.S. kidney-transplant voucher program and school system redesigns, with publications in premier journals like American Economic Review and Econometrica . His academic foundation includes a Ph.D. in Economics from the Massachusetts Institute of Technology (MIT), complemented by prior faculty roles at UCLA, Pennsylvania State University, and Leon Koźmiński Academy of Entrepreneurship and Management, plus a visiting fellowship at Princeton University. Professor Pycia specializes in Market Design and Mechanism Design , where he bridges theoretical microeconomics with real-world applications in healthcare allocation and educational systems. His work emphasizes strategyproofness , simplicity , and efficiency in matching markets, influencing both academic frameworks and practical policy implementations globally. Recent publications (2024-2025) reveal a concentrated focus on simplifying mechanism design for discrete environments, advancing double auction theory, and optimizing information structures in trade. These works consistently apply game-theoretic principles to solve complex allocation problems across healthcare, education, and financial markets. Key recognition includes: Research Fellow at the Centre for Economic Policy Research (CEPR) Editorial board membership at Theoretical Economics , Journal of Economic Theory , and Games and Economic Behavior While specific grant details remain unmentioned, his editorial leadership and center directorship indicate active research funding. He supervises graduate work through the University of Zurich’s economics programs, though no named students appear in the source text. The Zurich Center for Market Design, which he co-directs, functions as an interdisciplinary hub connecting theoretical research with practitioners in healthcare, education, and public policy to implement novel market mechanisms.
Ari Juels is the Weill Family Foundation and Joan and Sanford I. Weill Professor at Cornell Tech (Cornell University) and a faculty member in the Department of Computer Science. He co-founded and co-directs the Initiative for CryptoCurrencies and Contracts (IC³) and serves as Chief Scientist at Chainlink Labs. His research focuses on blockchain technology, cryptocurrency, smart contracts, applied cryptography, authentication, and privacy. Juels holds a Ph.D. in Computer Science from UC Berkeley and previously held roles as Chief Scientist and Director of the RSA Laboratories at EMC/Dell EMC until 2013. His work spans foundational contributions to decentralized systems, including Chainlink’s oracle networks and Ekiden’s privacy-preserving smart contracts. Juels has authored influential books like *The Oracle* (2024) and *Tetraktys* (2009), blending cryptography with thriller narratives. He advises numerous students and alumni, many of whom have joined prominent blockchain firms like Chainlink Labs, Mysten Labs, and Espresso Systems. Recent publications explore topics such as liquidity in blockchain assets, oracle network security, and economic analysis of smart contracts. His research emphasizes practical applications of cryptographic principles to real-world challenges in digital systems and decentralized finance. Juels’ lab collaborates on projects like HyDRA (automated bug bounty systems) and Lanturn (economic security metrics). He actively participates in academic and industry partnerships, bridging theoretical computer science with applied blockchain innovation.
Vassilis Zikas is an Associate Professor at the School of Cybersecurity and Privacy and holds a courtesy appointment in the School of Computer Science at Georgia Tech. He previously held positions at Purdue University, the University of Edinburgh, and Rensselaer Polytechnic Institute (RPI). His research focuses on cryptography, blockchain technologies, cryptocurrencies, game theory, and distributed computing. He leads the Blockchain Lab at Georgia Tech and serves as Chief Scientist at Sunday Group, where he contributes to the Mobby blockchain architecture. His work is supported by the NSF, DoD, Swiss NSF, and industry partners like Sunday Group and Algorand Foundation. He has organized major conferences including PKC 2020 and has served on program committees for EUROCRYPT, CRYPTO, and TCC. He advises PhD students in cryptography and related fields and has mentored postdocs and master’s students. Zikas’ publications span topics like secure multi-party computation (MPC), blockchain security, and cryptographic protocol design. His recent work includes advancements in privacy-preserving protocols, adaptive security frameworks, and composability in blockchain systems. Notable awards include the 2023 Leadership Award from Purdue College of Science and an AnlytiXIN Fellowship. He actively contributes to both theoretical and applied aspects of cybersecurity and privacy through academic and industrial collaborations.
Jun-Kun Wang is an Assistant Professor at the University of California, San Diego (UCSD), with a joint appointment in the Department of Electrical and Computer Engineering and the Halicioğlu Data Science Institute. He joined UCSD in July 2023, previously serving as a postdoc at Yale University. His research focuses on optimization, sampling, and machine learning, emphasizing acceleration techniques and theoretical guarantees. He explores connections between optimization and areas like no-regret learning, sampling, and hypothesis testing. Education: PhD in Computer Science from Georgia Tech (advised by Jacob Abernethy), M.S. in Communication Engineering and B.S. in Electrical Engineering from National Taiwan University. Research Interests: Acceleration in optimization and sampling, trustworthy machine learning, momentum methods, and algorithmic convex optimization. His work bridges theoretical foundations and practical applications, with publications in top-tier venues like COLT, ICML, ICLR, and NeurIPS. Teaching: Courses include ECE 174 (Linear/Nonlinear Optimization), ECE 273 (Convex Optimization), and DSC 211 (Optimization). His lectures cover topics such as gradient descent, duality theory, mirror descent, and non-convex optimization. Lab/Team: Leads the Optimization and Machine Learning Group, advising PhD students Can Chen and Maria-Eleni Sfyraki, and MS student Yi Liu. His group focuses on theoretical and applied aspects of optimization algorithms.
Suguman Bansal is an Assistant Professor in the School of Computer Science at Georgia Institute of Technology. Her research focuses on formal methods and their applications to artificial intelligence, programming languages, and machine learning. Previously, she held an NSF/CRA Computing Innovation Postdoctoral Fellowship at the University of Pennsylvania (2020-2022) and completed her PhD at Rice University (2016-2020). Education: PhD in Computer Science, Rice University (2016-2020) MS in Computer Science, Rice University (2014-2016) BSc (Honors) in Mathematics and Computer Science, Chennai Mathematical Institute (2011-2014) Research Interests: Formal methods, reinforcement learning, reactive synthesis, quantitative verification, and trustworthy AI systems. Her work bridges logic-based formal methods with modern AI challenges, emphasizing safety, reliability, and generalization in AI systems. Key Contributions: Pioneering work on specification-guided reinforcement learning, compositional synthesis algorithms, and formal verification of AI systems. Notable tools include Lisa (LTLf synthesis tool) and DiRL (compositional reinforcement learning framework). Awards: 2020 NSF CI Fellowship, 2021 MIT EECS Rising Star, 2023 ATVA Best Paper Award, and Keynote Speaker at SAS 2022. Advising & Grants: Advises PhD and Master’s students in reinforcement learning and formal methods. Lead PI on a collaboration grant with IIT Bombay (2024) and recipient of a ~$250K NSF/CRA postdoctoral grant. Labs/Teams: Leads the BansalLab at Georgia Tech, focusing on trustworthy AI through formal methods and algorithmic innovation.
Na Du is an Assistant Professor in the Department of Informatics and Networked Systems at the University of Pittsburgh's School of Computing and Information. She holds a PhD in Industrial & Operations Engineering from the University of Michigan (2021) and a Graduate Certificate in Data Science. Her research focuses on human factors in smart cities, human-centered computing, and user experience design. She is affiliated with the Intelligent Systems Program, Pitt Cyber, and the Center for Governance and Markets. Education: PhD in Industrial & Operations Engineering (University of Michigan, 2021); Undergraduate in Psychology (Zhejiang University). Research emphasizes explainable AI, human-AI teaming, and smart technologies. Recent grants include funding from Honda Research Institute and Pitt Cyber Accelerator for projects on emotions in Human-AI interaction and Metaverse privacy awareness. Her work has been recognized with awards like the HFES Best Paper Award and the IOE Outstanding Student Award. Advising includes PhD students and researchers in human factors and UX design. The HAT Lab under her leadership explores interdisciplinary challenges in human-computer interaction and smart systems.
Dr. Angela Siegel is an Assistant Professor and Assistant Dean, Academic Outreach in the Faculty of Computer Science at Dalhousie University, Halifax, Canada. She is actively involved in both academic leadership and research. Education: Ph.D. in Mathematics (Combinatorial Game Theory), Dalhousie University, 2011 M.Sc. in Mathematics, Dalhousie University, 2005 B.Sc. in Mathematics & Marine Geophysics, 1997 Her research focuses on combinatorial game theory, graph theory, discrete mathematics, and number theory, with a strong emphasis on computer science education and inclusive teaching . She investigates the challenges students face when transitioning into computer science programs, aiming to improve pedagogical approaches and support systems. Her work bridges theoretical mathematics and practical educational innovation. The recent publications highlight a dual focus: theoretical contributions to combinatorial games (e.g., partizan games, placement games, geography variants) and applied research in computing education, particularly student transition and inclusive practices. Her interdisciplinary work spans mathematics, computer science, and educational theory. Scientific Awards: Dr. Siegel has supervised and collaborated with students and researchers on topics including student transition into higher education computing, LEGO-based pedagogy, and workplace readiness. While no specific grants are listed, her repeated presentations and publications suggest active research funding and scholarly engagement. She has contributed to major conference proceedings and book volumes such as Games of No Chance . She is associated with research teams focused on combinatorial games and computer science education innovation, often collaborating with scholars like Richard Nowakowski, Neil McKay, and Mark Zarb. Her work in inclusive teaching and student support reflects a commitment to building accessible and equitable learning environments in computing.
Ali Vakilian is a Research Assistant Professor at the Toyota Technological Institute at Chicago (TTIC), with a strong academic background in theoretical computer science and algorithms. He will join the Department of Computer Science at Virginia Tech as an Assistant Professor in Fall 2025. His research bridges algorithmic theory and machine learning, focusing on scalable, fair, and efficient algorithms for massive data. Education: Ph.D. in EECS, Massachusetts Institute of Technology (MIT), advisors: Erik Demaine and Piotr Indyk M.S. in Computer Science, University of Illinois at Urbana-Champaign (UIUC), advisor: Chandra Chekuri B.S. in Computer Engineering, Sharif University of Technology Research Interests: Ali Vakilian's work centers on the algorithmic foundations of machine learning and data science. He develops streaming, sketching, and sublinear-time algorithms for massive datasets, and pioneers learning-augmented algorithms that use machine learning predictions to improve performance while maintaining worst-case guarantees. His research in trustworthy ML includes algorithmic fairness, fair clustering, and learning with strategic agents. He also contributes to combinatorial optimization and approximation algorithms for network design, set cover, and low-rank approximation. His recent publications (2023–2025) show a consistent focus on fair clustering (individual and group fairness), streaming graph algorithms , learning-augmented methods , and frequency estimation . These works appear in top venues such as NeurIPS, ICML, SODA, and ICALP, often with recognitions like oral or spotlight presentations. Scientific Awards: Outstanding Student Paper Highlight Award, AISTATS 2024 Notable-top-25% paper, ICLR 2023 Oral presentation, AISTATS 2024 Spotlight presentation, NeurIPS 2023 Advising and Grants: Ali Vakilian mentors several students and interns, including summer interns at TTIC and Fatima Fellows. His research is supported by the National Science Foundation (TRIPODS program), as noted in the press coverage of his work on LearnedSketch. He actively contributes to the academic community through advising, organizing workshops (e.g., Algorithms with Predictions, Learning-Augmented Algorithms), and serving on program committees (e.g., NeurIPS, ICML, AISTATS). Labs and Teams: He is affiliated with the theory and algorithms group at TTIC and collaborates with researchers at MIT, UIUC, and other institutions. His work on learning-augmented algorithms has led to influential workshops and collaborations with leading figures such as Piotr Indyk and Erik Demaine.
