Find Academic Supervisors

Ricky Ini LiuView profile

Associate Professor

• Algebraic Combinatorics
• Algebraic Geometry
• Combinatorial Geometry
• +5 more

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.

• Machine Learning
• Probability
• Mathematical Physics
• +6 more

Boris Hanin is an Associate Professor at Princeton University's Department of Operations Research and Financial Engineering (ORFE) and Associated Faculty at the Program in Applied and Computational Mathematics (PACM). Prior to Princeton, he held academic positions at Texas A&M University (Assistant Professor of Mathematics), MIT (NSF Postdoctoral Fellow), and Northwestern University (PhD in Mathematics under Steve Zelditch). He works part-time at Foundry, an AI/computing startup, leading the Foundry Institute. PhD in Mathematics, Northwestern University NSF Postdoctoral Fellowship, MIT Mathematics Associate Professor, Princeton ORFE Part-Time Leader, Foundry Institute His research spans machine learning, probability theory, and mathematical physics, focusing on neural network theory (approximation power, optimization guarantees), random matrix theory, and spectral asymptotics. He has made foundational contributions to understanding gradient behavior, initialization, and infinite-width limits in deep learning. Boris has supervised numerous PhD students and postdocs, with former members securing prestigious positions at Harvard, MIT, and Huawei. He serves as Associate Editor for journals like Pure and Applied Analysis and Mathematics of Operations Research , and has taught short courses at Oxford, Luxembourg, and Tor Vergata on statistical physics of neural networks and deep learning theory. 2024 Sloan Fellowship in Mathematics NSF CAREER grant DMS-2143754 NSF grant DMS-2133806 His research group collaborates on topics including hyperparameter transfer, architecture-aware scaling, and spectral analysis of random waves and neural networks. He actively contributes to theoretical machine learning through foundational publications in venues like Probability Theory and Related Fields , Journal of Machine Learning Research , and Communications in Mathematical Physics .

Abhishek JainView profile

Associate Professor

• Cryptography
• Computer Security
• Privacy
• +5 more

Abhishek Jain is an Associate Professor in the Department of Computer Science at Johns Hopkins University and a Senior Scientist at NTT Research. He is affiliated with the Data Science and AI Institute, the Information Security Institute, and the Algorithms and Complexity group. University: Johns Hopkins University Department: Computer Science Academic Rank: Associate Professor Institutional Roles: Co-director of the Advanced Research in Cryptography group, member of the Theory Group, and co-leader of the Cryptography Group Education: Ph.D. in Computer Science from the University of California Los Angeles (2012), advised by Amit Sahai and Rafail Ostrovsky. Recipient of the Symantec Outstanding Graduate Student Award during his Ph.D. Research Interests Cryptography Secure computation Proof systems Program obfuscation Privacy Blockchain Theoretical computer science Research Trends: His recent publications emphasize cryptographic protocols for homomorphic encryption, zero-knowledge proofs, and secure multi-party computation, alongside applications in blockchain and privacy-preserving systems. Key themes include scalability, verifiable evaluation, and adapting cryptographic techniques to dynamic and distributed environments. Scientific Awards 2020 NSF CAREER Award Best Paper Awards at Eurocrypt and the International Conference on the Theory and Applications of Cryptographic Techniques Advising & Grants: Mentors Ph.D. students and interns/postdocs at NTT Research. Research funded by NSF, DARPA, JP Morgan, Ethereum Foundation, Stellar, Cisco, Samsung, and JHU Catalyst awards. Labs & Teams: Co-leads the Cryptography Group at Johns Hopkins, participates in the DC Area Crypto Day, and organizes the weekly Theory Seminar. Collaborates with institutions including MIT CSAIL, BUSEC, and Microsoft Research New England.

Michael KaessView profile

Associate Professor

• Robotics
• Computer Vision
• SLAM (Simultaneous Localization and Mapping)
• +6 more

