The meetings have various forms: talks on recently completed results, joint reading of an interesting paper, presentations of current work in progress and exciting open problems, etc.
| TIME | SPEAKER | TITLE |
| January 21, Wednesday | Benoit Hudson | Cajun SODA |
| January 28, Wednesday | Adam Wierman | A Unified Framework For Modeling TCP Variants |
| February 4, Wednesday | Jason Hartline | On Seller Optimal Envy-Free Pricing |
| February 11, Wednesday | Ke Yang | Fairness Computation |
| February 18, Wednesday | Adi Shamir | A New Class of Stream Ciphers |
| February 25, Wednesday | Shuchi Chawla | Approximation Algorithms for Clustering and Path-Planning Problems |
| March 3, Wednesday | Hubert Chan | Approximating the Cut Norm of a Real Matrix |
| March 10, Wednesday | ||
| March 17, Wednesday | Nick Hopper | How to reveal a secret crush, negotiate a bribe, and more... |
| March 24, Wednesday | Maria Florina Balcan | Approximating Kernels with Low-Dimensional Projections |
| March 31, Wednesday | Nick Hopper | A Theory of Steganography |
| April 7, Wednesday | Yiannis Koutis | Three theorems in spectral graph theory |
| April 14, Wednesday | ||
| April 21, Wednesday | Peter Richter | Lower Bounds for Graph Embeddings and Combinatorial Preconditioners |
| April 28, Wednesday | Shuchi Chawla | From Idiosyncratic to Stereotypical: Toward Privacy in Public Databases |
| May 5, Wednesday | Andris Ambainis | Quantum walks and their applications in quantum algorithms |
| maintained by Luis von Ahn (biglou@cs.cmu.edu) |