Hi! My name is Jonathan Liu, and I am currently a PhD student at the University of Chicago, where I am fortunate enough to be advised by Professor Diana Franklin.

My work is in Computer Science Education. More specifically, I aim to mitigate technical and psychological barriers to learning Algorithms. I believe this can be done through interventions targeting the presentation of material, the teaching of core implicit skills, the course policies, and the messaging and support provided by course staff. Through these interventions, I aim to raise learning, persistence, and equity in Algorithms courses at a broad scale. I am generously supported in part by a Liew Family Graduate Fellowship.

Previously, I graduated from UC Berkeley with degrees in Math and Computer Science, where I also ran UGTCS, an undergraduate group trying to make Theory CS more accessible.

In my free time, I play tennis, solve crosswords, and play games of all kinds (especially trick-taking games).

Please feel free to reach out to me at jonliu (at) uchicago (dot) edu!

These are some research papers I've written.

- "An analysis of gallery walk peer feedback on scratch projects from bilingual/non-bilingual fourth grade students,". Jen Tsan, Chloe Butler, David Gonzalez-Maldonado, Jonathan Liu, Cathy Thomas, and Diana Franklin. (Accepted to) ICER 2023
- "Introduction to Quantum Computing for Everyone: Experience Report". Jonathan Liu, Diana Franklin. SIGCSE 2023
- "The CS1 Reviewer App: Choose Your Own Adventure or Choose for Me!" Anshul Shah, Jonathan Liu, Kristin Stephens-Martinez, and Susan H. Rodger. ITiCSE 2021.
- "Modular Construction of Symmetrical Knots." Carlo H. Séquin, William Brandon, and Jonathan Liu. Hyperseeing: Proceedings of SMI'2019 FASE.

- "Why Johnny Isn't (Switching to) Brave," for CMSC 33250: Introduction to Computer Security.
- "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.

Here are some courses I've helped teach, along with some material I made in the process.

Algorithms materials aren't public because they may be reused in future courses, but are available upon request.

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