Our seminar is intended to be broad and will (hopefully) cover not only what is traditionally referred to as "core theory", but also many topics at least distantly related to it. And when we are really interested in a result and/or a speaker, the employed notion of distance will be understood rather liberally!
Logistically, our normal meeting time and place is:
(refreshments are served before the seminar). But, as a courtesy to our out-of-town speakers, we expect to meet occasionally on a different day, read the announcements carefully (and sign to our mailing list if you want to receive them on a regular basis).
Current Year's Program
October 1: Travis Johnston (Universtiy of South Carolina), Connecting Turan Problems on Hypergraphs to Forbidden Subposet Problems.
October 7, 2:30pm: Yuri Gurevich (Microsoft Research), Semantics-to-syntax analyses of algorithms. Note non-standard time and day
October 8: Ravi Kannan (Microsoft Research India), Nimble Algorithms for Cloud Computing. Joint meeting with the Scientific and Statistical Computing Seminar
October 15: John Wilmes (University of Chicago), Faster Canonical Forms for Strongly Regular Graphs.
October 22: Benjamin Rossman (National Institute of Informatics, Tokyo), Formulas vs. Circuits for Small Distance Connectivity.
November 19: Shachar Lovett (University of California at San Diego), Communication is bounded by root of rank.
November 26: Daniel Reichman (Weizmann Institute), The layers model and applications.
December 10: Nikhil Srivastava (Microsoft Research Bangalore), Bipartite Ramanujan Graphs of Every Degree.