Prof. Dr. Thomas Hofmann is a Full Professor and Head of the Department of Computer Science at ETH Zurich since 2014. He also leads the Institute for Machine Learning. His research focuses on machine learning, deep learning, natural language understanding, and text understanding. Hofmann holds a Ph.D. from the University of Bonn (1997) and has held academic positions at Brown University (1999–2004) and TU Darmstadt. He transitioned to industry as Director of Engineering at Google (2006–2014), leading the Zurich R&D center, before returning to academia. He co-founded Recommind (2000) and 1plusX (Swiss marketing tech company), currently serving as Chief Scientist and board member at 1plusX. Education: Ph.D. in Computer Science, University of Bonn (1997) Postdoctoral Work: MIT (CBCL/AI Lab), UC Berkeley (EECS/ICSI) His research explores advanced machine learning techniques, including diffusion models, generative adversarial networks, and optimization dynamics. Hofmann’s entrepreneurial ventures reflect his focus on applying AI to real-world challenges, such as e-discovery and marketing technology. His work spans theoretical contributions (e.g., neural network training dynamics, continual learning) and applied innovations (e.g., image editing, portrait generation). Hofmann actively bridges academia and industry, influencing both research and commercial AI applications.
Kaiyuan Yang is an Associate Professor in the Department of Electrical and Computer Engineering at Rice University, leading the Secure and Intelligent Micro-Systems (SIMS) Lab. His research focuses on low-power integrated circuits and bioelectronic implants for applications like the Internet of Everything and medical devices. He holds a B.S. from Tsinghua University (2012) and M.S./Ph.D. degrees from the University of Michigan (2017). Research Interests: Low-power digital/analog/mixed-signal systems Bioelectronics and implantable devices Hardware security and PUF design Mixed-signal computing and emerging materials Recent work emphasizes magnetoelectric-powered implants, secure backscatter communication, and in-memory computing architectures. His publications span top venues like IEEE ISSCC, IEDM, and ACM MobiCom. Awards: 2022 NSF CAREER Award 2022 IEEE Top Picks in Hardware Security 2016 IEEE SSCS Predoctoral Achievement Award Dr. Yang serves on editorial boards for IEEE TVLSI and program committees for ISSCC/CICC. His lab develops miniature, secure, and energy-efficient systems for healthcare and IoT applications.
Nate Foster is a Professor of Computer Science at Cornell University and currently serves as the Associate Dean for Research in the Ann S. Bowers College of Computing and Information Science. He is also a Visiting Researcher at Jane Street and served as a Visiting Professor at École Polytechnique Fédérale de Lausanne during the 2023-24 academic year. His research uses ideas from programming languages to solve problems in networking, databases, and security. BA in Computer Science, Williams College (2001) MPhil in History and Philosophy of Science, University of Cambridge (2008, all work completed in 2003) PhD in Computer and Information Science, University of Pennsylvania (2009) Foster's research focuses on developing languages and tools that make it easy for programmers to build secure and reliable systems. His current work centers on the design and implementation of languages and tools for programmable networks, particularly using the P4 language. His past work includes bidirectional languages (also known as 'lenses'), database query languages, data provenance, type systems, mechanized proof, and formal semantics. His research group at Cornell has made significant contributions to network verification, software-defined networking, and formal foundations for programmable data planes. Analysis of Foster's recent publications reveals a strong focus on network verification and programming language foundations for networking. His work consistently applies formal methods to practical networking problems, with a particular emphasis on the NetKAT and P4 languages. Over the past five years, his research has evolved toward more complex network verification techniques, including infinite state verification, active learning of network models, and dependently-typed approaches to network programming. His work bridges theoretical computer science with practical networking systems, making formal methods accessible to network engineers. ACM Fellow (2025) ACM SIGPLAN Robin Milner Award (2023) ACM SIGCOMM Rising Star Award (2018) NSF CAREER Award (2013) Alfred P. Sloan Fellowship (2012) Multiple distinguished paper awards across top conferences including POPL, PLDI, and SIGCOMM Foster has advised numerous PhD and Master's students who have gone on to prominent positions in both industry and academia, with many continuing work in programming languages and networking. He has led multiple significant research grants including an NSF CAREER Award and has been involved in the P4 Language Consortium, serving as Chair of the P4 Language Governing Board. His work has been supported by various organizations including NSF, DARPA, and industry partners like Intel and Jane Street. Foster is also active in the programming languages research community, serving on numerous program committees and as Vice Chair of DARPA's Information Science and Technology (ISAT) study group. Foster leads a vibrant research group at Cornell focused on programming languages for networks, with collaborators from academia and industry. His group has developed several influential tools and frameworks including NetKAT, Petr4, and KATch. They maintain strong connections with the P4 community and work closely with industry partners to ensure their research has practical impact on real-world networking systems.
Yao Qin is an Assistant Professor in the Department of Electrical and Computer Engineering at the University of California, Santa Barbara (UCSB), with dual affiliation in the Department of Computer Science. She concurrently serves as Co-Director of the REAL AI Initiative at UCSB and holds a Senior Research Scientist position at Google DeepMind, where she contributes to the Gemini Multimodal project. Her academic credentials include a PhD in Computer Science and Engineering from the University of California, San Diego (advised by Prof. Garrison W. Cottrell) and a BS in Electrical Engineering from Dalian University of Technology. During her doctoral studies, she completed internships with pioneering researchers Geoffrey Hinton and Ian Goodfellow. Dr. Qin's research program centers on machine learning robustness, with emphasis on adversarial robustness, out-of-distribution generalization, and fairness. She develops reliable AI systems specifically for healthcare applications, with diabetes management as a primary focus. Her lab explores critical themes including AI safety in multimodal models and diabetes-specific AI solutions, particularly exercise metabolism modeling and glycemic effect prediction. Recent publications reveal a strong trajectory in robust machine learning with cross-domain applications. Her work consistently bridges theoretical robustness concepts with practical healthcare implementations, particularly in diabetes care. Key publication venues include CVPR, ICML, NeurIPS, and ICLR, with notable contributions to out-of-distribution detection, adversarial transfer learning, and multimodal AI safety. Her distinguished recognition includes: EECS Rising Star at MIT (2021) UCSB Regents' Junior Faculty Fellowship Award Helmsley Charitable Trust award for Type 1 diabetes research UCSB Faculty Research Grant American Diabetes Association Abstract Award (ADA-2025) Dr. Qin actively mentors four PhD students—Mehak Dhaliwal, Andong Hua, Kenan Tang, and Youngseok Yoon—on projects spanning LLMs for diabetes, multimodal robustness, and generative time-series modeling. Her research is funded by the Helmsley Charitable Trust and UCSB, with recent grants supporting exercise-specific AID algorithms for diabetes management. As Co-Director of the REAL AI Initiative, she leads a research ecosystem focused on developing reliable artificial intelligence. Current lab activities include organizing workshops at NeurIPS-2024 (AdvML-Frontiers and AIM-FM) and developing next-generation diabetes management tools through collaborations with medical institutions.
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.
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.
Sanjit A. Seshia is the Cadence Founders Chair Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley . He is affiliated with the Group in Logic and the Methodology of Science and participates in centers like the Industrial Cyber-Physical Systems Center , Berkeley AI Research , and the Simons Institute for the Theory of Computing . Research interests include formal methods for automated verification and synthesis of dependable systems, with applications to cyber-physical systems , AI-based autonomy , and computer security . His work spans SMT solving, model counting, syntax-guided synthesis, and algorithmic improvisation, with tools like UCLID5 , VerifAI , and Scenic for verifying autonomous systems and educational platforms like CPSGrader . Students and collaborators include notable researchers such as Dorsa Sadigh (Stanford), Daniel Fremont (UC Santa Cruz), and Hazem Torfah (Chalmers). He has co-founded startups like Decyphir and 20ⁿ Labs based on his research.
Supratik Chakraborty serves as the Bajaj Group Chair Professor in the Department of Computer Science and Engineering at Indian Institute of Technology Bombay. He maintains dual affiliations with the Centre for Formal Design and Verification of Software and the Centre for Liberal Education at IIT Bombay, demonstrating his cross-disciplinary engagement. Professor Chakraborty's research spans formal methods with focus on formal verification, rigorous analysis of system models, and automated synthesis of systems from specifications. His work bridges theoretical foundations with practical applications, particularly in developing mathematically provable guarantees for increasingly complex hardware, software, and intelligent systems. Current research interests include constrained counting and sampling, scalable formal verification of software and hardware systems, automated synthesis of programs and circuits, and applications of automata, logic and finite model theory to practical verification challenges. His publication trajectory shows a significant evolution from traditional hardware and software verification toward addressing verification challenges in machine learning and AI systems. Recent work increasingly focuses on interpretability of black-box models, verification of neural networks, and synthesis techniques applicable to intelligent systems. The research demonstrates strong interdisciplinary connections between formal methods, programming languages, and artificial intelligence. IIT Bombay Excellence in Thesis (CSE) Award 2011 (for Bhargav Gulavani's thesis) IIT Bombay Excellence in Thesis (CSE) Award 2017 (for Abhisekh Sankaran's thesis) Best Paper in Algorithms and Architecture track at IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1998 Professor Chakraborty has successfully supervised 11 doctoral students, with research spanning formal verification techniques, Boolean functional synthesis, constrained counting, and applications to hardware and software systems. His students have gone on to positions at major institutions including Microsoft Research, TCS Research, Georgia Tech, and BARC, reflecting the strong industry and academic impact of his mentorship. Current research directions show increasing emphasis on verification challenges posed by machine learning systems and AI. His research group at IIT Bombay, while not explicitly named in the materials, appears to focus on formal methods with strong connections to the Centre for Formal Design and Verification of Software. The group maintains active collaborations with international researchers including Moshe Y. Vardi at Rice University, and has made significant contributions to verification tools like VeriAbs that bridge theoretical advances with practical applications.
Daniel Grier is an Assistant Professor jointly appointed in the Computer Science and Engineering and Mathematics departments at the University of California, San Diego (UCSD). His research focuses on quantum complexity theory , particularly exploring near-term quantum computing paradigms and proving quantum advantage over classical systems. He holds a Ph.D. from MIT and was previously a postdoctoral fellow at the University of Waterloo’s Institute for Quantum Computing. Education: Ph.D. in Computer Science, MIT B.S. in Computer Science and Mathematics, University of South Carolina Research Interests: Grier’s work bridges theoretical computer science and quantum computing, emphasizing algorithm design, complexity class separations, and foundational questions about quantum supremacy. He studies how low-depth quantum circuits, boson sampling, and other near-term technologies can achieve computational tasks classically deemed intractable. Recent Article Trends: His publications explore efficient quantum state learning (e.g., classical shadows), hardness results for quantum sampling problems (e.g., bipartite Gaussian boson sampling), and circuit lower bounds (e.g., depth-2 QAC circuits). These contributions highlight his focus on rigorously defining quantum computational advantages. Awards: None explicitly listed in the text. Advising & Grants: Advises at least one student, Jackson Morris. His research is supported by grants exploring quantum complexity and algorithm design. Teaches advanced courses on quantum complexity theory, computability, discrete mathematics, and quantum computing fundamentals. Labs/Teams: Maintains an active lab focused on quantum complexity theory, collaborating with colleagues on topics like interactive protocols and shallow quantum circuits.
Risto Miikkulainen is a Professor of Computer Science and Neuroscience at the University of Texas at Austin and VP of AI Research at Cognizant AI Lab. He directs the UTCS Neural Networks Research Group and is currently on leave from UT, working on Evolutionary Computation and Deep Learning at Sentient Technologies, Inc. Education: Ph.D. in Computer Science, UCLA, 1990 M.S. in Applied Mathematics, Helsinki University of Technology (now Aalto University), 1986 Risto Miikkulainen's research focuses on biologically-inspired computation such as neural networks and evolutionary computation. His work spans three main areas: (1) Neuroevolution, evolving complex deep learning architectures and recurrent neural networks for sequential decision tasks in robotics, games, and artificial life; (2) Cognitive Science, developing models of natural language processing, memory, and learning that shed light on disorders such as schizophrenia and aphasia; and (3) Computational Neuroscience, studying the development, structure, and function of the visual cortex, episodic memory, and language processing. His research combines theoretical understanding of biological information processing with practical applications for developing intelligent artificial systems. His recent publications (2025) show a strong focus on evolutionary approaches to AI development, particularly in neural architecture search, loss function optimization, and explainable AI. Many papers explore the intersection of evolutionary computation with deep learning, creating more efficient and transparent AI systems. His work spans theoretical foundations and practical applications in areas ranging from environmental control systems to cognitive modeling. Scientific Awards: College of Fellows, International Neural Network Society, 2024 Best Pathway to Impact Award, NeurIPS Climate Change workshop, 2024 AAAI Fellow, 2023 IEEE CIS Evolutionary Computation Pioneer Award, 2020 Gabor Award, International Neural Network Society, 2017 Outstanding Paper of the Decade Award, International Society for Artificial Life, 2017 IEEE Fellow, 2016 Multiple Best Paper Awards at GECCO, CIG, and CEC conferences Deployed Application Award, AAAI/IAAI-2013, AAAI/IAAI-2018 Miikkulainen has extensive experience mentoring students through undergraduate research courses like CS378 Computational Intelligence in Game Design I and II, where students develop independent research projects on the OpenNERO research platform. He has received multiple awards for deployed applications, demonstrating the practical impact of his research. His work has led to the development of the NERO game platform, which serves as both an educational tool and research platform for AI. He directs the UTCS Neural Networks Research Group, which focuses on neuroevolution, cognitive science models, and computational neuroscience. The group has developed the NERO (Neuro-Evolving Robotic Operatives) platform, a machine learning game that allows users to train intelligent agents through evolutionary computation. The group's work spans theoretical research and practical applications in AI, with connections to both academic and industry partners.
Jiaoyang Li is an Assistant Professor at the Robotics Institute, Carnegie Mellon University , where she leads research in large-scale multi-robot coordination. She earned her Ph.D. in Computer Science from the University of Southern California (2022) under Professor Sven Koenig and holds a B.Eng. in Automation from Tsinghua University (2017) . Ph.D. (2022): University of Southern California B.Eng. (2017): Tsinghua University Research Focus : Jiaoyang Li's work centers on algorithms for multi-robot coordination in dynamic environments. Key areas include: Multi-Agent Path Finding (MAPF) Lifelong Planning for Autonomous Systems Kinodynamic Motion Planning Warehouse and Transportation Automation Human-Robot Collaboration Integration of Planning and Machine Learning Swarm Robotics Publication Trends : Recent work spans 2023-2025 , showing emphasis on: Scalable coordination for 10,000+ robots Bézier curve optimization for dual-arm assembly Diffusion models in multi-robot motion planning Guidance graph optimization for airport/railway traffic Multi-objective search in warehouse automation Temporal plan graphs for switchable passing orders Scientific Honors : ICAPS-24 Best Student Paper Award Three top dissertation awards (ICAPS-23, IFAAAMAS, USC) 2023 League of Robot Runners champion Outstanding student paper award at ICAPS-20 Technology Commercialization Award from USC Student Leadership : Advises 5 Ph.D. students and 1 Master's student at CMU, with alumni now at MIT (Ying Feng) and USC (Yimin Tang). Collaborates with visiting students from National University of Singapore and Tsinghua University. Lab Affiliation : Directs the Artificial Intelligence for Robot Coordination at Scale (ARCS) Lab , focusing on: Warehouse automation with thousands of robots Multi-arm LEGO assembly systems Railway coordination algorithms Cooperative assembly with multiple manipulators
Sanjay Jain is a Provost's Chair Professor in the Department of Computer Science at the School of Computing, National University of Singapore (NUS). His research focuses on theoretical computer science with particular emphasis on inductive inference, recursion theory, complexity theory, and computational learning theory. Education: B.Tech. in Computer Science from Indian Institute of Technology Kharagpur, India (1986) M.S. in Computer Science from University of Rochester, USA (1988) Ph.D. in Computer Science from University of Rochester, USA (1990) Professor Jain's research spans multiple areas of theoretical computer science. His primary contributions are in computational learning theory, where he has made significant advances in understanding the intrinsic complexity of language identification and the limits of inductive inference. His work on recursion theory explores fundamental questions about computability and complexity, while his research in complexity theory addresses structural aspects of computational problems. A notable achievement was his work on "Deciding Parity Games in Quasipolynomial Time," which won the prestigious STOC 2017 best paper award and later the EATCS-IPEC Nerode Prize. Professor Jain's publication record shows a consistent focus on theoretical foundations of computer science, particularly in learning theory and computational complexity. His recent work has expanded into automatic structures, semiautomatic models, and connections between computational learning and algebraic structures. There is a clear progression from foundational work on language identification to more complex models involving automatic functions, transducers, and connections to mathematical logic. Scientific Awards: STOC 2017 Best Paper Award for "Deciding Parity Games in Quasipolynomial Time" EATCS-IPEC Nerode Prize (2021) Professor Jain has served on the editorial board of Information and Computation and has been actively involved in the academic community through program committee memberships for major conferences including COLT, ALT, LATA, TAMC, and PRICAI. He has held leadership roles as program co-chair for ALT 2000 and ALT 2013, and conference chair for ALT 2005. His work has been supported by various research grants, though specific details are not provided in the available materials. Professor Jain leads research in theoretical computer science at NUS, where he has built a strong research group focused on computational learning theory and related areas. His work often involves collaborations with researchers from around the world, particularly with Frank Stephan, with whom he has co-authored numerous papers. His research group has made significant contributions to understanding the fundamental limits and possibilities of computational learning models.
Marina Blanton is an Associate Professor in the Department of Computer Science and Engineering at the University at Buffalo, and Faculty Director of Women in Science and Engineering within the School of Engineering and Applied Sciences. She holds a PhD in Computer Science from Purdue University (2007), along with multiple advanced degrees in Computer Science and Electrical Engineering from prestigious institutions in the US and Russia. Her research focuses on applied cryptography, information security, and privacy-preserving computation and outsourcing. She has pioneered work on secure multi-party computation protocols, privacy-preserving biometric authentication, and secure data analytics across distributed systems. Her contributions include foundational frameworks like PICCO, a compiler for private distributed computation, and advancements in protocols for genomic data analysis and floating-point secure computation. Blanton has been recognized with numerous awards, including IEEE and ACM Senior Membership (2016/2015), the ACM CCS Test of Time Award (2015), and the AFOSR Young Investigator Award (2013). Her research has been supported by grants such as NSF SaTC awards and AFOSR funding. Her work emphasizes practical implementations of secure computation, with applications in healthcare, biometrics, and distributed data systems. She has advised numerous students and contributed to educational initiatives promoting women in STEM through her leadership roles.
Matthew Lakin is an Associate Professor with tenure in the Department of Computer Science at the University of New Mexico, with a courtesy appointment in the Department of Chemical & Biological Engineering. He is affiliated with the UNM Center for Biomedical Engineering and the School of Engineering, and collaborates extensively with the UNM Health Sciences Center and external institutions. Education: Ph.D., Computer Science, University of Cambridge, 2010 M.A. (Cantab), University of Cambridge, 2009 B.A. (Hons), Computer Science, University of Cambridge, 2005 Dr. Lakin's research focuses on molecular computing, DNA nanotechnology, synthetic biology, and formal verification of biomolecular circuits. He develops computational models and experimental systems for programmable biological devices, especially using heterochiral DNA to enhance stability in living cells. His work spans software tools for biodesign and experimental validation in mammalian systems, with applications in nanomedicine and biosensing. The recent publications highlight a strong trend in engineering robust, intelligent biomolecular systems. His work integrates machine learning concepts into chemical reaction networks, advances geometric modeling of DNA systems, and pioneers L-DNA-based circuits for intracellular applications. The research spans theoretical foundations, software tools, and wet-lab experimentation, emphasizing interdisciplinary innovation. Scientific Awards: Presidential Early Career Award for Scientists and Engineers (PECASE), 2025 NSF CAREER Award, 2021 UNM School of Engineering Junior Faculty Research Excellence Award, 2021 Multiple student awards under his mentorship, including the Outstanding Graduate Student Award and DNA28 Best Student Presentation recognition Dr. Lakin has advised numerous graduate and undergraduate students, including Ph.D. graduates in Biomedical Engineering and Computer Science. He leads major funded projects such as the NSF CAREER grant on heterochiral molecular computing, an EPSCoR Research Fellowship, and a $3M NSF grant on heavy metal biosensing in collaboration with Native American communities. He is also PI on multiple NSF grants related to synthetic cells and nucleic acid technologies. He directs the Lakin Lab for Programmable Biology, which operates within the Department of Computer Science and collaborates with Chemical & Biological Engineering and the Center for Biomedical Engineering. The lab emphasizes both computational modeling and experimental molecular biology, and runs an NSF-funded biotechnology summer camp in partnership with ¡Explora! science museum to strengthen STEM education in New Mexico.
Professor Alessandra Russo leads the Structured and Probabilistic Knowledge Engineering (SPIKE) research group at Imperial College London's Department of Computing. With expertise spanning computational logic, symbolic machine learning, and neuro-symbolic AI, she develops foundational AI techniques applied to security, network management, healthcare, and adaptive systems. Professor Russo holds a PhD in Computing from Imperial College London and an MSc in Computer Science from Ionian University. Her research pioneers logic-based learning systems for intelligent adaptive technologies, with projects including declarative networking for security management, privacy-preserving federated learning, and hybrid neuro-symbolic approaches for robust reasoning. Her current work focuses on developing interpretable AI systems through neuro-symbolic integration, creating frameworks that combine neural networks with symbolic reasoning for explainable decision-making. Recent publications explore rule learning from knowledge graphs, transformer-based world models, and formal methods for representation learning. Professor Russo teaches courses on Logic-Based Learning and AI Applications, and has received the Google PhD Fellowship for her research contributions. She mentors numerous PhD students in areas spanning theoretical foundations and practical applications of computational logic and machine learning.
