Here is a link to the arXiv versions of my papers.
On the zeroes of hypergraph independence polynomials Submitted. With David Galvin, Will Perkins, Mihail Sarantis, and Prasad Tetali
Superlogarithmic cliques in dense inhomogeneous random graphs SIAM Journal on Discrete Mathematics (2019)
Additionally, as an undergraduate at UC Davis (Go Ags!), I wrote a senior thesis:
A Problem in Card Shuffling Undergraduate Thesis, UC Davis (2015)
Coloring the Middle Layers of the Hamming Cube AMS Fall Western Sectional Meeting October 2022
Counting integer partitions with the method of maximum entropy Women in Combinatorics Virtual Colloquium October 2020
Super-logarithmic cliques in dense inhomogeneous random graphs PhD Seminar on Combinatorics, Games and Optimisation London School of Economics, May 2019
Counting H-free graphs for bipartite H Mathematical Congress of the Americas Montreal, Canada, July 2017
Additionally, here is the board from a "chalk talk" that I gave online for a student seminar at the University of Chile (please excuse any Spanish errors!). I gave this talk and did some online TAing at MIT while living in a rural area with unreliable internet. If you are trying to figure out how to teach/present online with shaky internet, please feel free to reach out! I did a lot of trial and error, and found a few things that worked well for me.
For a full list of presentations, see my CV.