Theoretical Computer Science
Overview:
Our research focuses on the theoretical foundations of computer science and related applications. Our methods frequently rely on rigorous mathematical proofs
Faculty:
Topics:
- Algorithm Design:
- Graph algorithms, parallel and distributed algorithms, cache-efficient algorithms, algorithmic game theory.
- Computational Complexity:
- Circuit lower bounds, communication complexity, hardness of approximation.
- Randomness in Computation
- Randomized algorithms, pseudorandomness, expander graphs, error-correcting codes.
- Application Areas:
- Learning theory, Cryptography, Computational Biology.
Courses:
- CS 313 Logic, Sets, and Functions
- CS 336 Analysis of Programs
- CS 341 Automata Theory
- CS 353 Theory of Computation
- CS 357 Algorithms
- CS 388H Cryptography
- CS 388P Parallel Algorithms
- CS 388G Graduate Algorithms
- CS 388C Combinatorics and Graph Theory
- CS 394C Algorithms for Computational Biology
- CS 395T Algorithmic Game Theory
- CS 395T Coding Theory
- CS 395T Learning Theory
- CS 395T Polynomials
- CS 395T Pseudorandomness
Research Groups:
- About Us
- Research
- Faculty
- Awards & Honors
- Undergraduate Program
- CS Degrees
- For Non-CS majors
- Courses
- Advising
- Undergraduate Research
- Honors Programs
- Interdisciplinary Study & Certificate Programs
- Study Abroad
- Jobs & Internships
- Scholarships
- Prospective Students
- Why Study CS?
- Where to Study Computing at UT
- K - 12: Get Started Now
- Apply to CS from High School
- Apply to Turing Scholars from High School
- Freshman Research Initiative
- Transfer to UT CS from Another University
- Transfer to CS from Another UT Major
- Apply for Admission to CS from Entry-Level CS
- Schedule a Visit
- Student Life & Organizations
- Demographics
- Alumni
- Forms
- Code of Conduct
- Graduate Program
- Giving & Collaboration
- Careers
- Outreach
- Alumni
- UTCS Direct
