Ashwin Lall will talk about Estimating the Entropy of a Stream at 11am in Bell 224 on Friday, March 28. This talk is on data stream algorithms with real network data, so it should be of great interest to all of you.

Prasad Raghavendra will talk about Optimal Algorithms and Inapproximability Results for every CSP? at 10:45 am in Bell 242 on Monday, March 31. Note that both the time and location are somewhat “non-standard.” Prasad’s talk will be related to Ryan’s talk (and will hopefully shed more light on some aspects that Ryan did not have the time to talk about).

Both the speaker are grad students: as a grad student, I always found it nice/encouraging to attend talks given by grad students, so see you all there for both the talks.