Stanford Algorithms Seminar


Next talk
Moshe Babaioff: Online Auctions, Matroids and Secretary Problems . May 13, Gates 498, 4:00pm.


Schedule for 2007-08

Date Speaker Topic Venue Time
October 16 Shahar Dobzinski The Power of VCG: On Algorithms that are Maximal In Range Gates 498 4:00pm
November 13 Andrea Montanari Reconstruction for Models on Random Graphs Gates 498 4:30pm
November 15
(joint with ISL Colloquium)		 Salil Vadhan Expander Graphs, Randomness Extractors, and List-Decodable Codes Packard 101 4:15pm
November 27 T. S. Jayram Read/Write Streams for Massive Data Sets Gates 498 4:30pm
December 11 Evdokia (Eddie) Nikolova From Shortest Paths to Quasi-Concave Minimization Gates 459 4:30pm
January 22 Ofer Neiman Local Embedding of Metric Spaces Gates 498 4:00pm
January 25 Paul Valiant Testing Symmetric Properties of Distributions Gates 498 4:00pm
January 29 Piotr Indyk Sparse Recovery Using Sparse Random Matrices Gates 498 4:00pm
March 11 Kamesh Munagala LP-duality Based Algorithms for Restless Bandit Problems Gates 498 4:00pm
April 15 Vladimir Braverman Streaming Computations on Sliding Windows Gates 498 4:00pm
April 29 Adam Meyerson Randomized K-Server on Hierarchical Binary Trees Gates 498 4:00pm
May 13 Moshe Babaioff Online Auctions, Matroids and Secretary Problems Gates 498 4:00pm

 

Founded in 1986 as the Algorithms for Lunch Bunch (AFLB), the Algorithms Seminar provides talks of general interest to the Computer Science algorithms community. Talks are usually held in Room 498 or 463A (theory lounge) in the Gates Building, near the Main Quad of Stanford's campus. The talks will usually be at 4pm on alternate Tuesdays.

If you would like to give a talk at the Stanford Algorithms Seminar, or if you have any questions, please send an email to the co-ordinators of the Algorithms Seminar, Nikola Milosavljevic and Tim Roughgarden.

Here is the procedure to subscribe or unsubscribe to the Stanford Algorithms Seminar mailing list. If you receive theory seminar/lunch emails, you are already part of the mailing list. Otherwise, you can subscribe by sending an email to aflb-extended-join@lists.stanford.edu. To unsubscribe, send an email to aflb-extended-leave@lists.stanford.edu.

Archives

This section includes abstracts for (almost) all talks ever given at AFLB and the Stanford Algorithms Seminar.