 |
 |
 | |
What We're Reading Now |
Dixon's Books |
Today, Wed, Feb 25, 2009, at 5 pm, CEPSR 620. Troy will continue about communication complexity.
(editor's note: Please welcome Ilias Diakonikolas as Dixon's Avatar for the forseeable future.)
Hi everyone,
our first meeting will be this Wednesday (Feb 18), 2009, 3pm at CEPSR 620.
Troy lee will tell us about some recent results in communication complexity.
Ilias
Topic 11: Communication Complexity (Meetings 77/78 - )
Topic 10: Direct Product Theorems (Meetings 75/76 - 76/77)
Topic 9: Boolean Function Analysis (Meetings 68 - 74/75)
Topic 8: Arithmetic Combinatorics (Meetings 59 - 67)
Topic 7: Locally Decodable Codes and PIR (Meetings 48 - 58)
Topic 6: Natural Proofs (Meetings 41 - 47)
Topic 5: Geometric Embeddings (Meetings 34 - 40)
Topic 4: Toda's Theorem (Meetings 31 - 33)
Topic 3: The PCP Theorem and Inapproximability (Meetings 18 - 30)
Topic 2: Expander Graphs (Meetings 10 - 17)
Topic 1: Derandomization of Time (Meetings 1 - 9)