Ricky Ini Liu is an Associate Professor in the Department of Mathematics at the University of Washington. Previously, he held positions at North Carolina State University, the University of Michigan, and the University of Minnesota. He earned his Ph.D. in Mathematics from MIT in 2010 under Alexander Postnikov. His research focuses on algebraic combinatorics, particularly its intersections with algebraic geometry, combinatorial geometry, and representation theory. Key interests include Schubert polynomials, polytopes, Hopf algebras, and Kronecker coefficients. He has contributed to foundational work on birational rowmotion, Gelfand-Tsetlin polytopes, and Fomin-Kirillov algebras. Liu has taught a wide range of courses at UW, including special topics in dynamical algebraic combinatorics, combinatorial theory, and problem-solving. He has also been a key instructor at the Mathematical Olympiad Summer Program since 2007 and mentored undergraduates in research programs at the University of Minnesota, Duluth. His publications span high-impact journals like Selecta Mathematica and Journal of Combinatorial Theory , with recent work addressing topics such as determinantal formulas for Schubert polynomials and applications of flow polytopes to diagonal harmonics. Though no specific awards are listed, his extensive publication record and academic roles reflect significant contributions to combinatorial mathematics.
Amitabha Bagchi is a Professor in the Department of Computer Science and Engineering at IIT Delhi. His research spans data algorithmics, probability, networks, and theoretical computer science, with applications in distributed systems, social networks, and AI-driven platforms. He has published extensively in leading venues such as SIGMOD, VLDB, ICDE, AAAI, and KDD, often collaborating with students and researchers on problems involving graph algorithms, fairness, and large-scale data analysis. Research Interests: His primary research interests include Data Algorithmics, Probability and Networks, Theoretical Computer Science, Distributed Algorithms, Graph Algorithms, and Machine Learning Theory. He investigates algorithmic foundations for real-world problems such as food delivery optimization, social network analysis, and efficient data structures for streaming and large graphs. Publication Trends: Recent publications focus on fairness in gig economy platforms, efficient solvers for graph Laplacians, generalization in neural networks, and temporal graph querying. His work combines theoretical rigor with practical impact, often involving GPU acceleration, distributed computing, and data-aware algorithm design. Scientific Service: Editor, Algorithms (2020–present) Editor, Journal of Discrete Algorithms , Elsevier (2006–2018) Guest Editor, special issue on Algorithms for Shortest Paths in Dynamic and Evolving Networks , Algorithms (2021) Volume Editor for proceedings of ESA, ATMOS, COCOON, and others Conference Leadership: He has served on numerous program committees and as chair for conferences including ESA (Engineering Track, 2016), ATMOS (2020), and ICALP (2019). His involvement spans algorithmic engineering, transportation optimization, and theoretical computer science forums. Teaching: He currently teaches COL863: Special Topics in Theoretical Computer Science on concentration inequalities and their applications. He has previously taught advanced courses in algorithms and data structures.
Tommi Jaakkola is the Thomas Siebel Professor of Electrical Engineering and Computer Science and the Institute for Data, Systems, and Society at the Massachusetts Institute of Technology. He received his MSc in theoretical physics from Helsinki University of Technology in 1992 and his PhD from MIT in computational neuroscience in 1997. After completing a postdoctoral position in computational molecular biology as a DOE/Sloan fellow at UCSC, he joined the MIT EECS faculty in 1998. His research advances how machines can learn, predict or control, and do so at scale in an efficient, principled, and interpretable manner. His work in machine learning extends from foundational theory to modern applications, focusing especially on statistical inference and estimation tasks that lie at the heart of complex learning problems. He designs new methods, theory and algorithms to automate the use and generation of semi-structured data such as natural language text, images, molecules, or strategies. Jaakkola applies and develops algorithms to solve multi-faceted recommender, retrieval, or inferential tasks (particularly in biomedical contexts), design and optimize molecules or reactions for drug design, and model strategic, game theoretic interactions. His recent work heavily focuses on diffusion models, protein structure prediction, molecular design, and generative AI, with significant publications in top conferences including ICML, NeurIPS, and ICLR. His scientific contributions span multiple disciplines with significant impact in both theoretical machine learning and practical applications in computational biology and chemistry, including notable work on antibiotic discovery published in Cell. Current advisees: Julia Balla, Bowen Jing, Hannes Stärk, Peter Holderrieth, Chenyu Wang Recent graduates: Gabriele Corso (Boltz PBC), Ezra Erives (DE Shaw), Jason Yim (Xaira) Jaakkola maintains an active research program through MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL) and the Institute for Data, Systems, and Society (IDSS), with his office located in the Stata Center (32-G470). His work bridges theoretical machine learning with practical applications, making significant contributions to both the academic field and potential real-world impact in healthcare and drug discovery.
Romain Lopez is an Assistant Professor of Computer Science and Biology at New York University, with a joint appointment in the Courant Institute of Mathematical Sciences and the Department of Biology. He will be joining NYU in September 2025, bringing expertise at the intersection of machine learning and computational biology. Prior to joining NYU, he was a Postdoctoral Fellow at Genentech and Stanford Medicine from 2021 to 2025, working with Jonathan Pritchard and Aviv Regev. Dr. Lopez received his educational training at prestigious institutions: PhD in Computer Science (2021) from the University of California, Berkeley, advised by Mike Jordan and Nir Yosef M.S. in Applied Mathematics (2016) from École polytechnique, Palaiseau, France Dr. Lopez's research focuses on developing machine learning methods to understand biological systems at the cellular level. His work bridges computational techniques with biological applications, particularly in single-cell and spatial omics analysis. He pioneered probabilistic approaches for single-cell analysis with scVI and co-developed scvi-tools, now widely adopted tools in the field. His research spans deep generative models, causal inference, perturbation modeling, and representation learning for biological data. His publication record demonstrates a consistent trajectory of innovation in computational biology, with recent work focusing on spatial biology, disentangled representations of cellular perturbations, and causal modeling of cellular responses. He has made significant contributions to the field of single-cell analysis, developing methods that help scientists interpret complex cellular data and predict how cells respond to various perturbations. Dr. Lopez has received numerous honors and awards for his research: Best Paper Award from the ICML Workshop on AI for Science (2024) Best Paper Award Honorable Mention from the AAAI Conference on Artificial Intelligence (2021) Best Student Poster Award from the ICML Workshop on Computational Biology (2019) UC Berkeley EECS Departmental Graduate Fellowship (2016) Carnot Foundation Fellowship (2016) Monahan Foundation Fellowship (2016) French National Defence Medal, Bronze Echelon (2014) At NYU, Dr. Lopez will lead the Biological Machine Learning group, which develops probabilistic machine learning methods to uncover biological mechanisms governing cellular behavior and disease. His lab focuses on creating tools that transform complex cellular data into biological insights, with applications in understanding cancer, immune responses, and fundamental cellular processes. His work has significant implications for precision medicine and drug discovery.
Derek W Hoiem is a Professor in the Siebel School for Computing and Data Science at the University of Illinois Urbana-Champaign, where he has been a faculty member since 2009. His research focuses on computer vision and related areas, and he is also the co-founder and Chief Science Officer of Reconstruct, an AI-based construction technology company. His educational background includes: PhD in Robotics, Carnegie Mellon University (2007) Beckman Postdoctoral Fellowship (2008) Prof. Hoiem's research spans computer vision, with a focus on object recognition, scene understanding, and graphics. His work also extends to mobile robotics and 3D scene reconstruction. He has made significant contributions in areas such as visual recognition, 3D modeling, and the application of computer vision in construction monitoring. His recent publications (2023-2025) demonstrate a strong focus on advancing multimodal understanding, particularly in region-based representations, 3D vision, and neural radiance fields. There is a clear trend towards integrating language and vision, improving efficiency in neural networks, and applying computer vision to real-world problems such as construction progress monitoring. His scientific awards and honors are extensive and include: IEEE Fellow (2022) University Scholar (2022) Koendrink Prize (2022) Dean's Award for Excellence in Research, Associate Professor (2021) Campus Distinguished Promotion Award (2015) Best Paper Award: IEEE Winter Conference on Applications in Computer Vision (WACV) (2015) CW Gear Junior Faculty Award (2014) IEEE PAMI Young Researcher Award (2014) Dean's Award for Excellence in Research, Assistant Professor (2014) Sloan Research Fellowship (2013) Intel Early Career Faculty Honor Program Award (2012) NSF CAREER Award (2011) ACM Doctoral Dissertation Award, Honorable Mention (2008) Carnegie Mellon University SCS Distinguished Dissertation Award (2008) Best Paper Award: IEEE Computer Vision and Pattern Recognition (CVPR) (2006) Prof. Hoiem has secured significant research funding, including an NSF CAREER award and an Intel Early Career Faculty award. He is also actively involved in technology transfer, having co-founded Reconstruct where he serves as Chief Science Officer. His teaching excellence is reflected in multiple "List of Teachers Ranked as Excellent" awards spanning from 2010 to 2021. Prof. Hoiem leads a research group at UIUC focused on computer vision and 3D scene understanding. Additionally, he co-founded and serves as Chief Science Officer at Reconstruct, which develops AI-based solutions for construction monitoring.
Michael A Osborne is Professor of Machine Learning at the University of Oxford and leads the Bayesian Exploration Lab . He serves as Director of the EPSRC Centre for Doctoral Training in Autonomous Intelligent Machines and Systems and co-directs the Oxford Martin AI Governance Initiative. His research focuses on Bayesian optimization, Gaussian processes, and probabilistic numerics with applications in quantum devices, battery modeling, and AI governance. Key Positions: Professor of Machine Learning, University of Oxford Official Fellow, Exeter College Co-founder of Mind Foundry Lead Researcher, Oxford Martin Programme on Technology and Employment Research Themes: Probabilistic modeling for quantum systems Uncertainty quantification in energy storage AI safety and societal impact analysis Automated experimental design Quantum device calibration Probabilistic numerical methods Technical Contributions: Bridging reality gap in quantum devices Efficient Bayesian quadrature techniques Personalized neurostimulation algorithms Automated measurement protocols Quantum-classical hybrid ML
Sergio Bermudo Navarrete is a Professor at the Department of Economics, Quantitative Methods and Economic History, Universidad Pablo de Olavide. His research spans combinatorics, graph theory, and operator theory. Education: PhD in Mathematics (2003, University of Seville) with thesis on functional models of operators in Hilbert spaces. Research Interests: Focus on graph theory, domination problems, topological indices, and operator theory. Publication Trends: Recent work includes vertex-degree-based indices for oriented graphs, domination parameters in product graphs, and differential analysis of line graphs. Keywords span Computer Science , Mathematical Chemistry , and Operations Research . Collaborations: Frequent co-authors: José María Sigarreta Almira, José Manuel Rodríguez García, Juan Alberto Rodríguez-Velazquez. Contact: Email sbernav@upo.es .
Quanquan C. Liu is an Assistant Professor in the Department of Computer Science at Yale University, part of the School of Engineering & Applied Science. His research focuses on algorithms for large data, dynamic/distributed/parallel graph algorithms, and differential privacy. He holds a PhD from MIT's Theory Group, advised by Erik Demaine and Julian Shun, with postdoctoral experience at Northwestern University and MIT. Liu has authored over 50 publications in top venues like FOCS, SPAA, and STACS, and received a Best Paper Award at SPAA 2022. He advises a team of 12+ students, including PhD and undergraduate researchers. His service roles include PC membership for PPoPP, ESA, and SPAA, and coaching for the USA Computing Olympiad (USACO) and ICPC teams. Notable research contributions include advancements in parallel algorithms for graph problems and privacy-preserving techniques.
Joan Bruna is a Full Professor of Computer Science, Data Science, and affiliated Mathematics at New York University's Courant Institute and Center for Data Science. He leads the CILVR group and co-founded the MaD group. His research focuses on mathematical foundations of machine learning, deep learning, signal processing, and their applications in computational science, climate modeling, and geophysics. He holds a Ph.D. in Applied Mathematics from École Polytechnique and has held roles at UC Berkeley, the Institute for Advanced Study, and the Flatiron Institute. Education: Ph.D. (2013) and M.Sc. (2005) in Applied Mathematics, École Polytechnique and ENS Cachan; dual B.Sc./M.Sc. in Telecommunications and Mathematics from UPC Barcelona (2002–2004). Awards include the NSF CAREER Award (2019) and Alfred P. Sloan Fellowship (2018). Research interests span theoretical aspects of deep learning, optimization, and statistical methods, with applications to climate science and inverse problems. He has advised numerous PhD students and postdocs, contributing to seminal work on scattering networks, geometric deep learning, and neural ODEs. Professional service includes editorial roles at TMLR, JMLR, and TPAMI, plus program chairs for major conferences. His work bridges mathematics and machine learning, emphasizing rigorous analysis and real-world impact.
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).
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.
Maria Chudnovsky is a Professor of Mathematics at Princeton University and a former Professor of IEOR and Mathematics at Columbia University (2006-2014). Her research focuses on graph theory and combinatorics, with significant contributions to structural graph theory, perfect graphs, and algorithmic applications. Education: B.A. Summa Cum Laude (1996) and M.Sc. (1999) from Technion, Ph.D. (2003) from Princeton University Her work addresses fundamental problems in graph coloring, forbidden induced subgraphs, and combinatorial optimization, including the proof of the Strong Perfect Graph Theorem and development of algorithms for detecting graph structures. Notable awards include the MacArthur Foundation Fellowship (2013-2017), D.R. Fulkerson Prize (2009), and Henry Burchard Fine Professor of Mathematics (2022). She has held prestigious fellowships such as the Clay Mathematics Institute Research Fellowship (2003-2008). Grants: NSF DMS-EPSRC Grant DMS-2120644 (2021-2024), US Army Research Office Grant W911NF-16-1-0404 (2016-2020), and multiple NSF grants She has advised numerous PhD/MSc students and postdocs, including Sophie Spirkl, Mingxian Zhong, and Tara Abrishami. Her outreach includes popular science communication on YouTube's Numberphile and participation in initiatives promoting women in STEM.
Professor Gabriel Brostow is a faculty member in the Department of Computer Science at University College London (UCL), where he leads research in Computer Vision and Human-Computer Interaction. He also serves as Chief Research Scientist and Senior Director of the R&D Team at Niantic, the company behind Pokémon GO. His work bridges academic research and industry applications, focusing on developing AI systems that enhance human capabilities through what he terms 'Human in the Loop AI'—now commonly referred to as Human-Centered AI. Brostow completed his BS in Electrical Engineering at UT Austin, followed by a PhD with Irfan Essa at Georgia Tech. He then pursued postdoctoral research with Roberto Cipolla's Computer Vision & Robotics Group at Cambridge University as a Marshall Sherfield Fellow, and with Marc Pollefeys in ETH Zurich's CVG Group. His research explores how AI, particularly Computer Vision, can serve as 'super-tools' for professionals across various domains including filmmaking, architecture, robotics, and scientific research. Specific interests include assistive technology for everyday life, authoring systems that maximize user effort, 3D reconstruction, depth estimation, and vision-language models. His work often involves creating systems that are validated through real-world human interaction to ensure practical utility. Analysis of his recent publications reveals a strong focus on practical applications of Computer Vision that directly interact with humans. His research spans 3D scene understanding, depth estimation, sketch-based interfaces, and multimodal AI systems. There's a clear emphasis on creating benchmarks and tools that facilitate human-AI collaboration, with applications in assistive technology, urban planning, filmmaking, and biodiversity monitoring. His work frequently appears at top conferences including CVPR, NeurIPS, ECCV, and CHI. Marshall Sherfield Fellowship Brostow actively mentors PhD students, with current advisees including Ross Murphy, Skanda Koppula, Gizem Unlu, Omiros Pantazis, and Jamie Watson. His alumni include numerous PhD graduates and MSc students who have gone on to successful careers in academia and industry. He emphasizes selecting students based on passion and potential rather than just academic credentials, valuing traits like helpfulness, drive, and hunger to learn. His research is supported through collaborations with major institutions and companies including DeepMind, MIT, and the University of Edinburgh. He leads a research group at UCL that collaborates closely with Niantic's R&D team, creating a unique bridge between academic research and industry application. His team's work frequently involves developing novel Computer Vision techniques that are validated through real-world human interaction, ensuring practical utility alongside technical innovation. The group explores blue-sky research problems with applications ranging from assistive technology to professional tools for filmmakers, architects, and scientists studying diverse environments.
Wojciech Rytter is a full professor at the Institute of Informatics, Department of Mathematics and Informatics at the University of Warsaw, Poland, holding this position continuously since October 1971. His academic career includes significant international appointments as full professor at New Jersey Institute of Technology (2002-2004), Liverpool University (1997-2002), and Bonn University (1994-1995), and as visiting professor at University of California, Riverside (1992-1993) and University of Warwick (1985-1986). He earned his MSc in 1971, PhD in 1975, habilitation in 1985, and was awarded the scientific degree of professor in 1997, all from Warsaw University. Professor Rytter's research focuses on the design and analysis of computer algorithms, with particular expertise in automata and formal languages, parallel algorithms, and text algorithms. His work spans efficient sequential and parallel algorithms, automata theory, complexity of recognition and parsing of context-free languages, pattern matching, algorithmics of WWW, parallel combinatorial computing, graph-theoretic algorithms, and algorithmics of highly compressible objects. His theoretical contributions have practical applications in computational biology, bioinformatics, and text processing systems. His recent publications (2022-2025) demonstrate continued activity in string algorithms, particularly in pattern matching, string covers, and combinatorics on words, with a strong focus on theoretical computer science with applications in bioinformatics. 200 problems on automata, languages, computations (Cambridge University Press 2023) 125 Problems in Text Algorithms (Cambridge University Press, 2021) Jewels of Stringology (World Scientific, 2002) Fast parallel algorithms for matching problems in graphs (Oxford University Press 1998) Text algorithms (Oxford University Press 1994) Professor Rytter has collaborated extensively with researchers including Jakub Radoszewski, Tomasz Walen, Tomasz Kociumaka, and Maxime Crochemore. He is a member of the Academy of Europe (elected 2011, Informatics section) and has authored or co-authored more than 130 publications. He maintains an active research laboratory focused on string algorithms and combinatorics on words at the University of Warsaw.
Eduardo Azevedo is the John M. Bendheim and Thomas L. Bendheim Professor of Business Economics and Public Policy at the Wharton School , University of Pennsylvania. He holds a courtesy appointment as Professor of Economics and was awarded the 2016 Sloan Foundation Fellowship. His research integrates economic theory with practical applications across science and business domains. His research interests include: Market design Selection markets Social science genetics Experimental economics Game theory Recent publication trends focus on: Economic theory applications to healthcare and digital markets Empirical Bayes methods in A/B testing Adverse selection in insurance markets Strategic behavior in two-sided matching Evolutionary behavioral economics He serves as an instructor for BEPP2500 - Managerial Economics , emphasizing real-world application of microeconomic theory to business problems. His work also involves software development for economic research, including MATLAB-based empirical Bayes tools for analyzing treatment effects in large-scale experiments. Scientific awards : Sloan Foundation Fellow (2016)
