Attending the Dagstuhl Seminar on Scheduling mid-February. Is there vegan food in Germany, or will I be surviving on beer for a week?

I’ll be escaping the Seattle rain to hang out at ITA in San Diego February 5-7.

Attending my first SODA this week in Salt Lake City.
Update: Saw a ton of Buffalo way too close for comfort at Antelope Island, and the mole at Red Iguana– holy mole absolutely delicious.

Our work on the Santa Claus problem has been accepted for presentation at SODA 2020.

As of today, I’m officially a PhD Candidate! This just means I wrote a document on what I’ve been up to the past 2 years and gave a talk on it.

This week, I’ll be heading to FCRC in Phoenix.
Update: Mr. Sun was angry. Maybe I’ll go back in like the winter.

Our paper on Tree Trace Reconstruction has been accepted for presentation at COLT 2019.

This weekend I’ll be in Nebraska (for the first time) for the Nebraska Conference for Undergraduate Women in Mathematics.
Update: Why are midwesterners so much more polite than other Americans?

Heading to Baltimore this week for the AMS short course on Sum of Squares. While I’m in the city, I’ll also be visiting the theory group at Johns Hopkins for a day.

I’ve studied generalizations of the trace reconstruction problem on trees. I’m interested in exploring similar statistical reconstruction problems.

Finding perfect matchings in bipartite hypergraphs is, in general, NP-hard. However, when the edges of a hypergraph satisfy certain expansion conditions, it becomes possible to study the problem algorithmically. I’m interested in studying these sufficient conditions, specifically as they relate to allocation problems.