Columbia Theory Seminar, Spring 2007
For Spring 2007, the usual time for the meetings will be Fridays
at 11:00 in the CS Conference Room (453 CS Building).
Here is a schedule of talks:
Friday, February 9, 11:00, CS Conference Room:
Fast Johnson-Lindenstrauss Transform(s)
Friday, March 2, 11:00, CS Conference Room:
Analysis of the Pollard Rho Algorithm for Discrete Logs
Friday, March 23, 11:00, Mudd 520 (note unusual place):
An Adaptive Packed-Memory Array
Tuesday, March 27, 3:00, 476 CS Building (note unusual place):
Viswanathan: Congruences for Context-Free Languages and their Applications
Friday, April 13, 11:00, CSB 476 (note unusual place):
Flow Algorithms for Two Pipelined Filtering Problems
Friday, May 4, 11:00, Interschool Lab (note unusual place):
A Cryptographic Study of Secure Internet Measurement
you want to volunteer to give a talk (especially encouraged
The talk can be about your or others' work. It can be
anything from a polished presentation of a completed result, to an
informal black-board presentation of an interesting topic where you
are stuck on some open problem. It should be accessible to a general
I will be happy to help you choose papers to talk about.
There is a mailing list for the reading group.
General information about the mailing list (including how to subscribe
yourself to it) is available
If you want to unsubscribe or change your options, send email to
with the word `help' in the subject or body (don't include the
quotes), and you will get back a message with instructions.
Comments on this page are welcome; please send them to
Last updated 2/10/2007.
Back to Theory of Computation at Columbia