**
Theory Reading Group**

**Spring 2011 Reading Group Schedule**

Date | Information |

FridayAugust 26, 2011 |
Theory ReadingA constructive proof of the general Lovasz Local Lemma---Moser and Tardos Siddharth Barman 2:00 pm, 3310 CS |

FridayAugust 19, 2011 |
Theory ReadingTensor Rank: Some upper and Lower Bounds Cong Han Lim 2:00 pm, 3310 CS |

FridayMay 6, 2011 |
Theory ReadingOther Algorithms for SAT - Paturi, Pudlak, Saks, Zane (PPSZ) - An improved Exponential-time algorithm for k-SAT - Daniel Rolf - Derandomization of PPSZ for Unique-k-SAT - Timon Hertli - 3-SAT faster and simpler - Unique-sat bounds for PPSZ hold in general Dalibor Zeleny 1:30 pm, 4310 CS |

FridayApril 22, 2011 |
Theory ReadingRandom Walk Algorithms for SAT - Uwe Schoning - A Probabilistic Algorithm for k-SAT and CSPs - Moser, Scheder - A Full Derandomization of Schoning's k-SAT algorithm (STOC 2011) - Hofmeister, Schoning, Schuler, Watanabe (HSSW) - A probabilistic 3-SAT algorithm further improved - Makimo, Tamaki, Yamaoto - Derandomizing HSSW Algorithm for 3-SAT Dalibor Zeleny 3:30pm, 3310 CS |

FridayFebruary 18, 2011 |
Theory Reading
A Group-theoretic Approach to Fast Matrix Multiplication
Group-theoretic Algorithms for Matrix Multiplication.
Cong Han Lim 3:30pm, 1263 CS |

ThursdayFebruary 10, 2011 |
Theory Reading
A Group-theoretic Approach to Fast Matrix Multiplication
Group-theoretic Algorithms for Matrix Multiplication.
Cong Han Lim 5:00pm, 3310 CS |