- About
- Events
- Calendar
- Graduation Information
- Cornell Learning Machines Seminar
- Student Colloquium
- BOOM
- Fall 2025 Colloquium
- Conway-Walker Lecture Series
- Salton 2025 Lecture Series
- Seminars / Lectures
- Big Red Hacks
- Cornell University / Cornell Tech - High School Programming Workshop and Contest 2025
- Game Design Initiative
- CSMore: The Rising Sophomore Summer Program in Computer Science
- Explore CS Research
- ACSU Research Night
- Cornell Junior Theorists' Workshop 2024
- People
- Courses
- Research
- Undergraduate
- M Eng
- MS
- PhD
- Admissions
- Current Students
- Computer Science Graduate Office Hours
- Advising Guide for Research Students
- Business Card Policy
- Cornell Tech
- Curricular Practical Training
- A & B Exam Scheduling Guidelines
- Fellowship Opportunities
- Field of Computer Science Ph.D. Student Handbook
- Graduate TA Handbook
- Field A Exam Summary Form
- Graduate School Forms
- Instructor / TA Application
- Ph.D. Requirements
- Ph.D. Student Financial Support
- Special Committee Selection
- Travel Funding Opportunities
- Travel Reimbursement Guide
- The Outside Minor Requirement
- Robotics Ph. D. prgram
- Diversity and Inclusion
- Graduation Information
- CS Graduate Minor
- Outreach Opportunities
- Parental Accommodation Policy
- Special Masters
- Student Spotlights
- Contact PhD Office
The theory of computing is the study of efficient computation, models of computational processes, and their limits. Research at Cornell spans all areas of the theory of computing and is responsible for the development of modern computational complexity theory, the foundations of efficient graph algorithms, and the use of applied logic and formal verification for building reliable systems. In keeping with our tradition of opening new frontiers in theory research, we have emerged in recent years as a leader in exploring the interface between computation and the social sciences.
In addition to its depth in the central areas of theory, Cornell is unique among top research departments in the fluency with which students can interact with faculty in both theoretical and applied areas, and work on problems at the critical juncture of theory and applications.
Faculty
Jayadev Acharya: Information theory, machine learning, and algorithmic statistics.
Siddhartha Banerjee: Stochastic Modeling, Design of Scalable Algorithms, Matching Markets and Social Computing, Control of Information-Flows, Learning and Recommendation.
Eshan Chattopadhyay : Randomness and Computation, Computational Complexity theory, Cryptography.
Ziv Goldfeld: Information theory, mathematical statistics, optimal transport, and statistical learning theory.
Joe Halpern: Reasoning about knowledge and uncertainty, distributed computing, causality, security, game theory.
John Hopcroft: Algorithms, information capture and access, random graphs and spectral methods.
Michael P. Kim: Foundations of responsible machine learning, algorithmic fairness, learning theory.
Bobby Kleinberg: Algorithms, game theory, learning, and networks.
Jon Kleinberg: Algorithms, social and information networks.
Dexter Kozen: Computational complexity, program logic and semantics, computational algebra.
Rafael Pass: Cryptography and its interplay with computational complexity and game theory.
Thomas Ristenpart: Cryptography, computer security, technology abuse.
David Shmoys: Approximation algorithms, computational sustainability.
Nick Spooner: Cryptography, quantum information and complexity theory. 
Karthik Sridharan: Theoretical machine learning.
Noah Stephens-Davidowitz: Theory, lattices, geometry, cryptography.
Wen Sun: Theoretical Reinforcement Learning and Machine Learning.
Eva Tardos: Algorithms, algorithmic game theory.
David Williamson: Approximation algorithms, information networks.
Christina Lee Yu: Algorithms, high dimensional statistics, sequential decision making, machine learning.
Anke van Zuylen: Algorithms, combinatorial optimization.