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 computation, computability theory, and computational complexity, including the P vs. NP question.

    ES 250. Information Theory

    Fundamental concepts of information theory, Entropy, Kullback-Leibler divergence, Mutual information; typical sequences and their applications, Loss-less data compression, Huffman codes, Elias Codes, Arithmetic Codes, Discrete Memory-less Channels, Channel Coding and Capacity, Differential...

    Read more about ES 250. Information Theory