I am a first-year PhD student in Computer Science at Stanford University. I am fortunate to be co-advised by Aviad Rubinstein and Moses Charikar. My CV is available here.

I 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.

**Brakensiek, J.**and Guruswami, V. Symmetric Polymorphisms and Efficient Decidability of Promise CSPs. Manuscript. (arXiv)**Brakensiek, J.**and Rubinstein, A. Constant-factor approximation of near-linear edit distance in near-linear time. Manuscript. (arXiv)**Brakensiek, J.**and Guruswami, V. Bridging between 0/1 and Linear Programming via Random Walks. STOC 2019.(arXiv)**Brakensiek, J.**, Gopi, S., and Guruswami, V. CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. STOC 2019. (ECCC)**Brakensiek, J.**and Guruswami, V. An Algorithmic Blend of LPs and Ring Equations for Promise CSPs. SODA 2019. (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 Spring 2019, I am a Course Assitant for Stanford's CS 354: Unfulfilled Algorithmic Fantasies.
- 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.

- Webmaster of theory.stanford.edu (2019-present)
- Undergraduate representative in the MCS College Council (2017-18)
- Subreviewer for the conferences ISIT 2019; ICALP 2019; FOCS 2019; ESA 2019
- Reviewer for the journals IEEE Transactions on Information Theory; Theory of Computing Systems
- Reviewer for Mathematical Reviews/Mathscinet

- 2018 NSF Graduate Research Fellowship
- 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
- 2014 Akamai Foundation Scholarship
- 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

I am a class of 2012 alumnus of the Research Science Institute.

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