Michael Kaess is an Associate Professor at the Robotics Institute, Carnegie Mellon University (CMU), within the School of Computer Science. He leads the Robot Perception Lab (RPL) and contributes to the Field Robotics Center (FRC) and Computer Vision Group (CV). His research focuses on efficient perception algorithms for mobile robots, particularly in 3D mapping, SLAM, and sensor fusion using vision, LiDAR, inertial, and sonar data. Kaess holds a PhD in Computer Science from Georgia Tech and was a postdoc at MIT's Marine Robotics Lab. Education: Georgia Institute of Technology, PhD in Computer Science (2008) MIT, Postdoctoral Associate (2008–2010) Research Interests: Kaess develops algorithms for robust and efficient inference in robotics, emphasizing factor graphs and linear algebra. His work spans underwater robotics, aerial systems, tactile SLAM, and multi-sensor integration. Key areas include SLAM with planes/lines, imaging sonar reconstruction, and neural field methods for LiDAR-visual fusion. Publications: Over 145 papers, including work on EDPLVO (visual odometry), HoloOcean (underwater simulation), and neural radiance fields with LiDAR. Recent trends focus on robust incremental smoothing, acoustic-optical fusion, and real-time volumetric mapping. Awards: Recognized with the RSS Test of Time Award (2020), Outstanding Associate Editor (2022), and paper awards at ICRA/ICRA. Active in conference organization (IROS/ICRA program committees). Advising & Grants: Supervises 10+ current PhD/MSc students, with past advisees contributing to CoRL/ICRA work. Manages grants in perception, autonomy, and marine robotics. Teaches courses like Robot Localization and Mapping (16-833). Labs/Teams: Directs RPL, collaborates with FRC on field robotics. Develops open-source tools like GTSAM (GNU Toolkit for Smoothing and Mapping).

Amitabha BagchiView profile

Professor

• Data Algorithmics
• Probability and Networks
• Theoretical Computer Science
• +7 more

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.

Huan ZhangView profile

Assistant Professor

• Trustworthy Machine Learning
• Formal Verification of Machine Learning
• AI Safety
• +4 more

Huan Zhang serves as an Assistant Professor in the Department of Electrical and Computer Engineering at the University of Illinois Urbana-Champaign (UIUC), with affiliate appointments in the Department of Computer Science and the Coordinated Science Laboratory. His research focuses on building trustworthy AI systems with formal verification techniques to provide provable guarantees for safety-critical applications, particularly in machine learning and neural networks. Dr. Zhang received his Ph.D. in Computer Science from UCLA in 2020, advised by Professor Cho-Jui Hsieh. His academic journey includes an M.S. in Computer Engineering from UC Davis (2014) and a Bachelor of Engineering from Zhejiang University (2012). Prior to joining UIUC, he completed a postdoctoral fellowship at Carnegie Mellon University (2021-2023) with Professor Zico Kolter. Huan Zhang's research program centers on formal verification of machine learning systems, with particular emphasis on neural network verification, AI safety, robustness, and reliability. He pioneered the linear bound propagation-based verification framework that enables formal verification for networks with millions of neurons. His work spans five major research categories: formal verification of machine learning, training trustworthy ML models, machine learning safety and adversarial attacks, reinforcement learning safety, and optimization for scalable machine learning. His CROWN framework (NeurIPS 2018) established a foundational approach for neural network verification through efficient linear bound propagation. His recent publications demonstrate a strategic expansion from foundational verification techniques toward increasingly complex systems including large language models, vision-language models, and robotic control systems. The research trajectory shows a clear progression from theoretical frameworks to practical implementations with real-world applications, particularly in safety-critical domains. His work increasingly bridges formal methods with practical AI deployment requirements. Winner of International Verification of Neural Networks Competition (VNN-COMP) as team leader (2021-2024) Schmidt Futures AI2050 Early Career Fellowship ($300,000 research grant) Adversarial Machine Learning (AdvML) Rising Star Award (2021) IBM PhD Fellowship (2018) Dr. Zhang leads the development of α,β-CROWN, a neural network verifier that has won VNN-COMP 2021-2023, and auto_LiRPA, a PyTorch-based library for perturbation analysis on general computational graphs. He has mentored numerous graduate students from CMU, UCLA, UIUC, and Columbia University. His research is supported by significant funding including the Schmidt Futures fellowship and industry collaborations. He teaches courses including ECE 120, ECE 484, ECE 584, and ECE 598 HZ on topics ranging from computing fundamentals to safe autonomy and machine learning. Dr. Zhang maintains active research collaborations across multiple institutions and is affiliated with UIUC's Coordinated Science Laboratory. His work has significant implications for safety-critical AI applications in autonomous systems, healthcare, and other mission-critical domains where reliability guarantees are essential. He regularly gives guest lectures at institutions including Yale, Stony Brook, and the University of Nebraska Lincoln on formal verification techniques.

