MATH 155r. Combinatorics

An introduction to counting techniques and other methods in finite mathematics. Possible topics include: the inclusion-exclusion principle and Mobius inversion, graph theory, generating functions, Ramsey's theorem and its variants, probabilistic methods.

CS 121. Introduction to the Theory of Computation

This course is an introduction to the theory of computation, teaching: • How to reason precisely about computation and prove mathematical theorems about its capabilities and limitations. • Models of computation. These range from weak but useful models (such as finite-state machines) to...

Read more about CS 121. Introduction to the Theory of Computation

Harvard Society of Fellows

Faculty Level Fellowships at the Radcliffe Institute

CRCS Visiting Scholar Positions

Privacy Tools Research Opportunities for Undergraduates

Undergraduate Research in Computer Science

CS 229r: Information Theory in Computer Science

Brief introduction to concepts and inequalities from Information Theory

followed by applications in computer science, in the analysis of

algorithms, communication complexity, streaming algorithms, differential

...

Read more about CS 229r: Information Theory in Computer Science

AM 106/206. Applied Algebra.

Sets, subsets, and partitions; mappings, operations, and equivalence relations; groups, rings, and fields, polynomials, encryption, computer coding, application of modular arithmetic, combinatorial designs, lattices, application of trellis representation of lattices, fast algorithms;...

Read more about AM 106/206. Applied Algebra.

CS 125. Algorithms and Complexity.

An accelerated introduction to theoretical computer science for students with strong mathematical preparation, to be taken in place of both Computer Science 121 and 124. Algorithm design methods, including graph algorithms, approximation algorithms, and randomized algorithms. Models of...

Read more about CS 125. Algorithms and Complexity.

CS 121. Introduction to the Theory of Computation

General introduction to the theory of computation, teaching how to reason precisely about computation and prove mathematical theorems about its capabilities and limitations. Finite automata, Turing machines, formal languages, computability, uncomputability, computational complexity, and...

Read more about CS 121. Introduction to the Theory of Computation

CS 222. Algorithms at the End of the Wire.

This is an advanced, rigorous course on algorithms focusing on networks, data transmission, and search engines. We learn the science that led to the founding of Google and the science behind standard compression tools. This course also covers topics in coding and data...

Read more about CS 222. Algorithms at the End of the Wire.

CS 225. Pseudorandomness.

Efficiently generating objects that ``look random'' despite being constructed using little or no randomness. Connections and applications to computational complexity, cryptography, and combinatorics. Pseudorandom generators, randomness extractors, expander graphs, error-correcting codes,...

Read more about CS 225. Pseudorandomness.

CS 229r. Proofs, Beliefs, and Algorithms through the lens of Sum of Squares

In this graduate seminar we will cover recent research on the use of mathematical programming for problems arising from optimization, machine learning, computational complexity and more, with a particular focus on the Parrilo-Lasserre "Sum of Squares" semidefinite programming hierarchy. We...

Read more about CS 229r. Proofs, Beliefs, and Algorithms through the lens of Sum of Squares

Postdoctoral Fellowships at the Institute for Applied and Computational Science (IACS)

COMPSCI 229R - Topics in Theoretical Computer Science: Coding Theory

COMPSCI 224 - Advanced Algorithms

COMPSCI 227R - Topics in Cryptography and Privacy

COMPSCI 20 - Discrete Mathematics for Computer Science

COMPSCI 124 - Data Structures and Algorithms

Pages