Yang P. Liu is an Assistant Professor at Carnegie Mellon University 's Department of Computer Science . He received his PhD from Stanford University under the supervision of Aaron Sidford and previously studied at MIT . Fields of Interest : Graph Algorithms, Optimization, High-Dimensional Geometry, Additive Combinatorics, Theoretical Computer Science. His research focuses on algorithmic design and analysis for graph problems, optimization, and combinatorics, with applications in machine learning and complexity theory. Recent work includes advancements in parallel repetition games , combinatorial lines , and dynamic graph algorithms . In 2024, his research spanned FOCS , STOC , and RANDOM conferences, addressing problems in k-CSPs , min-cost flow , and hypergraph sparsification . Earlier contributions (2023) included deterministic flow algorithms and spectral hypergraph techniques. Scientific Awards : NDSEG Fellowship (2018-2021), Google PhD Fellowship (2022-2023), FOCS Best Paper (2022), STOC Best Student Paper (2022), FOCS Best Student Paper (2021). He teaches CS 15-759 , a graduate course on convex optimization theory and applications, covering gradient descent, interior point methods, and algorithmic sparsification techniques.
Daniel A. Spielman is a Sterling Professor of Computer Science, Statistics & Data Science, and Mathematics at Yale University. He serves as the inaugural James A. Attwood Director of the Institute for Foundations of Data Science (FDS) and was previously co-Director of the Yale Institute for Network Science (YINS). He is also a member of TILOS, the NSF Institute for Learning-Enabled Optimization at Scale. His research interests span Spectral Graph Theory, Algebraic Graph Theory, Laplacian Matrices, Expander Graphs, and Random Walks on Graphs. Spielman has made fundamental contributions to understanding the mathematical foundations of data science, including work on smoothed analysis of algorithms, spectral sparsification, and solutions to the Kadison-Singer problem. Spielman's publications demonstrate a consistent focus on developing efficient algorithms with strong theoretical foundations. His work bridges pure mathematics, theoretical computer science, and practical applications in network analysis and machine learning. His research has evolved from foundational work on smoothed analysis to recent contributions in experimental design using discrepancy theory. His scientific honors include: Nevanlinna Prize for contributions to mathematical aspects of computer science Two Gödel Prizes (2008 and 2015) for outstanding papers in theoretical computer science MacArthur Fellowship ('Genius Grant') Simons Investigator award Membership in the National Academy of Sciences and American Academy of Arts and Sciences Spielman has advised numerous PhD students who have gone on to prominent positions in academia and industry. His teaching includes advanced courses in Spectral Graph Theory and Computation and Optimization. He has developed important software packages like Laplacians.jl for solving Laplacian linear equations and related problems.
Jonathan A. Kelner is a Professor of Applied Mathematics in the Department of Mathematics at the Massachusetts Institute of Technology (MIT) and a member of the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL). His research focuses on applying techniques from pure mathematics to solve fundamental problems in algorithms and complexity theory, with the goal of developing practical algorithms for real-world questions. Dr. Kelner received his undergraduate degree from Harvard University and his Ph.D. in Computer Science from MIT in 2006. Before joining the MIT faculty, he spent a year as a member of the Institute for Advanced Study. His educational background has provided a strong foundation for his interdisciplinary research spanning mathematics and computer science. His research interests include combinatorial optimization, mathematical programming, spectral graph theory, distributed computing, machine learning, computational geometry and topology, computational biology, signal processing, and random matrix theory. Kelner's work demonstrates how deep theoretical insights can lead to practical algorithmic improvements, particularly in graph algorithms and optimization problems. His approach often involves connecting seemingly disparate areas of mathematics to create novel algorithmic techniques. Analysis of his recent publications reveals a strong focus on spectral graph theory, optimization algorithms, and the Sum-of-Squares method. His work frequently addresses fundamental questions in theoretical computer science with practical implications for algorithm design. A notable trend in his research is the development of nearly-linear-time algorithms for various graph problems, which represents significant improvements over previous approaches. NSF CAREER Award Alfred P. Sloan Research Fellowship NEC Award for Research in Computers and Communication Sprowls Doctoral Dissertation Award Best Student Paper Award at STOC 2004 Best Paper Award at STOC 2011 Kokusai Denshin Denwa Junior Faculty Chair 2008 Harold E. Edgerton Faculty Achievement Award 2011 School of Science Award for Excellence in Undergraduate Education 2012 Professor Kelner has been actively involved in mentoring students and has received recognition for his teaching excellence, including the School of Science Award for Excellence in Undergraduate Education in 2012. His research has been supported by prestigious grants including the NSF CAREER Award. He has collaborated extensively with researchers across multiple institutions, often working with other leading figures in theoretical computer science to produce groundbreaking results in algorithm design. At MIT, Kelner is part of both the Mathematics Department and CSAIL, positioning him at the intersection of theoretical mathematics and practical computer science. This dual affiliation reflects the interdisciplinary nature of his work, which bridges pure mathematical theory with concrete algorithmic applications.
Jason Li is an Assistant Professor in the Department of Computer Science at Carnegie Mellon University's School of Computer Science. He teaches advanced algorithms courses including 15-754 Spectral Graph Theory (Spring 2025), 15-451 Design and Analysis of Algorithms (Fall 2024), and 15-850 Advanced Algorithms (Spring 2024). His research focuses on fast graph algorithms , particularly solving longstanding open problems through modern algorithmic techniques. Key research themes include preconditioning and locality , which serve as reductions from worst-case to well-behaved and local instances respectively. His work has produced breakthroughs in deterministic global minimum cut algorithms, all-pairs minimum cut (Gomory-Hu trees), and near-optimal parallel shortest path algorithms. Analysis of his recent publications reveals a consistent trend toward almost-linear time algorithms for fundamental graph problems, with significant contributions to dynamic graph algorithms, minimum cut variants, and parallel computation. His work frequently appears in top venues including STOC, FOCS, and SODA, often with multiple best paper recognitions. EATCS Distinguished Dissertation Award (2021) Best Paper Award at SODA 2024 Invited to HALG 2024 Invited to TALG and JACM for SODA 2024 paper Machtey Best Student Paper at FOCS 2019 Professor Li actively advises graduate students including Henry Fleischmann and George Li. His research is supported by collaborations with leading institutions and frequent invitations to present at major conferences. He maintains an open-door policy for CMU students and collaborators, though notes the high volume of research inquiries he receives weekly.
Ola Svensson is an Associate Professor at the School of Computer and Communication Sciences , EPFL. His research spans approximation algorithms, combinatorial optimization, computational complexity, and scheduling. He holds an ERC Consolidator Grant (2023–) and previously received an ERC Starting Grant (2014–2019) and SNF grant (2019–2023). Education: PhD in Computer Science from IDSIA, Università della Svizzera italiana (2009) M.Sc. from Uppsala University (2005) Research Focus: Svensson develops novel techniques for NP-hard problems, with emphasis on primal-dual methods, LP/SDP hierarchies, and hardness proofs. His work applies to clustering, scheduling, network design, and submodular optimization. Publications: His 15 most recent works (2018–2021) focus on learning-augmented algorithms, robust optimization, and improved approximations for clustering/TSP. Key trends include integration of ML with classical algorithms and quasi-polynomial methods for combinatorial problems. Awards: Best Paper Awards at FOCS (2011, 2017) and STOC (2018) I&C Teaching Award at EPFL Advising & Grants: He advises 6 current PhD students and graduated 8 others. Major grants include ERC Starting Grant 'OptApprox' (€1.4M) and ERC Consolidator Grant 'POTCO' (€2M). Teaching: Leads courses in Advanced Algorithms, Computational Complexity, and Approximation Algorithms. He developed pedagogical frameworks for scribe notes and project-based learning in theoretical computer science.
Mohammad Mohammadi Amiri serves as an Assistant Professor in the Department of Computer Science at Rensselaer Polytechnic Institute (RPI), appointed in Fall 2023. His research focuses on advancing artificial intelligence through strategic data utilization, with emphasis on large language models, data valuation, federated learning, and deep learning. Previously, he held postdoctoral appointments at Princeton University and MIT Media Lab, building on his strong educational foundation from Imperial College London, University of Tehran, and Iran University of Science and Technology. Education: Ph.D. in Electrical and Electronic Engineering, Imperial College London (2019) - Best Ph.D. Thesis Award recipient M.Sc. in Electrical and Computer Engineering, University of Tehran (2014) - Ranked 1st among all M.Sc. students B.Sc. in Electrical Engineering, Iran University of Science and Technology (2011) - Ranked 1st among all B.Sc. students Dr. Amiri's research centers on optimizing artificial intelligence systems through innovative data strategies. His work addresses critical challenges in large language models including efficiency, memory usage, alignment, and reasoning capabilities. In data valuation, he develops principled methods to quantify data worth for fair trading platforms. His federated learning research tackles privacy concerns, heterogeneous data distribution, and communication overhead in decentralized environments. The deep learning component explores theoretical foundations to improve model interpretability and robustness. Analysis of his recent publications reveals a strong focus on making AI systems more efficient and accessible, with particular emphasis on large language model optimization, federated learning advancements, and data valuation frameworks. His work bridges theoretical foundations with practical applications in wireless communications and distributed computing environments. Scientific Awards: IEEE Communications Society Young Author Best Paper Award (2022) Best PhD Thesis Award from IEEE Information Theory Chapter of UK and Ireland (2019) Eryl Cadwallader Davies Prize for Outstanding PhD Thesis (2019) EEE Departmental Scholarship at Imperial College London (2015-2019) Ranked 1st among M.Sc. students at University of Tehran (2014) Ranked 1st among B.Sc. students at Iran University of Science and Technology (2011) Dr. Amiri actively mentors graduate students, currently supervising five Ph.D. candidates and one M.Sc. student working on efficient LLM fine-tuning, inference, and storage. His research has attracted significant attention, evidenced by numerous keynote invitations at prestigious institutions including Bell Labs, MIT, King's College London, and various IEEE conferences. He serves on program committees for major conferences including IEEE Globecom and ICC, demonstrating his growing influence in the academic community. His research group operates at the intersection of machine learning and wireless communications, developing innovative solutions for resource-constrained environments while addressing fundamental theoretical challenges in AI systems. Current projects focus on making advanced AI more scalable and accessible through efficiency improvements in model training and inference.
Zhuo Feng is Professor of Electrical and Computer Engineering at Stevens Institute of Technology, directing the HUDSON Lab and holding a Ph.D. from Texas A&M University. His research develops spectral graph methods for VLSI design, including circuit simulation, power grid verification, and machine learning applications. Funded by NSF CAREER and multiple grants, his work has produced award-winning algorithms like GRASS for graph sparsification. Recent publications focus on spectral methods for circuit stability analysis, physics-informed neural networks, and explainable AI frameworks. He teaches graduate courses in VLSI design and GPU programming while co-founding LeapLinear Solutions. NSF CAREER Award (2014) ACM/IEEE DAC Best Paper Award (2013) Multiple Best Paper Nominations (ICCAD 2008, 2006)
Rasmus Kyng is an Assistant Professor in the Department of Computer Science at ETH Zurich, where he has been since 2019. His research focuses on fast algorithms for graph problems, convex optimization, and their applications in machine learning. He has received grants from the Swiss National Science Foundation, including project grants and a starting grant. Education: B.A. in Computer Science from the University of Cambridge (2011), PhD in Computer Science from Yale University (2017), advised by Daniel A. Spielman. Postdoctoral positions included Harvard University (2018–2019) and a research fellowship at the Simons Institute, UC Berkeley (2017). Research Interests: Development of nearly linear-time algorithms for fundamental graph problems (e.g., maximum flow, minimum-cost flow), dynamic graph algorithms, discrepancy theory, and fine-grained complexity. His work bridges numerical linear algebra and combinatorial optimization, emphasizing practical implementations such as the Laplacians.jl package. Awards: FOCS Best Paper Award (2022), Inaugural ICBS Frontiers of Science Award (2022), Machtey Award (Best Student Paper, FOCS 2017). Teaching: Advanced Graph Algorithms and Optimization (ETH Zurich, 2020–2023), Algorithms, Probability, and Computing (ETH Zurich, 2020–2022). Supervised numerous PhD students and mentored postdocs in theoretical computer science. Labs/Teams: Co-leads a research group with Maximilian Probst Gutenberg, focusing on dynamic graph algorithms and optimization. Collaborations include work on sparsification, spectral graph theory, and machine learning applications.
Dan Spielman is the Sterling Professor of Computer Science and holds joint appointments as Professor of Statistics and Data Science and Mathematics at Yale University. He is affiliated with the Department of Mathematics within the Faculty of Arts and Sciences. His research focuses on spectral graph theory, algorithms, linear systems, and their applications in computer science, mathematics, and statistics. He has been recognized as an ACM Fellow for his contributions to theoretical computer science and mathematics. Dr. Spielman's work bridges theoretical and applied domains, with notable advancements in graph sparsification, Laplacian solvers, and the resolution of the Kadison-Singer problem. His research also encompasses algorithmic design, optimization, and probabilistic methods. Key grants include NSF funding for projects like 'Generalized Algebraic Graph Theory: Algorithms and Analysis' (2016). His scientific awards include the ACM Fellowship (2011), acknowledging his impactful contributions to algorithms and complexity theory. Spielman’s interdisciplinary approach integrates spectral graph theory with practical applications, addressing fundamental problems in computation and mathematics.
Abhinav Shrivastava is an Associate Professor in the Department of Computer Science at University of Maryland, College Park, with a joint appointment in the Institute of Advanced Computer Studies (UMIACS). Previously, he served as an Assistant Professor at the same institution from August 2018 to June 2024, and spent one year as a Visiting Research Scientist at Google Research from September 2017 to August 2018. His educational background includes: PhD in Robotics and Artificial Intelligence from Carnegie Mellon University (2017), advised by Abhinav Gupta, with thesis titled 'Discovering and Leveraging Visual Structure for Large-scale Recognition' MS in Artificial Intelligence from Carnegie Mellon University (2011), supervised by Alyosha Efros and Martial Hebert BTech in Computer Science and Engineering from Jaypee Institute of Information Technology (2010) Professor Shrivastava's research focuses on computer vision and machine learning, with particular expertise in object detection, image recognition, and neural representations. His work bridges theoretical advances with practical applications, exploring how visual systems can discover and leverage structure in large-scale recognition problems. He has made significant contributions to understanding the role of supervision in vision transformers, developing novel approaches for object-state composition recognition, and creating efficient neural representations for videos and 3D scenes. His research often addresses fundamental challenges in visual recognition, including handling novelty in open-world environments and improving the efficiency of visual systems. An analysis of his recent publications reveals a strong emphasis on neural representations, particularly for dynamic content like videos and 3D scenes. His work demonstrates increasing sophistication in handling open-world vision problems, with research spanning object discovery, localization, and representation learning. The publications show a clear progression toward more efficient and scalable models, with recent work focusing on model compression, sparse representations, and addressing the challenges of working with limited annotations. His scientific contributions have been recognized with several prestigious awards: Best Paper Award (Applications) at IEEE Winter Conference on Applications of Computer Vision (2020) Microsoft Research PhD Fellowship (2014-2016) Best Student Paper Award at IEEE Winter Conference on Applications of Computer Vision (2014) Outstanding Reviewer Award at IEEE CVPR (2015) Professor Shrivastava has successfully mentored numerous graduate students, many of whom have become prominent researchers in computer vision. His Amazon Research Awards (2020 and 2023) have supported innovative projects including 'The pursuit of knowledge: discovering and localizing new concepts using dual memory' and 'Audio-conditioned Diffusion Models for Generating Lip-synchronized Videos.' He has served as Area Chair for major conferences including ICCV, CVPR, and AAAI, demonstrating his leadership in the computer vision community. His research has attracted significant funding from both academic and industry sources, supporting his exploration of fundamental questions in visual recognition and representation learning.
Rekha R. Thomas is a Professor of Mathematics and Undergraduate Program Director at the University of Washington. She holds a Ph.D. in Operations Research from Cornell University (1994), with postdoctoral experience at Yale University and the Konrad-Zuse-Zentrum in Berlin. Her research focuses on optimization, applied algebraic geometry, and computer vision, with contributions to semidefinite programming, graphical designs, and geometric algorithms. She has held distinguished positions such as the Robert R. and Elaine F. Phelps Professorship (2008–2012) and the Robert B. Warfield Jr. Faculty Fellowship (2017–2020). Her work bridges theory and application, addressing challenges in computer vision, combinatorial optimization, and algebraic geometry. Notable contributions include advancements in multiview geometry, kernel learning, and the geometric analysis of rank-deficient matrices. She actively collaborates across disciplines, publishing extensively and supervising numerous graduate students and postdocs. Rekha also engages in academic leadership, mentoring students, and participating in international conferences. Her research has been recognized through invited talks at major events like the International Congress of Mathematicians (2018) and SIAM Annual Meetings. She continues to explore the intersections of algebraic geometry, optimization, and computational methods.
James R. Lee is a Professor in the Department of Computer Science at the University of Washington. His research spans theoretical computer science, probability, and geometry. He has held visiting scientist roles at Microsoft Research (2023, 2018, 2017) and participated in programs at the Simons Institute (2023, 2020, 2018, 2017, 2014). Research Interests: Algorithms, complexity theory, convex optimization, metric embeddings, spectral graph theory, probability, stochastic processes, and the interplay between discrete and continuous analysis. Teaching: Courses on modern algorithms, quantum computing, optimization theory, and spectral methods in theoretical computer science. Scientific Contributions: Developed sparsification algorithms for generalized linear models and norms with near-linear size guarantees (STOC'24, FOCS'23). Extended Cheeger-type inequalities to higher eigenvalues (STOC'12, STOC'18). Proved super-polynomial lower bounds for LP/SDP relaxations in constraint satisfaction (STOC'15, FOCS'13). Disproved Benjamini-Papasoglou conjectures on annular separators (Discrete Comp. Geom. 2024). Advanced understanding of random walks in geometric and unimodular graphs (Israel J. Math. 2023, GAFA 2023). Scientific Awards: Best Paper Award, STOC 2015
Anuj Pathania serves as an Assistant Professor in the Parallel Computing Systems (PCS) group within the Informatics Institute at the University of Amsterdam's Faculty of Science. His research pioneers sustainable computing systems operating under severe power, thermal, and reliability constraints, with significant contributions to energy-efficient hardware design and embedded systems. Education: PhD in Computer Science (2018), Karlsruhe Institute of Technology MSc in Computer Science (2012), National University of Singapore B.Tech in Computer Science (2009), Maharaja Agrasen Institute of Technology Pathania's research centers on low-power design and sustainable systems for constrained environments, with particular expertise in thermal management of 3D-stacked architectures and energy-efficient machine learning inference . His work bridges electronic design automation with real-world reliability challenges, developing novel power budgeting techniques like T-TSP that incorporate transient temperature effects ignored by conventional methods. Current projects include EU-funded initiatives on energy labeling for digital services, addressing ecological impacts through technological, behavioral, and legal frameworks. His publication trajectory reveals a strategic evolution toward zero-waste computing , with recent work (2023-2025) focusing on hardware-software co-design for edge AI, energy modeling across computing continua, and parameter-efficient neural adaptation. Key themes include thermal-aware scheduling for S-NUCA many-cores, cooperative processor utilization in heterogeneous systems, and sustainability metrics for digital services. Scientific Recognition: Best Paper Award Nomination at IEEE Computer Society Annual Symposium on VLSI 2023 for 3D-TTP power budgeting technique Pathania actively mentors 4 PhD students (Ehsan Aghapour, Saeedeh Baneshi, Sudam Wasala, Yixian Shen) and has successfully supervised 5 Master's theses (including Cum Laude defenses by Joris op ten Berg and Jurre Wolff). His research is supported by major grants including Energy Labels for Ecologically Sustainable Digital Services (2023-2024) and Towards Zero-Waste Computing (2021-2025), developing simulation frameworks like HotSniper and CoMeT for thermal analysis. The PCS group maintains strong industry collaborations with ARM and NVIDIA, particularly through tools like ARM-CO-UP for heterogeneous processor utilization.
Nikhil Bansal holds the prestigious Patrick C. Fischer Professorship of Theoretical Computer Science in the Department of Computer Science & Engineering at the University of Michigan's College of Engineering. His research program has established him as a leading figure in theoretical computer science, with significant contributions to algorithm design and analysis, particularly in discrete optimization problems. Bansal's research focuses on theoretical computer science with emphasis on design and analysis of algorithms for discrete optimization problems. His work spans multiple areas including discrepancy theory, approximation algorithms, randomized algorithms, combinatorial optimization, complexity theory, machine learning theory, and probability. He has made significant contributions to understanding the limits of approximation algorithms and developing novel techniques for combinatorial optimization problems. Analysis of Bansal's recent publications reveals a strong focus on discrepancy theory, online algorithms, and combinatorial optimization. His work often bridges theoretical computer science with discrete mathematics and probability theory. A recurring theme across his publications is the development of novel algorithmic techniques for solving NP-hard problems with provable guarantees. His research has evolved from foundational work in approximation algorithms to more recent contributions in quantum computing complexity and stochastic optimization. Patrick C. Fischer Professor of Theoretical Computer Science Bansal has advised numerous PhD students including Marek Elias, Shashwat Garg, and Greg Koumoutsous, as well as mentoring several postdoctoral researchers. He has served on editorial boards for top journals including Journal of the ACM, Theory of Computing, and Stochastic Models, and has been active on program committees for major conferences such as STOC, FOCS, SODA, and ICALP, including serving as chair for ICALP 2021. Bansal has organized multiple academic workshops including the STOC 2020 Workshop on Recent Advances in Discrepancy and Applications, several SDP Days at CWI Amsterdam, and the Semester on Bridging Continuous and Discrete Optimization at UC Berkeley in Fall 2017.
Nikhil Bansal is a Professor in Theoretical Computer Science at the University of Michigan, Ann Arbor. He earned his PhD from Carnegie Mellon University and previously worked at IBM Research, TU Eindhoven, and CWI Amsterdam. His research focuses on algorithm design, discrepancy theory, and combinatorial optimization. Education: PhD, Carnegie Mellon University Bansal's work bridges classical and quantum computing, with recent publications exploring k -Forrelation, vector balancing, and stochastic scheduling. His algorithmic approaches often combine geometric insights and probabilistic methods. Scientific Awards: Patrick C. Fischer Professor of Theoretical Computer Science NSF Career Award (2023) He has advised numerous PhD and postdoctoral researchers, including Marek Elias, Shashwat Garg, and Makrand Sinha. Bansal actively contributes to program committees (ICALP 2021, STOC 2020, FOCS 2018) and organizes workshops on discrepancy theory and optimization.
