I am joining Stanford University in Fall 2018 as a PhD student in Computer Science, supported by an NSF Graduate Research Fellowship. I recently graduated from Carnegie Mellon University with a B.S. and M.S. in Mathematical Sciences with a minor in Science, Technology and Society as a Knaster-McWilliams Scholar. While there, my advisor in the Honors Program was the truly excellent Venkatesan Guruswami. My CV is available here.

Since Fall 2014, I have been working with Venkatesan Guruswami in various areas of theoretical computer science, including coding theory and hardness of approximation. Most recently, we have been interested in the construction of algorithms inspired by the universal algebraic structure of constraint satisfaction problems and variants.

Since Spring 2017, I have also been a member of Keenan Crane's Geometry Collective.

**Brakensiek, J.**and Guruswami, V. Interpolating Integer and Linear Programs via Random Walks. Manuscript.**Brakensiek, J.**and Guruswami, V. Combining LPs and Ring Equations via Structured Polymorphisms. Manuscript. (ECCC)**Brakensiek, J.**and Guruswami, V. Promise Constraint Satisfaction: Algebraic Structure and a Symmetric Boolean Dichotomy. SODA 2018. (arXiv)**Brakensiek, J.**and Guruswami, V. A Family of Dictatorship Tests with Perfect Completeness for 2–to–2 Label Cover. Manuscript. (ECCC)**Brakensiek, J.**, Guruswami, V., and Zbarsky, S. Efficient Low-Redundancy Codes for Correcting Multiple Deletions. IEEE Transactions on Information Theory, 2017. (Conference version: SODA 2016.) (arXiv)**Brakensiek, J.**and Guruswami, V. The Quest for Strong Inapproximability Results with Perfect Completeness. APPROX 2017. (ECCC)**Brakensiek, J.**Vertex isoperimetry and independent set stability for tensor powers of cliques. RANDOM 2017. (arXiv)**Brakensiek, J.**and Guruswami, V. New Hardness Results for Graph and Hypergraph Colorings. CCC 2016. (ECCC)**Brakensiek, J**and Ragozzine, D. Efficient Geometric Probabilities of Multi-Transiting Exoplanetary Systems from CORBITS. The Astrophysical Journal, 2016, 821, 47. (arXiv, code on GitHub)**Brakensiek, J.**and Potechin, A. Bounds on the Size of Sound Monotone Switching Networks Accepting Permutation Sets of Directed Trees. Manuscript. (arXiv)

- In Fall 2017, I was a Teaching Assistant for the CMU course 15-458/858B: Discrete Differential Geometry taught by Keenan Crane.
- I was a grader at the 2017 Math Olympiad Program directed by Po-Shen Loh. While there, I led a problem session on coding theory.
- From 2014-17, I have helped grade the Team Selection Tests which decide the USA team for the International Mathematical Olympiad.

- Undergraduate representative in the MCS College Council (2017-18)
- Reviewer for Mathematical Reviews/Mathscinet
- Reviewer for the journals IEEE Transactions on Information Theory; Theory of Computing Systems

- 2018 Computing Research Association Outstanding Undergraduate Research Award
- 2017 Phi Beta Kappa
- 2016 Putnam Fellow (top 5 out of over 4000 students) and first place team
- 2016 Goldwater Scholar
- 2013 Davidson Fellow

- 2-time Gold medalist: 2013/2014 International Olympiad in Informatics
- Silver medalist: 2014 International Mathematical Olympiad
- Samuel L. Greitzer/Murray S. Klamkin Award for Mathematical Excellence: Sole perfect scorer on the 2014 USA Mathematical Olympiad

The following photograph I took of Chandler-Gilbert Community College in Arizona appears in the Mathematical Association of America's 100th anniversary calendar: