I am a postdoctoral associate in Yale University's Department of Computer Science, hosted by Dan Spielman. Before that, in spring of 2021, I completed my PhD at the Courant Institute of Mathematical Sciences at New York University, advised by Afonso Bandeira (now at ETH Zurich) and Gérard Ben Arous.
Recently, I have taught survey topics courses for graduate students on Modern Probability for Theoretical Computer Science and Sum-of-Squares Optimization. Have a look if you are interested.
Some of my current research interests include:
- Computationally-hard regimes in optimization and statistical problems;
- average-case analysis of convex relaxations of combinatorial optimization;
- pseudorandomness and derandomizing results on computational hardness and random matrix theory;
- convex optimization in proof assistants and experimental mathematics;
- discrepancy theory and its algorithmic applications.
Even longer ago, I was an undergraduate at Princeton University, where my independent work was advised by Michael Damron and John Burgess.
You can reach me at dmitriy [dot] kunisky [at] yale.edu, or in person in Office 1321 at 219 Prospect Street (Kline Tower).