# Aaron Schild

Email: aschild at berkeley dot edu
I am a fourth-year PhD student in the Theory Group at UC Berkeley. I am fortunate to be co-advised by Satish Rao and Nikhil Srivastava. My research interests lie in the theory of algorithms, especially in planar graph algorithms and algorithms using spectral graph theory.

## Upcoming and recent talks

- An almost-linear time algorithm for uniform random spanning tree generation. Stanford Theory Seminar. April 26, 2018 from 4:15pm-5:15 pm, Gates 463A. More information
- An almost-linear time algorithm for uniform random spanning tree generation. Carnegie Mellon University Theory Seminar. February 9, 2018 from 2:00pm-3:00pm, 3305 Newell-Simon Hall. More information
- Visiting CMU February 9-11, 2018.

- An almost-linear time algorithm for uniform random spanning tree generation. ARC Colloquium at Georgia Tech. February 12, 2018 from 11:00am-12:00pm, Klaus 1116 East. More information
- Visiting Georgia Tech February 12-16, 2018.

- An almost-linear time algorithm for uniform random spanning tree generation. University of Washington Theory Seminar. February 20, 2018 from 1:30pm-2:30pm, Paul Allen Center CSE503. More information
- An almost-linear time algorithm for uniform random spanning tree generation. UC Berkeley Probability Seminar. March 7, 2018 from 3:00pm-4:00pm, 1011 Evans Hall.

## Papers

An almost-linear time algorithm for uniform random spanning tree generation

Aaron Schild.

STOC 2018 **Best Student Paper**.

arXiv version

Localization of Electrical Flows

Aaron Schild, Satish Rao, and Nikhil Srivastava.

SODA 2018.

Proceedings version

arXiv version

Sandpile prediction on a tree in near linear time

Akshay Ramachandran and Aaron Schild.

SODA 2017.

Proceedings version

On Balanced Separators in Road Networks

Aaron Schild and Christian Sommer.

SEA 2015.

Proceedings version

Local version

Interdiction Problems on Planar Graphs

Feng Pan and Aaron Schild.

APPROX 2013.

Proceedings version

arXiv version