Miscellaneous

Projects

A Graph of NP Complete Reductions
An interactive visualization of all the problems listed in Computers and Intractability: a Guide to the Theory of NP-Completeness by Gary and Johnson.

Writings and Presentations

General Adversary Bounds: a survey
Joint work with Morgan Shirley.
A survey on the results by Ben Reichardt which together show that the general adversary bound of a function characterizes its quantum query complexity.

Stoer-Wagner: a simple min-cut algorithm
An explanation of a non-standard deterministic min-cut algorithm. This was a submissions for the Summer of Mathematical Expositions (SoME) contest ran by Grant Sanderson (3Blue1Brown).

Theory Student Seminar Notes

• List Coloring in Bipartite Graphs
  Describes a result of Noga Alon for finding the lower bound on the list coloring number of bipartite graphs.
• Stein's Method: a whirlwind tour
  An overview of Stein's method, an alternate probabilistic approach to prove the Central Limit Theorem with other, more general, applications.