David B. ShmoysView profile

Professor

• Operations Research
• Computer Science
• Optimization
• +4 more

David B. Shmoys is the Laibe/Acheson Professor of Business Management & Leadership Studies at Cornell University's School of Operations Research and Information Engineering (ORIE) and holds a joint appointment in the Department of Computer Science. He is a leading researcher in approximation algorithms, stochastic optimization, and computational sustainability. His work emphasizes data-driven decision-making in enterprise and society, with applications ranging from healthcare logistics to environmental conservation. Shmoys has advised 27 Ph.D. students and served as an editorial board member for top journals like Operations Research and Mathematics of Operations Research. Education: Ph.D. in Computer Science, University of California, Berkeley (1984). Postdoctoral positions at MSRI and Harvard University, followed by faculty roles at MIT before joining Cornell. Research Interests: Design and analysis of approximation algorithms for NP-hard problems, stochastic optimization, scheduling, facility location, and inventory management. Applications include computational sustainability, epidemiological modeling, and political districting optimization. Articles Trends: Focus on optimization under uncertainty, computational sustainability, and real-world applications like air ambulance routing, bike-sharing systems, and gerrymandering analysis. Notable works include the 2018 Wagner Prize-winning paper on bike-sharing analytics and the 2013 Lanchester Prize-winning textbook on approximation algorithms. Awards: Lanchester Prize (2013), Daniel H. Wagner Prize (2018), Fellowships from ACM, INFORMS, and SIAM, NSF Presidential Young Investigator (1987). Advising & Grants: Over 27 advised Ph.D. students, with former students at MIT, Waterloo, Brown, and D-Wave. Active in grants related to data science and sustainability. Labs/Teams: Involved in the Institute of Computational Sustainability at Cornell, focusing on applying algorithms to environmental challenges. Collaborates with organizations like Motivate (bike-sharing) and Ornge (air ambulance services).

• Mathematics of Data
• Numerical Linear Algebra
• Randomized Algorithms
• +5 more

Liza Rebrova is an Assistant Professor in the Department of Operations Research and Financial Engineering (ORFE) at Princeton University's School of Engineering and Applied Science. She is also an associated faculty member of the Program in Applied and Computational Mathematics (PACM) and the Center for Statistics and Machine Learning (CSML). Her research focuses on randomized numerical linear algebra and the mathematics of data science, with connections to high-dimensional probability and stochastic optimization. She develops mathematically justified randomized algorithms for large-scale data, particularly interested in settings where data exhibits mathematical structure such as spectral decay, multi-modality, or non-negativity. Her work addresses challenges in data compression, recovery, and optimization under structured noise conditions. Dr. Rebrova's recent publications show a strong trend toward developing robust algorithms for linear systems, tensor data compression, and nonnegative matrix factorization. Her work bridges theoretical foundations with practical applications in machine learning and data science, with emphasis on memory efficiency and handling corrupted or incomplete data. NSF DMS-2309685 (Single PI, 2024-2026): "Outliers are not what they seem: data-aware, flexible, and robust randomized iterative methods" NSF DMS-2108479 (Collaborative, 2022-2024): "Fast, Low-Memory Embeddings for Tensor Data with Applications" (co-PIs Mark Iwen and Deanna Needell) She currently advises three PhD students (Jackie Lok, Shambhavi Suryanarayanan, and Sofiia Shvaiko) and has previously advised Abraar Chaudhry (PhD 2024) and Nicolo Grometto (Masters thesis 2023). At Princeton, she teaches graduate courses including ORF526 (Graduate Probability), ORF387 (Networks), and ORF523 (Convex and Conic Optimization).

• Semiconductor Physics
• Gallium Nitride (GaN) Electronics
• Two-Dimensional Materials
• +6 more

