Archive for February, 2008
Theory seminar update
Posted by: atri on February 28, 2008
Student Presentations
Posted by: atri on February 27, 2008
Please choose your paper by Monday
Posted by: Hung Q. Ngo on February 22, 2008
Steve Homer’s talk
Posted by: atri on February 22, 2008
Lecture 8: another algorithm for computing frequent items
Posted by: Hung Q. Ngo on February 16, 2008
Lecture 7: More on hot/frequent items
Posted by: Hung Q. Ngo on February 11, 2008
Lecture 6: Computing Hot/Frequent Elements
Posted by: Hung Q. Ngo on February 8, 2008
Lecture 5: Lower bounds from Communication Complexity
Posted by: atri on February 5, 2008
Ryan O’Donnell’s talk
Posted by: atri on February 4, 2008
Lecture 4: Indyk’s algorithm for F_p
Posted by: atri on February 2, 2008
