Lecture Topics (tentative)
Mon, Aug 24— Course Intro: Tiling Problems
Reading: KT § 1.2
Wed, Aug 26— Stable Matching I: Gale-Shapley Algorithm
Reading: KT § 1.1
Fri, Aug 28— Stable Matching II: Analyzing Gale-Shapley
Reading: KT § 1.1, 2.3
Mon, Aug 31— Greedy Algorithms I: Interval Scheduling
Reading: KT § 4.1
Wed, Sep 2— Greedy Algorithms II: Optimal Prefix Codes
Reading: KT § 4.8
Fri, Sep 4— Greedy Algorithms III: Huffman's Algorithm
Reading: KT § 4.8
Wed, Sep 9— Greedy Algorithms IV: Minimum Spanning Tree
Reading: KT § 4.5
Fri, Sep 11— Dynamic Programming I: Weighted Interval Scheduling
Reading: KT § 6.1
Mon, Sep 14— Dynamic Programming II: Analysis of Weighted Interval Scheduling
Reading: KT § 6.1
Wed, Sep 16— Dynamic Programming III: Edit Distance
Reading: KT § 6.6
Fri, Sep 18— Dynamic Programming IV: Shortest Paths and the Bellman-Ford Algorithm
Reading: KT § 6.8
Mon, Sep 21— Dynamic Programming V: RNA Secondary Structure Prediction
Reading: KT § 6.5
Wed, Sep 23— Divide and Conquer I: Recurrence Relations
Reading: KT § 5.1-5.2
Fri, Sep 25— Divide and Conquer II: Integer Multiplication
Reading: KT § 5.5
Mon, Sep 28— Divide and Conquer III: Fast Fourier Transform
Reading: KT § 5.6
Wed, Sep 30—
Review for Prelim 1
Fri, Oct 2—
Divide and Conquer IV: Closest Pair of Points in the Plane
Reading: KT § 5.4
Mon, Oct 5— Divide and Conquer V: Randomized Median Finding
Reading: KT § 13.5
Wed, Oct 7— Network Flow I: Problem Definitions
Reading: KT § 7.1
Fri, Oct 9— Network Flow II: Ford-Fulkerson Algorithm
Reading: KT § 7.1
Wed, Oct 14— Network Flow III: Max-Flow Min-Cut
Reading: KT § 7.2
Fri, Oct 16— Network Flow IV: Bipartite Matching
Reading: KT § 7.5
Mon, Oct 19— Network Flow V: Project Selection
Reading: KT § 7.11
Wed, Oct 21— Network Flow VI: Circulations
Reading: KT § 7.7-7.8
Fri, Oct 23— NP-Completeness I: Independent Set and Vertex Cover
Reading: KT § 8.1
Mon, Oct 26— NP-Completeness II: SAT and 3-SAT
Reading: KT § 8.2
Wed, Oct 28— NP-Completeness III: P and NP
Reading: KT § 8.3
Fri, Oct 30— NP-Completeness IV: NP-Completeness
Reading: KT § 8.4
Mon, Nov 2— NP-Completeness V: Hamiltonian Cycle
Reading: KT § 8.5
Wed, Nov 4— NP-Completeness VI: Hamiltonian Cycle
Reading: KT § 8.5
Fri, Nov 6— NP-Completeness VII: Subset Sum
Reading: KT § 8.8
Mod, Nov 9— Cryptography I: Secret Key Cryptography
Reading: Lecture Reading Crypto Notes § 1
Wed, Nov 11— Cryptography II: Public Key Cryptography
Reading: Lecture Reading Crypto Notes § 2
Fri, Nov 13— Cryptography III: RSA
Reading: Lecture Reading Crypto Notes § 3
Mon, Nov 16— Computability I: Turing Machine Definitions
Reading: Lecture Reading Computability Notes § 1
Wed, Nov 18—
Review for Prelim 2
Fri, Nov 20—
Computability II: Computability Definitions and Universal Turing Machines
Reading: Lecture Reading Computability Notes § 2-3
Mon, Nov 23— Computability III: Undecidability
Reading: Lecture Reading Computability Notes § 4
Mon, Nov 30— Computability IV: More Undecidable Problems
Reading: Lecture Reading Computability Notes § 5-6