Tomas Palacios is a Professor of Electrical Engineering at the Massachusetts Institute of Technology (MIT) , where he directs the Center for Graphene Devices and 2D Systems and leads the Microsystems Technology Laboratories (MTL). His research focuses on pushing the boundaries of microelectronics through novel semiconductor materials and device architectures, including Gallium Nitride (GaN) and 2D materials like graphene and molybdenum disulfide (MoS2). Professor, MIT Electrical Engineering and Computer Science Director, MIT Center for Graphene Devices and 2D Systems Clarence J. LeBel Professor, MIT Faculty Director, Northeast Microelectronics Internship Program (NMIP) Research Interests span multiple cutting-edge domains: High-frequency electronics (>300 GHz) for 6G and quantum applications High-voltage power devices (600V–10kV) for energy conversion Post-silicon logic devices using 2D materials High-temperature electronics (e.g., Venus rover applications) Distributed neural networks on large-area 2D materials Graphene-based biosensors and chemical detection systems Scientific Contributions include: Double recipient of the IEEE George Smith Award for groundbreaking GaN transistor work Co-invented first MoS2 electronic circuits Developed world’s first Wi-Fi-to-electricity conversion antenna Led MIT’s Microsystems Technology Laboratories since 2021 Advising Philosophy emphasizes cross-layer expertise, with students gaining experience from materials synthesis to system-level prototyping. His lab has incubated startups like Vertical Horizons , focused on GaN power devices for AI and EVs.

Trevor CampbellView profile

Associate Professor

• Bayesian Inference
• Bayesian Nonparametrics
• Machine Learning
• +5 more

Trevor Campbell is an Associate Professor in the Department of Statistics at the University of British Columbia (UBC), Vancouver. He holds a Ph.D. in Machine Learning and Statistics from MIT and a B.A.Sc. in Aerospace Engineering from the University of Toronto. His research focuses on automated, scalable Bayesian inference algorithms, Bayesian nonparametrics, and streaming data analysis. Campbell is a core contributor to probabilistic programming tools like Pigeons.jl and has developed influential methods for coreset-based Bayesian inference. Education : Ph.D. in Machine Learning and Statistics (2016), MIT M.S. in Aeronautics and Astronautics (2013), MIT B.A.Sc. in Aerospace Engineering (2011), University of Toronto Research Interests : His work emphasizes scalable Bayesian computation, including variational inference, MCMC optimization, and coresets. He develops algorithms that balance statistical accuracy with computational efficiency, particularly for large-scale datasets. His recent work explores adaptive samplers (e.g., AutoStep, autoMALA) and theoretical guarantees for coreset methods. Applications span astrophysics, materials science, and network analysis. Awards & Grants : NSERC Discovery Grant (2025) Blackwell-Rosenbluth Award (2021) PIMS Early Career Award (2023) Google Perception Academic Funding (2020) Advising & Labs : He supervises a team of PhD and M.Sc. students at UBC, focusing on Bayesian methodology and computational tools. His lab collaborates with institutions like SFU and MIT on projects involving distributed sampling and probabilistic modeling. He co-organizes workshops on Bayesian computation and serves on editorial boards for Bayesian Analysis and TMLR.

• Operations Research
• Machine Learning
• Optimization under Uncertainty
• +4 more

Minseok Ryu is an Assistant Professor at the School of Computing and Augmented Intelligence, Arizona State University (ASU). He holds a Ph.D. in Industrial & Operations Engineering from the University of Michigan (2020). Prior to ASU, he was a postdoctoral appointee at Argonne National Laboratory’s Mathematics and Computer Science Division. His research focuses on optimization methodologies for decentralized and stochastic decision-making distributed algorithms for machine learning and operations research applications in healthcare systems and energy grids Teaching responsibilities include courses on applied deterministic operations research (IEE 574), optimization (IEE 622), and research practicums (IEE 792). His work emphasizes computational challenges in decision-making under uncertainty, with recent projects addressing nurse staffing optimization, federated learning frameworks (e.g., APPFL/APPFLX), and resilient power grid systems. He has no recorded academic awards but actively contributes to open-source software and cross-disciplinary research collaborations. Research interests bridge theory and practice, targeting social goods through optimization techniques like distributionally robust optimization, federated learning, and heuristic algorithms for energy and healthcare systems.

