| Date |
Event |
Title |
Links |
| 2015-05-01 |
Final Oral Defense |
Advances in the Computational Complexity of Holant Problems |
slides |
| 2015-01-30 |
Theory Seminar at Columbia |
Siegel's Theorem, Edge Coloring, and a Holant Dichotomy |
slides, paper |
| 2014-12-06 |
Midwest Theory Day |
Siegel's Theorem, Edge Coloring, and a Holant Dichotomy |
slides, paper |
| 2014-10-19 |
FOCS 2014 |
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems |
slides, paper, talk |
| 2014-06-19 |
SIAM DM 2014: Minisymposia on Graph Polynomials |
The Complexity of Counting Edge Colorings and a Dichotomy for Some Higher Domain Holant Problems |
slides, paper |
| 2014-05-11 |
Applied Algebra Days 2 at UWM |
Siegel's Theorem, Edge Coloring, and a Holant Dichotomy |
slides, paper |
| 2014-05-02 |
Applied Algebra Seminar at UWM |
Siegel's Theorem, Edge Coloring, and a Holant Dichotomy |
slides, paper |
| 2013-06-25 |
Preliminary Examination |
Holant, Dichotomy Theorems, and Interpolation |
slides |
| 2013-05-17 |
Tech Talk at Google-Madison |
The Complexity of Counting Problems |
slides |
| 2013-01-15 |
Dagstuhl Seminar:
Computational Counting |
The Complexity of Planar Boolean #CSP with Complex Weights |
slides, paper |
| 2012-01-10 |
ITCS 2012 |
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy |
slides, paper |
| 2011-11-13 |
Midwest Theory Day |
Gadgets and Anti-Gadgets Leading to a Complexity Dichotomy |
slides, paper |
