Shivaram Kalyanakrishnan is an Associate Professor at the Department of Computer Science and Engineering , Indian Institute of Technology Bombay , specialising in Artificial Intelligence and Machine Learning . His research spans sequential decision making , multiagent learning , multi-armed bandits , and humanoid robotics , with applications in robot soccer , computer games , and online advertising . He teaches advanced courses like CS 747: Foundations of Intelligent and Learning Agents and CS 748: Advances in Intelligent and Learning Agents , focusing on end-to-end system design and theoretical analysis. His scientific awards include the Best Student Paper Award at RoboCup International Symposium 2006 and nomination for Best Student Paper Award at AAMAS 2007 . His work on reinforcement learning and policy iteration has been published in leading venues such as IJCAI , ICML , and COLT , with recent contributions to railway scheduling and bandit algorithms. While no explicit list of advisees is provided, his research projects and publications suggest mentorship of students in collaborative efforts. Contact : shivaram@cse.iitb.ac.in .
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.
Kamalika Chaudhuri is a Professor in the Department of Computer Science and Engineering at the University of California, San Diego (UCSD), and also serves as a Director and Research Scientist with the FAIR team at Meta AI. Her research focuses on the foundations of trustworthy machine learning, including robust machine learning, learning with privacy, and out-of-distribution generalization. Dr. Chaudhuri has earned her PhD from UC Berkeley in 2007 with a dissertation on "Learning Mixtures of Distributions." Her academic journey has led her to become a leading researcher in machine learning theory with a particular emphasis on privacy and robustness. Her research interests span machine learning foundations with a strong focus on trustworthy AI . She investigates problems at the intersection of differential privacy , adversarial robustness , and out-of-distribution generalization . Her work addresses critical challenges in developing machine learning systems that maintain privacy while preserving utility, resist adversarial attacks, and generalize effectively beyond training data distributions. She has pioneered approaches in privacy-preserving machine learning, robust learning theory, and methods for detecting and mitigating data memorization in models. An analysis of her recent publications (2024-2025) reveals a strong focus on the intersection of privacy, security, and machine learning. Her work spans differential privacy mechanisms, membership inference attacks, memorization detection, and fairness certification. She has been particularly active in developing methods for privacy-preserving foundation models, with several papers on differentially private computer vision and language models. Her research demonstrates a consistent thread of addressing fundamental challenges in trustworthy AI while developing practical solutions that balance privacy, accuracy, and utility. Best Award at the ICLR 2024 Workshop on Privacy Regulation and Protection in Machine Learning Distinguished Paper Award at IEEE Conference on Secure and Trustworthy Machine Learning (SaTML), 2024 Dr. Chaudhuri has advised numerous PhD students who have gone on to prominent positions at Google, DeepMind, Microsoft Research, and other leading AI institutions. Her group maintains an active research blog with guest posts from UCSD researchers. She has served in significant leadership roles including General Chair for ICML 2022 and Program Co-Chair for both ICML 2019 and AISTATS 2019, where she pioneered initiatives to improve reproducibility in machine learning research. Her research group at UCSD focuses on trustworthy machine learning, with current projects spanning privacy-preserving AI, robustness against adversarial attacks, and methods for ensuring reliable out-of-distribution generalization. The group collaborates closely with the FAIR team at Meta AI, where Dr. Chaudhuri serves as a Research Scientist.
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.
Henrik Sandberg is a Professor at the Division of Decision and Control Systems , KTH Royal Institute of Technology , Stockholm, Sweden. He holds the title of Deputy Head of Division and is affiliated with the School of Electrical Engineering and Computer Science . Education: MSc in Engineering Physics (1999) PhD in Automatic Control (2004) from Lund University Postdoctoral position at Caltech (pre-2007) Research Interests: Focus on cyber-physical systems security , power systems , model reduction , and fundamental limitations of control systems . Key sub-areas include attack detection , networked control , privacy-preserving estimation , and resilient control architectures . Publications: Over 150 papers across IEEE Transactions and Automatica , covering topics like stealthy attacks , distributed control , LQG optimization , and thermodynamic costs in filtering . Recent work includes LWE-based encrypted control and Bayesian deception mechanisms . Scientific Awards: Best Student Paper Award Finalist at IEEE CASE 2014; Best Student-Paper Award at IEEE CDC 2004. Grants & Projects: Leads the DYNACON project (WASP Cybersec cluster) and collaborates on CERCES (critical infrastructure resilience). Serves as examiner for multiple advanced courses in cybersecurity and control systems. Contact: Email: hsan@kth.se Phone: +46 (0)8 790 7294 Room: A:607, Malvinas Väg 10, Stockholm
Shai Ben-David is a Professor and University Research Chair at the Department of Computer Science, University of Waterloo. He is affiliated with the Cheriton School of Computer Science and can be reached at shai@uwaterloo.ca . His office is located in DC 2643. Education: Ph.D., Hebrew University, Jerusalem, Israel (1987) M.Sc., Hebrew University Jerusalem, Israel (1979) B.Sc., Hebrew University Jerusalem, Israel (1978) Research interests focus on foundational aspects of machine learning theory, including unsupervised learning (clustering), domain adaptation, fairness, interpretability, and alternative approaches to worst-case computational complexity. He also explores logic applications in computer science theory. His research trends emphasize theoretical challenges in machine learning, particularly clustering, fairness in representations, and the interplay between computational feasibility and learnability. He investigates how unlabeled data and sample compression techniques impact learning robustness and efficiency. No scientific awards are listed. His advising record shows no formal advisees listed here. Grants and funding details are not provided in the text. He has contributed to organizing events like the Dagstuhl Seminar on Foundations of Unsupervised Learning (2017) and co-edited MFCS 2016 proceedings. His work addresses both theoretical questions and practical gaps in ML implementation.
Debmalya Panigrahi is a Professor and Associate Chair in the Department of Computer Science at Duke University. He holds a PhD in Theoretical Computer Science from MIT and has prior affiliations with Microsoft Research, Bell Labs, and the Simons Institute for Theory of Computing. His research focuses on algorithms, particularly graph algorithms, algorithms under uncertainty, and learning-augmented methods. He has received NSF CAREER and other awards, and his work spans peer-reviewed publications in top venues like STOC, FOCS, and SODA. He advises PhD students and mentors postdocs, emphasizing theoretical contributions with practical applications. His teaching includes courses on approximation algorithms, graph algorithms, and discrete mathematics. Education: PhD (MIT, advised by David Karger), MSc (Indian Institute of Science, advised by Ramesh Hariharan), BSc (Jadavpur University). Research highlights include fastest algorithms for graph connectivity, learning-augmented approximation methods, and online algorithms. Funded by NSF, ARO, Google, and others. Current projects explore network reliability, hypergraph algorithms, and algorithmic fairness. His lab collaborates across theory, AI/ML, and databases at Duke. Recent Grants: NSF CCF-2006512, CCF-1618286, CCF-1350537 Labs/Teams: Duke Algorithms Lab, Theory Group, Collaborations with CS-Econ and AI/ML groups Publications span 150+ papers, with 5+ journal articles in SIAM Journal of Computing and ACM Transactions. Recent focus on integrating machine learning into classical algorithms to improve worst-case performance bounds. Advised 10+ PhD students, many now in academia (e.g., UI Chicago, UT Dallas) and industry (Google, Microsoft).
Nati Srebro is a Professor at the Toyota Technological Institute at Chicago with a cross-appointment as a Part-Time Professor in the Department of Computer Science and Committee on Computational and Applied Mathematics at the University of Chicago. He earned his PhD from MIT in 2004 and has held previous positions including post-doctoral fellow at the University of Toronto, Visiting Scientist at IBM, and Associate Professor at the Technion. Professor Srebro's research focuses on methodological, statistical and computational aspects of Machine Learning and Optimization. His work spans foundational contributions to learning theory, matrix reconstruction, and optimization techniques. He is particularly known for introducing the use of nuclear norm for machine learning, work on wider Markov networks, and advancing our understanding of the relationship between learning and optimization. His current research interests include understanding deep learning through optimization, distributed and federated learning systems, algorithmic fairness, and practical adaptive data analysis. His publication record shows consistent contributions to core machine learning conferences and workshops, with recent work focusing on symmetric and asymmetric hashing techniques, matrix parameter learning, and optimization methods. The publications demonstrate a strong theoretical foundation with practical applications across various machine learning domains. Professor Srebro has been actively involved in several research programs including the Federated and Collaborative Learning program (Spring 2026, as Visiting Scientist and Program Organizer), Modern Paradigms in Generalization (Fall 2024), and multiple summer clusters on Deep Learning Theory and Fairness. His program participation reflects his leadership in emerging areas of machine learning research. Contact: nati@ttic.edu | (773) 834-7493 | Toyota Technological Institute at Chicago, 6045 S. Kenwood Ave., Chicago, IL 60637
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.
Peihan Miao is an Assistant Professor in the Department of Computer Science at Brown University, where she is a member of the Theory Group. Her academic journey began with a BS from the ACM Honors Class at Shanghai Jiao Tong University, followed by a PhD from UC Berkeley in 2019 under the supervision of Sanjam Garg. BS: ACM Honors Class at Shanghai Jiao Tong University PhD: University of California, Berkeley (2019) Dr. Miao's research focuses on cryptography and security, with particular emphasis on bridging the gap between theoretical cryptography and practical applications, especially in the realm of secure multi-party computation. Her work spans both foundational theoretical aspects and applied systems, demonstrating a strong commitment to developing cryptographic techniques that can be implemented in real-world scenarios. She has made significant contributions to private set intersection protocols, secure computation frameworks, and cryptographic primitives that enable privacy-preserving data analysis across various domains including genomics and machine learning. Her publication record reveals a consistent focus on advancing secure computation techniques, with recent work exploring structure-aware private set intersection, updatable cryptographic protocols, and applications of cryptography to emerging domains like federated genomics. Her research demonstrates a progression from theoretical foundations toward practical implementations that address real-world privacy challenges. NSF CAREER Award Meta Research Award Google Research Scholar Award Amazon Research Award Dr. Miao actively mentors PhD students including Xinyi Shi, Phuoc Van Long Pham, and Jifeng Wang, as well as postdoc Gayathri Garimella. She serves on program committees for major cryptography conferences including Crypto, TCC, and Asiacrypt. Her teaching portfolio includes courses on applied cryptography, introduction to cryptography and computer security, and special topics in secure computation, demonstrating her commitment to educating the next generation of cryptographers. She also runs a crypto reading group at Brown University for students interested in cryptography research. As part of Brown's Theory Group, Dr. Miao collaborates with colleagues on advancing the theoretical foundations of computer science while maintaining a strong focus on practical applications of cryptographic techniques.
Piotr Indyk is the Thomas D. and Virginia W. Cabot Professor in the Department of Electrical Engineering and Computer Science (EECS) at MIT. He is co-director of the Foundations of Data Science Institute (FODSI) and a member of MIT's Theory of Computation Group, Computer Science and Artificial Intelligence Lab (CSAIL), and multiple research initiatives like Wireless@MIT and Big Data@CSAIL. Education: Magister (MA) in Computer Science, University of Warsaw (1995) Ph.D. in Computer Science, Stanford University (2000), advised by Rajeev Motwani Research Interests: Focuses on high-dimensional computational geometry, data stream algorithms, sparse recovery, compressive sensing, and machine learning. His work includes foundational contributions like locality-sensitive hashing (LSH), the Sparse Fourier Transform, and efficient similarity search algorithms. Key Contributions: Known for developing FALCONN (Fast Approximate Nearest Neighbor Search library), and for pioneering work in sub-linear algorithms, streaming algorithms, and geometric computing. Awards: ACM Paris Kanellakis Award (2012) ACM Fellow (2015) Simons Investigator (2013) Member, National Academy of Sciences (2024) Member, American Academy of Arts and Sciences (2023) Teaching & Mentorship: Advised numerous PhD/MSc students and postdocs, and taught courses on geometric computation, streaming algorithms, and algorithmic aspects of embeddings. Labs & Teams: Leads research in areas like FODSI, geometric algorithms, and data science at MIT's CSAIL.
Venkatesan Guruswami is a Chancellor's Professor in the Department of EECS and a Senior Scientist at the Simons Institute for the Theory of Computing at UC Berkeley . He also holds a Professor position in the Department of Mathematics . His academic journey began with a B.Tech in Computer Science from the Indian Institute of Technology, Madras (1997) , followed by a Ph.D. in Computer Science from the Massachusetts Institute of Technology (2001) . After a Miller Research Fellowship at UC Berkeley (2001–02), he held faculty roles at the University of Washington and Carnegie Mellon University before returning to UC Berkeley in January 2022. Education : B.Tech, IIT Madras (1997) Ph.D., MIT (2001) Professional Affiliations : Chancellor's Professor, UC Berkeley (EECS) Senior Scientist & Interim Director, Simons Institute Professor, UC Berkeley (Mathematics) Guruswami's research spans multiple domains within Theoretical Computer Science , focusing on Error-Correcting Codes , Approximation Algorithms , Randomness in Computing , Probabilistically Checkable Proofs , and Computational Complexity . His groundbreaking work in List Decoding has enabled codes with minimal redundancy for correcting worst-case errors, while recent advancements include Polar Codes , Deletion-Correcting Codes , and Constraint Satisfaction Problems . He has also contributed to Quantum Coding Theory , Locally Recoverable Codes , and Approximation Hardness in various computational contexts. His publications reflect a deep engagement with interdisciplinary topics. Key trends include: Quantum Information Theory : Quantum LDPC codes, transversal gates, and quantum storage. Algebraic Coding : Reed-Solomon codes, AG codes, and polynomial-based constructions. Computational Complexity : Hardness of approximation, CSPs, and parameterized intractability. Data Transmission : Polar codes, deletion channels, and feedback mechanisms. Algorithmic Techniques : Spectral methods, semirandom models, and Lasserre hierarchy applications. Guruswami has received numerous accolades, including the Simons Investigator Award , Presburger Award , Packard Fellowship , Sloan Research Fellowship , ACM Doctoral Dissertation Award , and the IEEE Information Theory Society Paper Award . He is an ACM Fellow (2017) and IEEE Fellow (2019) , with recent honors like the Guggenheim Fellowship (2023) and AMS Fellow (2023) . As an advisor, he has mentored over 25 PhD and postdoctoral researchers , including Atri Rudra , Prasad Raghavendra , and Peter Manohar , whose work has won awards like the Edmund M. Clarke Doctoral Dissertation Award and CRA Outstanding Undergraduate Researcher Award . His research is supported by grants from the National Science Foundation , Packard Foundation , and Sloan Foundation . He also serves as Editor-in-Chief of the Journal of the ACM and holds leadership roles in IEEE and arXiv moderation. Guruswami is actively involved in Simons Institute programs and co-organized workshops on Coded Computation and Information Theory . His work bridges theoretical advancements with practical applications in Cloud Storage , Quantum Computing , and Group Testing , including pandemic-era contributions like AC-DC: Amplification Curve Diagnostics for SARS-CoV-2 .
Artur Czumaj is a Professor in the Department of Computer Science at the University of Warwick and serves as the Director of the Centre for Discrete Mathematics and its Applications (DIMAP). He is a member of the Division of Theory and Foundations (FoCS) and holds affiliations with the Alan Turing Institute, the Warwick Data Science Institute (WDSI), and the Warwick Centre for Doctoral Training in Mathematics of Real-world Systems (MathSys). Previously, he served as Head of Department and President of the European Association for Theoretical Computer Science (EATCS) from 2020 to 2024. His research lies at the core of theoretical computer science, focusing on the design and analysis of algorithms, particularly randomized, sublinear, parallel, and distributed algorithms. His work spans graph theory, combinatorics, computational geometry, algorithmic game theory, and property testing. He has led major research initiatives funded by EPSRC, IBM, the Royal Society, and Weizmann-UK grants. The trends in his recent publications highlight a strong emphasis on sublinear algorithms, dynamic graph algorithms, and property testing, with recurring themes in randomized methods, graph processing, and efficient data structures. His work bridges foundational theory with applications in data summarization, network analysis, and computational geometry. EPSRC grants: EP/D063191/1, EP/G064679/1, EP/G069034/1, EP/J021814/1, EP/N011163/1, EP/V01305X/1, EPSRC studentship IBM Faculty Award Royal Society International Exchanges Scheme Weizmann-UK Making Connections Grants on combinatorial and algorithmic primitives and the interplay between algorithms and randomness Peter Davies received the 2020 Warwick Faculty of Science Thesis Prize under his supervision Artur Czumaj has supervised numerous PhD students, including Anna Adamaszek, Michal Adamaszek, Sam Coy, Peter Davies, Michail Fasoulakis, Jan Hladky, Wang Xin, and Hairong Zhao. His research has been supported by sustained grant funding, reflecting his leadership in theoretical computer science. He has organized major workshops at Dagstuhl, Oberwolfach, Simons Institute, and the University of Warwick, and has served on the steering committees of HALG and as PC Chair for SODA 2018 and ICALP 2020. He is actively involved in organizing key research events, including the Simons Institute Special Semester on Sublinear Algorithms (2024), the Workshop on Sublinear Graph Simplification (2024), and the Computational Complexity Conference (CCC 2023) at Warwick. He also co-organizes the Warwick-Weizmann workshops and the IGAFIT Algorithmic Postdocs Workshop, fostering international collaboration in algorithms research.
Dan Suciu is a Microsoft Endowed Professor in the Paul G. Allen School of Computer Science & Engineering at the University of Washington. His research focuses on data management, query optimization, probabilistic databases, parallel data processing, and information theory applications to databases. Awards : ACM Fellow (2011), American Academy of Arts and Sciences (2024), ACM SIGMOD Codd Innovation Award (2022), NSF Career Award (2001), Alfred P. Sloan Fellow (2001-2002). Research Trends : Recent work emphasizes cardinality estimation using Lp-norms, submodular width for query evaluation, dynamic query processing, and tensor program optimization. His publications highlight intersections between database systems and formal methods, driven by mathematical rigor. Key Collaborators : Mahmoud Abo Khamis, Dan Olteanu, Amir Shaikhha, Maximilian Schleich, Kyle Deeds, Moe Kayali. Advising : PhD students Gerome Miklau (2006), Christopher Re (2010), Paris Koutris (2016), Nilesh Dalvi (2008 runner-up), Yisu Remy Wang (2024 runner-up) have excelled in dissertation awards.
Uzi Vishkin is a Professor at the University of Maryland's Institute for Advanced Computer Studies (UMIACS) and Department of Electrical and Computer Engineering, with additional affiliation in the Department of Computer Science. His work focuses on parallel computing, including the PRAM-On-Chip vision to bridge parallel algorithms and hardware. He holds a D.Sc. from Technion (1981), M.Sc. and B.Sc. in Mathematics from Hebrew University (1975/1974). Research interests span parallel algorithms, PRAM (Parallel Random Access Machine) architecture, machine learning applications, and pattern matching. His PRAM-On-Chip project aims to create a coherent computing stack for many-core processors. Vishkin has contributed to theoretical foundations and practical implementations, including the XMT architecture and compiler. He has been recognized with ACM Fellow (1996), Highly Cited Researcher (2003), and National Academy of Inventors Fellow (2024). Awards highlight his pioneering work in parallel algorithms and computing systems. Teaching spans courses like Parallel Algorithms and Mathematical Foundations for Computer Engineering. He emphasizes parallel algorithmic thinking in education and has developed teaching materials for high school and university levels. Key projects include the XMT architecture, simulations, and tools for parallel programming. His work integrates algorithmic theory with hardware design to address programming challenges in many-core systems.