Priyanka RainaView profile

Assistant Professor

• Domain-Specific Architectures
• Hardware/Software Co-design
• Energy-Efficient Computing
• +3 more

Priyanka Raina is an Assistant Professor of Electrical Engineering at Stanford University, with a courtesy appointment in Computer Science. She leads the Stanford Accelerate research group, focusing on domain-specific hardware architectures and agile hardware-software co-design. Her work emphasizes high-performance, energy-efficient accelerators for emerging technologies. Education: B.Tech. from IIT Delhi (2011), M.S. and Ph.D. from MIT (2013/2018). Postdoctoral experience includes NVIDIA Research (2018) and Amazon Visiting Academic (2023–present). Awards include the Sloan Research Fellowship (2024), NSF CAREER Award (2023), and Terman Faculty Fellowship (2018). Research Interests: Domain-specific architectures, near-memory computing, design productivity, and machine learning acceleration. Her group develops frameworks like AHA (Agile Hardware) for efficient accelerator design and compilers. Awards: Over 10 major awards, including best paper recognitions at VLSI, MICRO, and JSSC. Active roles as Associate Editor for IEEE JSSC and Program Chair for IEEE Hot Chips (2020). Advising & Teaching: Supervises multiple PhD and MS students in hardware design, CGRAs, and ML accelerators. Teaches VLSI design courses (EE271/272/372) and oversees independent studies in embedded systems and chip design. Labs & Collaborations: Affiliated with Stanford PORTAL Center, AHA Center, and SystemX Alliance. Projects include MINOTAUR (edge AI accelerator), Amber (CGRA-based SoC), and EMBER (RRAM macros).

• Graph Algorithms
• Optimization
• High-Dimensional Geometry
• +3 more

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.

Florentina BuneaView profile

Professor

• Statistical machine learning theory
• High-dimensional statistical inference
• Optimal transport
• +6 more

Florentina Bunea is a Professor in the Department of Statistics and Data Science at Cornell University’s Bowers College of Computing and Information Science, and an active member of the Graduate Fields of Statistics, Applied Mathematics, and Computer Science. She also serves on the Diversity and Inclusion Council of her college, championing workforce diversity in data-science disciplines. Education & Institutional Roles Professor, Department of Statistics and Data Science, Cornell University Member, Graduate Fields of Statistics, Applied Mathematics, Computer Science Member, Diversity and Inclusion Council, Bowers College of Computing and Information Science Research Interests Professor Bunea’s research lies at the intersection of statistical machine-learning theory and high-dimensional inference. She develops rigorous methodology supported by sharp theoretical guarantees to tackle core problems in modern data science. Recent themes include: Soft-max mixtures for understanding large-language-model/AI algorithms Optimal transport for high-dimensional mixture distributions Wasserstein-distance inference for sparse mixing measures in topic models Latent-space clustering and cluster-based inference in high dimensions Network modeling and hidden-structure inference Applications spanning genetics, systems immunology, neuroscience, sociology, and economics Research Funding & Awards Her work is supported by grants from the National Science Foundation (NSF-DMS). She is a Fellow of the Institute of Mathematical Statistics and a recipient of the IMS Medallion Award. Editorial & Service Contributions Associate Editor: Annals of Statistics, Bernoulli, JASA, JRSS-B, EJS, Annals of Applied Statistics Co-Editor: Chapman & Hall/CRC Statistics and Applied Probability Monograph Series Advising & Collaboration Professor Bunea has mentored numerous doctoral and post-doctoral researchers, including Xin Bing, Shuyu Liu, Seth Strimas-Mackey, and Yang Ning, among others. Collaborative projects extend across Cornell and external institutions, producing widely-used software packages and high-impact publications. Contact Office: 1184 Comstock Hall, Cornell University Email: fb238@cornell.edu Phone: (607) 255-8449

Daniel Dominic Kaplan SleatorView profile

Professor

• Algorithms
• Data Structures
• Theoretical Computer Science
• +5 more

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.