Marta Kwiatkowska is a Professor of Computing Systems at the University of Oxford and a Fellow of Trinity College. Her research focuses on probabilistic verification , quantitative model checking , and formal methods for complex systems including autonomous robots, medical devices, and biological systems. She leads the development of the PRISM and PRISM-games probabilistic model checkers. Key research areas: Probabilistic systems, formal verification, autonomous robotics, medical device analysis, systems biology Grants: ERC Advanced Grant VERIWARE, EPSRC Programme Grant Mobile Autonomy Awards: 2024 ETAPS Test-of-Time Tool Award for PRISM Students: Current and former advisees in topics spanning formal methods, robotics, and quantitative verification The PRISM-games extension enables verification of stochastic multi-player games with applications in network protocols, autonomous systems, and game theory. Her work bridges theory, algorithms, and practical implementation, with real-world applications in ubiquitous computing and nanotechnology.
Ronald Parr is a Professor of Computer Science in the Department of Computer Science at Duke University's Pratt School of Engineering. He has been at Duke since 2000, progressing from Assistant Professor to Associate Professor with tenure, and ultimately to Full Professor. From 2014 to 2017, he served as Department Chair and delivered graduation speeches in 2015, 2016, and 2017. Dr. Parr received his Ph.D. in Computer Science from the University of California, Berkeley in 1998, with a dissertation titled "Hierarchical Control and Learning in Markov Decision Processes" under advisor Stuart Russell. He earned his A.B. in Philosophy, cum laude, from Princeton University in 1990. His primary research focuses on methods for solving large stochastic planning problems using Markov Decision Processes and approximate dynamic programming techniques. His work spans reinforcement learning, value function approximation, game theory, sensing, and robotics. Dr. Parr's research has been consistently funded by major agencies including NSF, DARPA, and ARO, with recent projects focusing on feature encoding for reinforcement learning, neurosymbolic hierarchical reinforcement learning, and reasoning in large, structured, uncertain domains. His publication record demonstrates consistent contributions to top venues including NeurIPS, ICML, and AAAI, with work that bridges theoretical foundations and practical applications. Dr. Parr has received numerous honors including being elected as an AAAI Fellow in 2023, receiving an AAAI Outstanding Paper Honorable Mention in 2013, winning the IJCAI-JAIR Best Paper Award in 2007, receiving an NSF CAREER award in 2006, and being named an Alfred P. Sloan Fellow in 2003. He has advised ten graduate students to completion across various research areas within AI and robotics. His research has been supported by over $1.5 million in direct funding to his lab, with additional collaborative funding from multiple NSF, DARPA, and ARO grants. Dr. Parr has served extensively on program committees for major AI conferences including ICML, NeurIPS, AAAI, and UAI, and has held leadership roles such as Program Co-Chair and General Chair for UAI. Dr. Parr maintains an active research group focused on reinforcement learning and sequential decision making, with ongoing projects in neurosymbolic AI, hierarchical reinforcement learning, and interpretable machine learning models, continuing to bridge theoretical foundations with practical applications in robotics and AI systems.
Baris Fidan is a Professor in Mechanical & Mechatronics Engineering at the University of Waterloo, with cross appointments in System Design Engineering and Electrical & Computer Engineering. He is a senior member of IEEE and AIAA. His research focuses on cooperative/adaptive control, autonomous systems, multi-agent networks, and vehicular control applications. He leads the Cooperative & Adaptive Mechatronic Systems (CAMS) Lab, which develops control strategies for autonomous vehicles, robotic systems, and intelligent transportation. Education: PhD in Electrical Engineering, University of Southern California (2003) Masters in Electrical & Electronic Engineering, Bilkent University (1998) Bachelor's in Electrical & Electronic Engineering & Mathematics, Middle East Technical University (1996) Research Interests: His work spans adaptive control theory, sensor networks, multi-agent coordination, autonomous vehicle networks, and biomedical systems control. He emphasizes practical applications in intelligent transportation, robotic navigation, and distributed system optimization. Grants & Projects: He has led major grants including NSERC Discovery Programs on cooperative mechatronic systems and 3D autonomous vehicle coordination. Industrial projects include autonomous driving strategies, vehicle control optimization, and high-precision gear manufacturing technologies. Labs/Teams: Directs the CAMS Lab, which collaborates on projects involving distributed motion planning, sensor localization, and autonomous vehicle networks. Current projects address challenges in urban autonomous driving, cooperative robotic systems, and resilient sensor networks.
Daniel M. Kane is a Professor at the University of California, San Diego (UCSD), holding a joint appointment in the Department of Mathematics and the Department of Computer Science and Engineering (CSE). His research spans mathematics and theoretical computer science, with a focus on number theory, combinatorics, complexity theory, and computational statistics. He earned a Ph.D. in Mathematics from Harvard University (2011) and dual BS degrees in Mathematics with Computer Science and Physics from MIT (2007). Prior to UCSD, he was a postdoctoral researcher at Stanford University (2011–2014) on an NSF fellowship. His research interests include robust statistics, machine learning, polynomial threshold functions, and algorithmic methods for high-dimensional data. Notable achievements include co-authoring the book Algorithmic High-Dimensional Robust Statistics (Cambridge University Press, 2023) and receiving the Best Paper Award at the Conference on Computational Complexity (2013), as well as gold medals at the International Mathematical Olympiad (2002 and 2003). Current teaching includes courses such as Math 96 (Putnam Seminar), Math 154 (Graph Theory), CSE 101 (Algorithms), and CSE 203A (Randomized Algorithms). He has consulted for companies like CASPER Labs and AIble, and his work extends to cryptographic protocols, including quantum money schemes based on quaternion algebras. Key contributions include breakthroughs in robust mean estimation, list-decodable learning, and the development of efficient algorithms for statistical problems. His research often bridges foundational theory with practical applications in machine learning and data analysis.
Ben Fisch is an Assistant Professor of Computer Science at Yale University's School of Engineering & Applied Science. He is also the co-founder of Espresso Systems, a company focused on blockchain infrastructure. His research focuses on privacy and verifiability in decentralized systems like Bitcoin and Ethereum, with applications in digital finance and healthcare. Dr. Fisch received his B.A. from the University of Pennsylvania and completed his Ph.D. at Stanford University, where he worked with Dan Boneh in the applied cryptography research group. His educational background provided the foundation for his work at the intersection of cryptography, distributed systems, and economics. His research centers on leveraging cryptographic tools such as succinct non-interactive zero-knowledge proofs (zk-SNARKs), private information retrieval, and homomorphic encryption to address challenges in verifiable computation, verifiable storage, and verifiable fairness. He has made significant contributions to verifiable delay functions (VDFs) and proofs of replication, which have been adopted by major blockchain projects including Ethereum 2.0, Chia, and Filecoin. His work on Filecoin's Proofs of Replication has helped the network reach over 1.5 exabytes of storage capacity. His publication record shows a clear trend toward increasingly sophisticated cryptographic protocols for blockchain applications, with recent work focusing on data availability for Bitcoin rollups, efficient folding schemes for pairing-based arguments, and privacy pools with proof-carrying disclosures. His research bridges theoretical cryptography with practical implementations that have real-world impact in decentralized systems. His notable recognition includes: Best Paper Finalist at ACM CCS 2017 for 'Iron: Functional Encryption using Intel SGX' Dr. Fisch's research has led to significant technology transfer, most notably with his work on Verifiable Delay Functions (VDFs) sparking a multimillion dollar industry initiative through the VDF Alliance. His research on Proofs of Replication forms the basis of Filecoin's incentive layer and consensus protocol. His newer SNARK system Basefold is being used by several commercial products. He maintains active collaborations across academia and industry, with publications spanning top conferences in cryptography and security. As co-founder of Espresso Systems, Dr. Fisch leads a team developing next-generation blockchain infrastructure, particularly focusing on sequencing layers for rollups. His work bridges academic research with practical implementation, ensuring that theoretical advances in cryptography find real-world applications in decentralized systems.
William Yang Wang serves as the Mellichamp Professor of Artificial Intelligence at the University of California, Santa Barbara (2019-present). He directs the UCSB Center for Responsible Machine Learning, the Mind and Machine Intelligence Initiative, and the UCSB NLP Group. His research focuses on theoretical foundations and practical algorithms for AI, particularly in NLP, LLMs, and neuro-symbolic reasoning. PhD in Computer Science from Carnegie Mellon University Active in AI theory and applications (2016-present) Research interests span multiple AI domains, with special emphasis on NLP and responsible machine learning. He has pioneered datasets like HybridQA, TabFact, and VaTeX, enabling advancements in multi-hop QA, fact verification, and video-language tasks. His work combines statistical relational learning with modern deep learning paradigms. Recent publications center around multimodal reasoning, knowledge graph integration, and responsible AI development. He has received numerous accolades including the IEEE SPS Pierre-Simon Laplace Award (2024) and NSF CAREER Award (2021). Karen Sparck Jones Award (2022) DARPA Young Faculty Award (2018) IBM Faculty Award Mentoring 15+ PhD and postdoc researchers who now hold positions at Microsoft Research, Amazon, Meta GenAI, and academic institutions like Arizona and Rutgers. His lab maintains active collaborations with industry partners through initiatives like ChipAgents.ai, which he founded as CEO.
Shai Ben-David is a Professor and University Research Chair at the Department of Computer Science, University of Waterloo. He is affiliated with the Cheriton School of Computer Science and can be reached at shai@uwaterloo.ca . His office is located in DC 2643. Education: Ph.D., Hebrew University, Jerusalem, Israel (1987) M.Sc., Hebrew University Jerusalem, Israel (1979) B.Sc., Hebrew University Jerusalem, Israel (1978) Research interests focus on foundational aspects of machine learning theory, including unsupervised learning (clustering), domain adaptation, fairness, interpretability, and alternative approaches to worst-case computational complexity. He also explores logic applications in computer science theory. His research trends emphasize theoretical challenges in machine learning, particularly clustering, fairness in representations, and the interplay between computational feasibility and learnability. He investigates how unlabeled data and sample compression techniques impact learning robustness and efficiency. No scientific awards are listed. His advising record shows no formal advisees listed here. Grants and funding details are not provided in the text. He has contributed to organizing events like the Dagstuhl Seminar on Foundations of Unsupervised Learning (2017) and co-edited MFCS 2016 proceedings. His work addresses both theoretical questions and practical gaps in ML implementation.
Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).
Raquel Fernández is Full Professor of Computational Linguistics and Dialogue Systems at the University of Amsterdam, where she leads the Dialogue Modelling Group at the Institute for Logic, Language & Computation (ILLC). As Vice-Director for Research at ILLC and a Fellow of the ELLIS Society, she bridges computational linguistics, cognitive science, and artificial intelligence through her research on language use in multimodal and conversational contexts. PhD in Computational Linguistics from King's College London Prior research positions at University of Potsdam and Stanford University's CSLI Her work explores how cognitive constraints, social interaction, and perception shape language use, with a focus on: Visually-grounded language processing Multimodal dialogue modeling Model uncertainty and calibration Language grounding in multimodal data Language learning and semantic change Dialogue reference resolution Recent publications analyze multimodal reasoning limitations, cross-lingual knowledge consistency, and uncertainty modeling in dialogue systems. She has received multiple accolades including an ERC Consolidator Grant , NWO VENI/VIDI/Aspasia fellowships , and EMNLP/GenBench awards . Outstanding Paper Award (EMNLP 2023) Best Data Award (GenBench Workshop 2023) ELLIS Society Fellow ERC Consolidator Grant #819455 recipient NWO VENI/VIDI/Aspasia awardee As a leader in academic service, she serves on the SIGDAT Executive Committee and chairs multiple conference committees. Her lab develops models for multimodal dialogue, visual storytelling, and grounded language understanding.
Jianghai Hu is a Professor of Electrical and Computer Engineering at Purdue University, affiliated with the Elmore Family School of Electrical and Computer Engineering within the College of Engineering. He holds a BE from Xi'an Jiaotong University (1994), MS and MA from the University of California, Berkeley (1999-2000), and a PhD in Electrical Engineering from UC Berkeley (2003). His research focuses on control systems, optimization theory, multi-agent systems, hybrid systems, and energy-efficient building management. Key areas include automatic controls, sensor networks, and signal processing. Research Interests: Hybrid systems and multi-agent coordination Optimal control and optimization Applications in energy-efficient buildings and autonomous systems Stochastic control and game theory Recent publications highlight contributions to zeroth-order learning in games, robust control for autonomous vehicles, and distributed optimization algorithms. His work bridges theoretical foundations with practical applications in robotics, energy systems, and networked control. Jianghai Hu advises numerous graduate students and collaborates on projects involving building control systems and distributed algorithms. His research has been supported through interdisciplinary initiatives at Purdue and industry partnerships.
Chandra Chekuri is the Paul and Cynthia Saylor Professor in the Department of Computer Science at the University of Illinois Urbana-Champaign, situated within the Grainger College of Engineering. He has been actively contributing to theoretical computer science for over two decades, with significant leadership roles including serving as Editor-in-Chief of the prestigious SIAM Journal on Computing since May 2025. His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras in 1993, followed by a Ph.D. in Computer Science from Stanford University in 1998. Prior to joining UIUC, he spent eight years as a Member of Technical Staff at Bell Labs, Lucent Technologies. Chekuri's research focuses on theoretical computer science with particular emphasis on the design and analysis of algorithms, discrete and combinatorial optimization, approximation algorithms, mathematical programming, and graph theory. His work explores fundamental connections between discrete structures and optimization problems, with applications spanning network design, data analysis, and computational complexity. His recent publications demonstrate a continued focus on hypergraph algorithms, submodular function optimization, and graph partitioning problems, showing how theoretical insights can yield practical algorithmic improvements. His approach often combines continuous relaxations with discrete rounding techniques to develop approximation algorithms for NP-hard problems. As Editor-in-Chief of SIAM Journal on Computing, Chekuri leads one of theoretical computer science's most respected publications, which covers analysis and design of algorithms, algorithmic game theory, computational complexity, and other mathematical aspects of computer science. His editorial leadership follows previous service as Associate Editor for several major journals including SIAM Journal on Computing, Mathematics of Operations Research, and Mathematical Programming. ACM Fellow (January 2024) Scott Fisher Teaching Award (for year 2022-23) from CS Department Chekuri has advised numerous PhD students to completion, including Kent Quanrud, Vivek Madan, Shalmoli Gupta, and Chao Xu, with several currently in progress such as Tanvi Bajpai, ElFarouk Harb, Rhea Jain, and Weihao Zhu. His teaching portfolio includes graduate courses on Randomized Algorithms, Approximation Algorithms, Algorithms for Big Data, and Combinatorial Optimization. He has served as Director of the Graduate Program in the Department of Computer Science from May 2014 to August 2017, demonstrating significant administrative leadership within the department.
Chaitanya Swamy is a Professor and University Research Chair in the Department of Combinatorics & Optimization at the University of Waterloo, Canada. His primary affiliation is within the Faculty of Mathematics, and he holds positions in both the Department of Combinatorics & Optimization and the School of Computer Science. He obtained his Ph.D. in Computer Science from Cornell University under the supervision of David Shmoys, followed by postdoctoral research at Caltech's Center for the Mathematics of Information. Swamy’s research focuses on algorithms, particularly in combinatorial optimization, approximation algorithms, algorithmic game theory, stochastic optimization, network design, scheduling, and online algorithms. His work spans theoretical contributions and practical applications, including algorithm design for facility location, network routing, and mechanism design. He has contributed to foundational results in approximation algorithms, such as the development of primal-dual methods and LP-rounding techniques. Swamy has held significant editorial roles, including as an associate editor for Discrete Optimization and SIAM Journal on Computing . He has organized major conferences like CanaDAM 2021 and sessions at ISMP 2018. His teaching record includes courses on combinatorial optimization, scheduling, and algorithmic game theory. He has advised numerous Ph.D. and Master’s students, many of whom have gone on to prestigious academic and industry positions. Swamy’s research has been recognized through awards for his students, including the University of Waterloo Alumni Gold Medal. He actively contributes to the academic community through committee work for conferences like STOC, APPROX, and SODA, and his publications reflect a deep engagement with both theoretical and applied aspects of algorithms and optimization.
Benedikt Bünz is an Assistant Professor of Computer Science at New York University's Courant Institute of Mathematical Sciences. He is also a co-founder and chief scientist of Espresso Systems, where he applies his research expertise to real-world blockchain solutions. His academic work bridges theoretical cryptography with practical blockchain implementations, focusing on enhancing privacy, security, and usability of decentralized systems. Dr. Bünz's research centers around applied cryptography, consensus mechanisms, and game theory as they relate to cryptocurrencies. His work spans zero-knowledge proofs, verifiable delay functions, secure multi-party computation, and privacy-preserving protocols. He has made significant contributions to Bulletproofs, a zero-knowledge proof system deployed on blockchains like Monero, and pioneered research in verifiable delay functions which are now part of Ethereum 2.0's design. His recent work focuses on recursive proof systems, accumulation schemes, and efficient verification techniques for blockchain scalability. His publication record shows a consistent progression from foundational cryptographic primitives to practical blockchain implementations. Recent work demonstrates increasing sophistication in recursive proof systems (ProtoStar, HyperPlonk), novel accumulation techniques (ARC, DewTwo), and foundational work on randomness generation (VDFs). His research consistently bridges theoretical cryptography with real-world blockchain applications, resulting in protocols that are both theoretically sound and practically implementable across multiple blockchain platforms. Dr. Bünz actively contributes to the academic community through teaching and mentorship. He teaches courses on cryptography of blockchains and computer security at NYU, providing students with hands-on experience in blockchain security and cryptographic protocols. His industry engagement through Espresso Systems demonstrates his commitment to translating academic research into practical solutions for the blockchain ecosystem.
Cong Shi, also known as Alex Shi, is a Professor of Management at the Miami Herbert Business School, University of Miami, since 2025. Previously, he served as Associate Professor at the University of Michigan (2019-2023) and Assistant Professor there (2012-2019). His academic journey began with a B.Sc. in Mathematics (First Class Honors) from the National University of Singapore (2007) and a Ph.D. in Operations Research from MIT (2012) under Professor Retsef Levi. Education : MIT (Ph.D.), NUS (B.Sc.) Current Role : Professor, Management, Miami Herbert Business School Prior Roles : Associate Professor (Tenured), University of Michigan; Assistant Professor, University of Michigan His research spans Revenue Management, Supply Chain Management, Healthcare Operations, Human-Robot Interaction, and Data-Driven Optimization. Recent publications focus on fairness-constrained inventory, sequential pricing, and trust-aware robotics. He has received prestigious awards including the Senior Research Award (2025) and Amazon Research Award (2021), alongside multiple INFORMS recognitions. The 15 most recent articles highlight advancements in inventory control with fairness constraints, sequential pricing algorithms, and trust propagation models in robotics. His work bridges theoretical rigor with practical applications in supply chains and human-robot collaboration. Scientific Awards : Senior Research Award, Miami Herbert Business School, 2025 Amazon Research Award, 2021 INFORMS Meritorious Service Awards (2018, 2019, 2021, 2023) IOE Graduate Course Professor of the Year, University of Michigan, 2019 He has advised 10 PhD students, many now in academia (e.g., UC Berkeley, Penn State) or tech roles (Meta, Amazon). Grants include NSF funding as PI and Co-PI.
Asaf Ferber is Associate Professor in Mathematics at University of California, Irvine, School of Physical Sciences. His research spans discrete mathematics including combinatorial games, random graphs, extremal hypergraph theory, and quantum computation. Research explores Hamiltonian cycles in random graphs, structural properties of pseudorandom graphs, and quantum algorithms for combinatorial problems. Recent work develops quantum approaches to graph learning and sparse recovery in random matrices. Awards: NSF CAREER Award Sloan Fellowship Distinguished Early Career Faculty Award for Research Air Force Research Grant NSF-BSF Grant Organizes conferences including SoCalDM Symposium and Desert Discrete Math Workshop, mentoring graduate students through UCI's Probability and Combinatorics Seminar.
