Hi! My name is Jonathan Liu, and I just graduated from UC Berkeley in June 2020, earning B.A.s in Computer Science and Mathematics.

I am currently interested in Computer Science Education, but I'm also interested in CS Theory, specifically Algorithmic Game Theory. I am currently doing research with Professor Kristin Stephens-Martinez on personalized quiz generation for a CS1 Review App, and with Professor Carlo Séquin on constructing knots with discrete components. I was also the President of UC Berkeley's Undergraduate Theory CS club.

In my free time, I play tennis and trick-taking games of all kinds (but mostly bridge).

You can reach me at liujon23 (at) berkeley (dot) edu.

These are some research papers I've written.

- "Modular Construction of Symmetrical Knots." Carlo H. Séquin, William Brandon, and Jonathan Liu. Hyperseeing: Proceedings of SMI'2019 FASE.

- "Algorithmic Discrepancy Minimization" with Michael Whitmeyer, for CS 270: Combinatorial Algorithms and Data Structures.
- "Oblivious Transfer in IP
_{2}.", for CS 294-153: Interactive Proofs and Probabilistically Checkable Proofs. - "A Survey of Complexity Results for Kostka Numbers and Kronecker and Littlewood-Richardson Coefficients" with Max Ovsiankin, for Math 249: Algebraic Combinatorics.

This is a list of reading groups I have participated in, along with notes prepared to accompany my presentations.

- "An Introduction to (Algorithmic) Game Theory" with Debayan Band.
- "Prophet Inequality."

Here are some courses I've helped teach, along with some material I made in the process. I'm also compiling some algorithms notes, which can be found here.

- Sample Problem: Proving the Existence of a Limit
- Classifying Vector Fields as Conservative
- Sample Problem: Fundamental Theorem of Line Integrals