Harry Sha
Hello! I'm a fourth-year PhD student at the University of Toronto studying CS. I'm very fortunate to be advised by Swastik Kopparty.
Research
I'm interested in theoretical CS, especially complexity theory and coding theory. As an undergrad, I also worked on psychology/neuroscience research.
-
High Rate Multivariate Polynomial Evaluation
Codes
- with Swastik Kopparty and Mrinal Kumar
- STOC 2025
-
Error-Correcting Graph Codes
- with Swastik Kopparty and Aditya Potukuchi
- ITCS 2025
- Small Shadow Partitions
- with Swastik Kopparty
- A Generalization of the Satisfiability
Coding Lemma and Its Applications
- with Milan Mossé and Li-Yang Tan
- SAT 2022
- Best paper (theory track)
-
Reappraising faces: effects on accountability
appraisals, self-reported valence, and pupil diameter
- with Jennifer Yih, Danielle E. Beam, Josef Parvizi, James J. Gross
- Cogn Emot. 2019
Teaching
I love to teach! Here is a list of my current and past instructor and TA positions.
Course Instructorships
- CSC 236: Introduction to the Theory of Computation
- Summer 2025
- Summer 2023
- Fall 2022, with Francois Pitt and Siphelele Danisa
- Summer 2022
-
CSC 373: Algorithm Design, Analysis, and Complexity
- Winter 2025, with Nathan Wiebe
- Winter 2024, with Nathan Wiebe
TAships
At U of T- CSC 463: Computability and Complexity Theory (3 times)
- CSC 236: Introduction to the Theory of Computation (2 times)
- CSC 438: Computability and Logic
- CSC 448: Formal Languages and Automata
- CS 255: Introduction to Cryptography (2 times)
- CS 103: Mathematical Foundations of Computing (2 times)
Fun
My current hobbies are running, rock climbing, guitar, and piano.