Bots, Bureaucrats, editor
84
edits
Changes
From Theory
no edit summary
| Feb 6|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/people/ngupta12 Neal Gupta ] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-6-2015 Foundations of Clustering]
| Feb 6|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/people/ngupta12 Neal Gupta ] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-6-2015 Foundations of Clustering]
|-
|-
| Feb 13|| '''2:30-3:30 PM'''|| '''AVW3258'''|| [http://www.cs.umd.edu/~manishp Manish Purohit ] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-13-2015 Vertex Connectivity under Sampling]
| Feb 13|| '''2:30-3:30 PM'''|| '''AVW3258'''|| [http://www.cs.umd.edu/~manishp Manish Purohit ] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-13-2015 Vertex Connectivity under Sampling]
|-
| Feb 19|| '''11:00-12:00 PM'''|| '''AVW4172'''|| [http://people.csail.mit.edu/dmoshkov/ Dana Moshkovitz ] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-19-2015 Hard Problems in Hardness of Approximation: Sharp Thresholds, Parallel Repetition and Unique Games]
|-
| Feb 20|| '''11:00-12:00 PM'''|| '''CSI3117'''|| [http://scottaaronson.com/ Scott Aaronson ] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-20-2015 Exploring the limits of the Efficiently Computable]
|-
|-
| Apr 10|| 1:00-2:00 PM|| CSIC3120|| [http://www.csc.ncsu.edu/faculty/bdsullivan/ Blair Sullivan]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-10-2015 TBD]
| Apr 10|| 1:00-2:00 PM|| CSIC3120|| [http://www.csc.ncsu.edu/faculty/bdsullivan/ Blair Sullivan]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-10-2015 TBD]
