Sicun Gao is an Associate Professor in the Computer Science and Engineering department at the University of California, San Diego. His research focuses on practical algorithms for NP-hard search and optimization problems in computational systems, emphasizing combinatorial perspectives in numerical and statistical contexts to achieve reliable autonomy. Research Interests: Automated reasoning, Hamilton-Jacobi reachability, safe reinforcement learning, control barrier functions, and optimization in cyber-physical systems. Teaching: Courses on AI search, optimization, and graduate research seminars. The 15 most recent publications highlight advancements in safe AI control, motion planning, and policy optimization, often integrating neural networks with formal verification. Awards include the IEEE Power & Energy Society Technical Committee Prize Paper Award and the IROS RoboCup Best Paper Award. He advises PhD students working on AI-driven control and robotics, with alumni placed at institutions like Seoul National University, Amazon, and Apple. Grants include NSF Career, Air Force Young Investigator, and DARPA Assured Autonomy funding. His lab develops tools like dReal for automated reasoning in nonlinear theories over the reals.
Maya Ramanath is an Associate Professor in the Department of Computer Science and Engineering at Indian Institute of Technology (IIT) Delhi. She joined IIT Delhi in 2011 after a postdoctoral research stint at the Max-Planck Institute for Informatics in Germany. Her research interests focus on database systems, information retrieval, semantic web technologies, and knowledge graph construction and applications. Education: PhD in Computer Science, Indian Institute of Science, Bangalore M.Sc.(Engg.) in Computer Science, Indian Institute of Science, Bangalore B.E. in Computer Science and Engineering, Bangalore University, Bangalore Her recent work emphasizes efficient query processing over large-scale graphs, knowledge graph applications, and natural language interfaces for semantic data. Notable contributions include algorithms for reachability approximation in web-scale graphs, speculative query planning for knowledge graphs, and exploratory querying techniques. She has collaborated extensively on projects like NAGA, ESTHETE, and KlusTree, advancing the state of the art in graph-based data management and semantic search. Publications span conferences such as ICDE, ECIR, EDBT, and VLDB, reflecting a strong focus on database systems, graph algorithms, and semantic web applications. Her work bridges theoretical foundations with practical implementations, addressing scalability and efficiency challenges in modern data management systems. Research and advising activities include supervision of projects on distributed graph processing, query optimization, and knowledge representation. She has contributed to open-source tools like LegoDB and StatiX, and her lab focuses on interdisciplinary approaches to data-centric AI.
Swiss Federal Institute of Technology in LausanneSwitzerland
Caglar Gulcehre is a Tenure Track Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL) and Principal Investigator of the CLAIRE (Caglar Gulcehre Laboratory of Artificial Intelligence Research) lab. Previously, he worked as a Staff Research Scientist at Google DeepMind, Microsoft Research, and IBM Research. His research focuses on reinforcement learning , foundation models , LLM alignment , and sequence modeling . Current Position : Assistant Professor, EPFL Lab : CLAIRE Lab Previous Roles : Staff Research Scientist at DeepMind, MSR, IBM Research His work spans reinforcement learning , deep learning , and neural architecture design , with a focus on safety , trustworthy AI , and real-world applications . He has published in top venues including Nature , NeurIPS , ICML , and JMLR . Scientific contributions include: Best paper award at NeurIPS Nonconvex Optimization workshop Honorable mention for best paper at ICML 2019 Co-organizer of seven workshops at NeurIPS, ICML, and ICLR He supervises PhD students in areas related to AI for algorithm discovery , neural architectures , and foundation models , including: Skander Moalla Justin Samuel Deschenaux Liangze Jiang Xiuying Wei Yitao Xu
Paul Goldberg is a Professor of Computer Science and Director of the MSc in Mathematics and Foundations of Computer Science (MFoCS) at the University of Oxford. He holds a BA in Mathematics from Oxford University and a PhD in Computer Science from the University of Edinburgh. His research focuses on algorithmic game theory, computational complexity, and machine learning, with notable contributions to equilibrium computation, complexity classes of total search problems, and decentralized systems. Affiliations: Department of Computer Science, Oxford; Editorial Board of ACM Transactions on Economics and Computation. Education: PhD in Computer Science (1993), University of Edinburgh MSc in Computer Systems Engineering (1989), University of Edinburgh and Université Paris-Sud BA in Mathematics (1988), Oxford University Research Interests: Algorithmic game theory, computational complexity (especially total search problems like CLS and PPAD), decentralized computation of equilibria, and applications in machine learning and AI. His work bridges theoretical computer science and economics, with a focus on algorithm design and complexity analysis. Publications and Awards: Over 120 papers, including influential work on Nash equilibrium complexity (2009), gradient descent (2023), and fair division algorithms. Notable awards include the ACM SIGecom Test of Time Award (2022) and a SIAM Outstanding Paper Prize (2011). Grants and Students: Leads EPSRC-funded projects on game theory and machine learning. Supervised 11 PhD graduates and currently advises Giannis Tyrovolas and others. Active in mentoring MSc and undergraduate projects. Labs/Teams: Part of the Algorithms and Complexity Theory group at Oxford, contributing to research on optimization, equilibrium dynamics, and fair division.
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University's School of Computer Science. He maintains an office in the Gates-Hillman Center (7205 Gates-Hillman) and teaches various courses in algorithms and theoretical computer science. Professor Sleator's research spans several areas of theoretical computer science and algorithms. His primary interests include: Algorithms and Data Structures Amortized Analysis and Competitive Analysis Persistent and Self-Adjusting Data Structures Computational Geometry and Combinatorial Optimization Combinatorial Game Theory and Mathematical Games Music Analysis using Computational Methods His extensive publication record shows a consistent focus on efficient data structures and algorithms. Over the years, his work has evolved from foundational data structures like splay trees and skew heaps to applications in diverse areas such as music analysis and combinatorial games. A notable trend in his work is the development of self-adjusting data structures that achieve excellent amortized performance without maintaining explicit structural constraints. His papers on splay trees, skew heaps, and persistent data structures have become classics in the field. Professor Sleator has made significant contributions across multiple domains of computer science. His work on competitive algorithms for paging and list update problems has been particularly influential, establishing fundamental results in online algorithms. His research extends beyond traditional computer science into interdisciplinary areas like computational music theory, demonstrating the broad applicability of algorithmic thinking. He teaches a variety of courses including Algorithms 15-451/651, Competition Programming 15-295, and specialized topics like mathematical games.
Nina Balcan is a Professor at Carnegie Mellon University and holds the Cadence Design Systems Professorship in Computer Science. She is affiliated with the School of Computer Science, specifically the Machine Learning Department (MLD) and Computer Science Department (CSD). Her research spans foundational aspects of machine learning, artificial intelligence, theoretical computer science, algorithmic game theory, and interdisciplinary connections in learning theory. Machine Learning Artificial Intelligence Theoretical Computer Science Algorithmic Game Theory Multi-Agent Systems Data-Driven Algorithm Design Her recent work focuses on advancing algorithm design through machine learning, robustness in adversarial environments, and economic modeling. Key contributions include Learning to Branch (JACM 2024), Regret Minimization in Stackelberg Games (NeurIPS 2024), and Learning Accurate Decision Trees (UAI 2024, Outstanding Student Paper Award). She has pioneered novel approaches to data-driven optimization, semi-supervised learning, and privacy-preserving clustering. Nina has received prestigious accolades including ACM Fellow AAAI Fellow Simons Investigator 2019 ACM Grace Murray Hopper Award Her teaching at CMU includes graduate courses on machine learning, advanced machine learning, and specialized topics like algorithmic game theory.
Ajit Rajwade is a Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay. His research spans Artificial Intelligence , Compressed Sensing , and Medical Imaging , with affiliations to the Centre for Machine Intelligence and Data Science and the Koita Centre for Digital Health . Education : PhD in Computer and Information Science and Engineering, University of Florida (2010) MSc in Computer Science, McGill University (2004) BTech in Computer Engineering, University of Pune (2002) His research interests focus on intelligent data acquisition, particularly in neural network analysis , graph signal processing , and medical imaging . He develops compressed sensing algorithms for inverse problems like tomography and MRI reconstruction , alongside applying group testing to pandemic response. Scientific awards include the Prof. S. P. Sukhatme Award (2024) and Departmental Teaching Excellence (2019). His publications demonstrate expertise in image restoration , noise modeling , and epidemiological algorithms . He has advised PhD students like Sabyasachi Ghosh and Jerin Geo James , with a focus on computationally efficient methods in medical imaging and machine learning .
Massachusetts Institute of TechnologyUnited States
Bradley Olsen is a Professor of Chemical Engineering at the Massachusetts Institute of Technology (MIT), holding the Alexander and I. Michael (1960) Kasser Chair in Chemical Engineering. He is affiliated with MIT's School of Engineering and directs research in the Plastics and the Environment Program. His academic career spans over two decades with numerous prestigious appointments and recognitions. Olsen earned his S.B. from MIT in 2003 followed by a Ph.D. from the University of California Berkeley in 2007. His educational background is complemented by postdoctoral fellowships including NIH and Beckman Institute Postdoctoral Fellowships (2008-2009) and the Hertz Fellowship (2003-2007). Research Interests Professor Olsen's research focuses on designing materials to address important challenges while understanding the fundamental science necessary for materials design. His primary research areas include block copolymers, soft condensed matter physics, protein-based materials, and bioelectronics. His group specializes in polymer networks, protein-polymer conjugates, self-assembly phenomena, and sustainable polymer development. The research has significant implications for biomaterials, sustainable polymers, and advanced materials design. Publication Trends Analysis of Professor Olsen's recent publications reveals a strong focus on polymer network topology, protein-polymer conjugates, and sustainable materials. His work increasingly integrates computational methods with experimental approaches, particularly in polymer characterization and data science applications to materials science. Recent publications show growing emphasis on biodegradable polymers, polymer informatics, and biomedical applications of advanced materials. Scientific Recognition Professor Olsen has received numerous prestigious awards throughout his career, including: American Physical Society (APS) Fellow (2023) Fulbright Amazonia Scholar (2023) Alexander and I. Michael Kasser Chair in Chemical Engineering (2021) ACS Macro Letters/Biomacromolecules/Macromolecules Young Investigator Award (2021) AIChE Owens Corning Early Career Award (2019) American Physical Society Dillon Medal (2018) Alfred P. Sloan Research Fellow in Chemistry (2014) Advising and Funding Professor Olsen has secured significant research funding from multiple federal agencies including NSF, NIH, AFOSR, and DOE. His group has produced numerous high-impact publications across top journals in polymer science, materials science, and chemistry. He has advised multiple graduate students and postdoctoral researchers who have gone on to successful careers in academia and industry. The MIT OGE's Committed to Caring Honor (2019) recognizes his excellence in graduate student mentoring. Research Infrastructure Professor Olsen leads a research group with capabilities spanning polymer synthesis, protein engineering, materials characterization, and computational modeling. His lab maintains strong collaborations with other MIT departments, national laboratories, and international research institutions. The group participates in several interdisciplinary initiatives including the Plastics and the Environment Program and has developed significant data infrastructure for polymer science through projects like CRIPT and BigSMARTS.
Massachusetts Institute of TechnologyUnited States
Alexandre Jacquillat is the Maurice F. Strong Career Development Associate Professor and Associate Professor of Operations Research and Statistics at MIT Sloan School of Management. His research focuses on data-driven decision-making with applications in air traffic management, urban mobility, and decarbonization. He holds a PhD in Engineering and MS degrees from MIT and École Polytechnique. Education PhD in Engineering, MIT MS in Technology and Policy, MIT MS in Applied Mathematics, École Polytechnique Research Interests His work develops scalable optimization models for efficient, equitable, and sustainable operations. Key areas include stochastic optimization, large-scale systems design, and machine learning applications in transportation and public policy. Recent projects explore vertiport planning for urban aerial mobility and prescriptive analytics for pandemic response. Awards Harold W. Kuhn Award (2024) INFORMS Harvey Greenberg Research Award (2023) MIT Jamieson Prize for Excellence in Teaching (2023) Multiple INFORMS Best Paper Awards (2015-2023) Named Leading Academic Data Leader by Chief Data Officer Magazine (2021-2022) Teaching & Grants Teaches courses in optimization (15.093, 15.083) and analytics (15.072). His grants support work in robotic warehousing, air traffic scheduling, and disaster response logistics. Advises on transportation analytics for industry and government. Labs/Teams Leads MIT Sloan's operations research group, collaborating with industry partners like McKinsey & Co. and Booz Allen Hamilton on transportation analytics and optimization projects.
Max Planck Institute for the Science of LightGermany
Ashley Montanaro is Professor of Quantum Computation in the School of Mathematics at the University of Bristol, and co-founder of the quantum software startup Phasecraft. He is a member of the Quantum Information Theory research group at Bristol. His research focuses on the theory of quantum computing, with particular interest in quantum algorithms, computational complexity, quantum query and communication complexity, and classical algorithms. His work spans both theoretical foundations and practical applications of quantum computing. Montanaro's research output shows significant trends toward quantum algorithms for optimization problems, quantum computational supremacy, and bridging theoretical advances with practical implementation challenges. His publications span foundational quantum information theory to applied quantum algorithms, demonstrating a versatile research program that connects computer science with quantum physics. Among his professional activities, Montanaro served on the QIP steering committee (2016-2018) and was an editor for the Quantum journal until 2019. He has been active in conference organization, serving on program committees for ITCS 2018, AQIS 2017 and 2015, QIP 2015, and TQC 2014 and 2013, reflecting his standing in the quantum computing research community. He has supervised numerous PhD students including Josh Blake, Jorja Kirk, Sheila Perez Garcia, Sami Boulebnane, Jan Lukas Bosse, Lana Mineh, Joao F. Doriguello, Chris Cade, Sam Pallister, and Stephen Piddock. His teaching includes Quantum Computation (MATHM0023) which he has taught since 2014 and Advanced Quantum Information Theory which he taught in 2015 and 2016. As co-founder of Phasecraft, Montanaro is actively translating theoretical quantum computing advances into practical software solutions, positioning him at the intersection of academic research and quantum technology commercialization.
Anoosheh Heidarzadeh is an Assistant Professor in the Department of Electrical and Computer Engineering at Santa Clara University's School of Engineering. He holds a Ph.D. in Electrical and Computer Engineering from Carleton University (2012) and previously served as a Visiting Assistant Professor at Texas A&M University (2018-2022) and Associate Research Scientist at the same institution (2015-2017). His postdoctoral research was conducted at the California Institute of Technology (2013-2014). His research focuses on: Information and coding theory : Fundamental limits of data transmission and storage systems Private and secure computing : Protocols for confidential data processing in networked environments Fault-tolerant distributed systems : Resilient computation frameworks for large-scale applications Distributed machine learning : Scalable algorithms for collaborative learning architectures Recent publications (2021-2022) demonstrate strong emphasis on privacy-preserving computation (covering 73% of articles) and distributed coding techniques (67% of articles), with innovations in private information retrieval, matrix operations, and group testing methodologies. Theoretical contributions dominate (87%), while 13% address applied challenges like COVID-19 screening.
Massachusetts Institute of TechnologyUnited States
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.
Howie Choset is a Professor of Robotics at the Robotics Institute, Carnegie Mellon University. He directs the Undergraduate Robotics Minor and leads the Biorobotics Laboratory, where his research focuses on snake robots, motion planning, and medical robotics. He is also affiliated with the Manufacturing Futures Institute. Ph.D., Mechanical Engineering, California Institute of Technology (1996) M.S., Mechanical Engineering, California Institute of Technology (1995) B.S.E., Computer Science and Engineering, University of Pennsylvania (1990) B.S., Economics, The Wharton School of Business (1990) Choset's research centers on robotics for confined and complex environments, particularly through the development of snake robots. His work integrates mechanism design, path and motion planning, and estimation to enable applications in surgery, manufacturing, infrastructure inspection, and search and rescue. He is a pioneer in medical robotics and has co-founded Medrobotics to commercialize minimally invasive surgical robots. His recent publications highlight a strong focus on ergodic exploration, multi-agent systems, motion planning under uncertainty, and medical robotics. Themes include optimizing robot trajectories for information gathering, solving complex path planning problems with dynamic obstacles, and advancing autonomous systems for disaster response and space exploration (e.g., the EELS robot for Enceladus). MIT Technology Review Top 100 Innovators under 35 (2002) Best Paper Award, RIA (1999) Best Paper Award, ICRA (2003) Best Paper, IEEE Bio Rob (2006) Best Video, ICRA (2011) Nominations for best papers at ICRA, IROS, and CLAWAR Choset has advised numerous students, many of whom have won top awards. His lab has received significant funding for robotics research, including projects in surgical robotics, additive manufacturing, and autonomous exploration. He is the lead author of the textbook Principles of Robot Motion and is actively involved in educational innovation through custom robotics labs. He leads the Biorobotics Laboratory at CMU, which develops advanced robotic systems like snake robots and the EELS (Exobiology Extant Life Surveyor) robot for NASA missions. The lab collaborates with industry and government agencies on applications ranging from surgery to space exploration.
Salim ROSTAMI is an Associate Professor at the IÉSEG School of Management in France, specializing in Operations Management. He holds a Ph.D. in Economics and Mathematics Sciences from KU Leuven (2019) and a Master’s in Engineering from KU Leuven (2013), alongside a Bachelor’s in Industrial Engineering from Ferdowsi University of Mashhad (2012). His research focuses on scheduling under uncertainty, project planning, combinatorial optimization, and healthcare logistics. Notable achievements include the 2016 2nd Best Conference Paper Award from the University of Valencia. Education: Ph.D., Economics and Mathematics Sciences, Operations Management, KU Leuven, Belgium (2019) Master, Engineering, Operations Research, KU Leuven, Belgium (2013) Bachelor, Engineering, Industrial Engineering, Ferdowsi University of Mashhad, Iran (2012) His work spans stochastic resource-constrained project scheduling, sequential testing of systems, and chemotherapy appointment scheduling. He has published widely in journals like the European Journal of Operational Research and Flexible Services and Manufacturing Journal. Teaching roles include courses on operations management and project management across undergraduate and graduate programs. Awards: 2016: 2nd Best Conference Paper Award, University of Valencia His research emphasizes practical applications in healthcare and project management, leveraging dynamic programming and metaheuristic algorithms. Collaborations include work with institutions like École des Mines de Saint-Étienne and KU Leuven.
Lars Rohwedder is an Associate Professor in the Algorithms Group at the University of Southern Denmark (SDU) in Odense. He previously held positions as an Assistant Professor at Maastricht University (Netherlands) and postdoc researcher at EPFL, Lausanne (Switzerland). He earned his Ph.D. in Computer Science from CAU Kiel (Germany), advised by Klaus Jansen, and is a recipient of the 2019 PhD of the year award from Förderverein der TF of Kiel University. His research focuses on algorithms for combinatorial optimization, including approximation algorithms, online algorithms, parameterized algorithms, and integer programming. He has contributed to solving scheduling problems, resource allocation, and optimization under uncertainty. Rohwedder has served on program committees for conferences like MAPSP, SODA, STACS, and ICALP. He is funded by NWO's Open Competition M1 project on quasi-polynomial time algorithms. His teaching includes courses on advanced algorithms, operations management, and optimization at SDU and Maastricht University. Key achievements include a quasi-polynomial approximation for the restricted assignment problem, FPT algorithms for scheduling, and contributions to the Submodular Santa Claus problem. His work bridges theoretical foundations and practical applications, with a focus on algorithmic efficiency and robustness.
