1 |
Introduction
Non Adaptive Weighing |
PS1 Assigned |
2 |
Sorting Methods |
|
3 |
Finding Medians |
PS2 Assigned
PS1 Due |
4 |
Batcher's Algorithm |
|
5 |
Coding for Efficiency |
PS2 Due |
6 |
Finding Efficient Compressions; Huffman and Hu-Tucker Algorithms |
PS3 Assigned |
7 |
The Theory of Probability |
|
8 |
Coding for Error Correction: The Shannon Bound |
PS3 Due
PS4 Assigned |
9 |
Matrix Hamming Codes |
|
10 |
Polynomial Codes |
PS4 Due |
11 |
BCH Codes: Constructing them and finding the Syndrome of the Errors |
PS5 Assigned |
12 |
Correcting Errors in BCH Codes |
|
13 |
Locating Errors Using BCH Codes |
|
14 |
Some Combinatorics |
PS5 Due
Review Questions Out |
15 |
Some Counting Problems
Counting Trees |
|
16 |
First Examination |
|
17 |
Counting Problems: Inclusion Exclusion |
PS6 Assigned |
18 |
Generating Functions Fourier Transform
Finite FT |
|
19 |
FFT and Multiplying Numbers |
PS6 Due
PS7 Assigned |
20 |
More on Same
Multiplying Matrices Fast |
|
21 |
More Generating Functions |
|
22 |
Secret Codes
RSA Codes: How to Construct Them |
PS7 Due
PS8 Assigned |
23 |
RSA Codes: Finding Large Primes |
|
24 |
Breaking RSA Codes: Factoring Numbers |
PS8 Due
PS9 Assigned |
Start thinking about a Paper Topic; try to have one in one week |
25 |
Quadratic Sieve Factoring |
|
26 |
Elliptic Curve Factoring |
PS9 Due
PS10 Assigned |
27 |
Operations Research: Linear Programming |
|
28 |
The Simplex Algorithm |
|
29 |
Duality |
|
30 |
How Good is the Simplex Algorithm? |
PS10 Due |
31 |
Second Examination |
|
32 |
The Ellipsoid Algorithm and Others |
|
33 |
How Good is the Simplex Algorithm? |
|
34 |
Some Game Theory |
|
35 |
Statistical Mutterings |
|
36 |
Applications to Biology |
|
37 |
Complexity |
|
Paper Due as of this day (session #37) |
38 |
More Games |
|
39 |
Famous False Proofs |
|
Last date papers accepted: 2 weeks after session #39 |