Contact: rtweber2 [at] cs [dot] washington [dot] edu
I'm on the job market! I'm looking for teaching-oriented positions.
I'm a Ph.D. candidate in the Theory Group at the Paul G. Allen School of Computer Science & Engineering at the University of Washington. I spend most of my time teaching a wide array of theory and theory-adjacent courses. My research is broadly in algorithm design for graph problems and combinatorial questions. I'm advised by Shayan Oveis Gharan and Anna Karlin.
Publications and Pre-prints
Every week the theory group has a talk where a group member describes a (hopefully) cute and interesting result over lunch. Notes from some of my talks are below. Trying to fit the contents of these notes into the 30 minute time slot is still an open problem.
In Summer 2019, I was the instructor for CSE 373 (Data Structures and Algorithms for Non-majors)
In Summer 2018, I was the instructor for CSE 332 (Data Structures and Parallelism).
I've been a TA for the following courses:
Every year, UW CSE Ph.D. students hold PoCSci (a conference on "research" that is Potentially Computer Science) and HotPoCSci (a workshop on hot topics in PoCSci). These are absolutely, totally 100% serious conferences, with definitely-real and possibly-reviewed research. They are definitely not just joke talks about grad school life given at the usual happy hour time. Slides and notes from my talks are below:
HotPoCSci 2018: A New Branch of Graph Theory
I recently started a blog. So far I just use it to try to convince everyone the probability of getting a perfect March Madness bracket is much much better than 1 in 9 quintillion.
When I'm not teaching computer science or staring at a whiteboard, I'm usually playing intramural softball or watching UW sports.