Ziyang Jin

 

 

Hi there, welcome to my homepage!

I am a second year Ph.D. student studying theoretical computer science (TCS) at the University of Toronto, where I am very fortunate to be supervised by Akshayaram Srinivasan to work on exciting topics in cryptography. Previously, I completed my M.Sc. in computer science also at UofT, under great supervision of Mike Molloy in graph theory. Before that, I worked as a software enigneer at Amazon. A few years ago, I obtained a B.Sc. in computer science at The University of British Columbia (UBC) [1], where I was inspired by Will Evans and Nick Harvey to study theoretical computer science. Feel free to drop me an email for your great research ideas, or just say hi to me.

More specifically, my research interest lies in:

I also like combinatorial algorithms, game theory, complexity theory, and coding theory. I am also interested in applying cryptography in real-world applications.

Email: [all-lower-case-first-name] [at] cs [dot] toronto [dot] edu | LinkedIn | GitHub

For incoming theory students (2025 Fall), we have a Discord server for theory students, feel free to email me so I send you the invitation link.

Research

Thesis

  1. [Master's Thesis] Frugal Colouring of Graphs with Girth At Least Five
    • We proved that for any graph with girth at least five and maximum degree d, there exists a (1+o(1))(d / ln d)-colouring such that for every vertex v, no colour appears more than polylog(d) times in the neighbourhood of v. Our work employs a technique called the semi-random method (a.k.a. the Rödl Nibble) and bases on the proof in [Kim95] for bounding the chromatic number of girth five graphs. We use a non-trivial lopsided Lovász Local Lemma to complete the colouring.

Selected Talks

Date Institute Event Title
2025-02-27   University of Toronto Theory Student Seminar Polishchuk-Spielman Bivariate Testing and An Application [PS94]
2025-01-17   University of Toronto Crypto Reading Group SNARGs under LWE via propositional proofs [JKLV24]
2025-01-10   University of Toronto Crypto Reading Group Universal SNARGs for NP from Proofs of Correctness [JKLM24]
2024-06-13   University of Toronto Theory Reading Group   Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method [BKR23]
2024-01-24   University of Toronto Theory Student Seminar   Frugal Colouring of Graphs with Girth At Least Five
2023-10-11   University of Toronto Theory Student Seminar   Graph Colouring and the Rödl Nibble
2023-04-26   University of Toronto Theory Student Seminar   The Probabilistic Method and Entropy Compression

Unpublished Write-ups

2024   Non-Interactive Zero-Knowledge Proof of 3-Colouring   Notes
2024   Doubly Efficient Proof Systems [GKR08]   Notes and Slides
2023   Entropy Compression and Frugal Colouring   Notes
2022   The Puzzle Toad No. 39   Our solution

Academic Services

Teaching

University of Toronto
Term Role Course Code Title
2025 Winter Lead TA CSC 165 Mathematical Expression and Reasoning for Computer Science
2025 Winter TA CSC 263 (UTM) Data Structures and Analysis
2024 Fall TA CSC WDI (UTM) Writing Development Initiative for CSC207, CSC258, CSC236, CSC373
2024 Fall TA CSC 263 Data Structures and Analysis
2024 Winter TA CSC 310 Information Theory
2024 Winter Lead TA CSC 373 Algorithm Design, Analysis, and Complexity
2023 Fall Instructor [3] CSC 236 Introduction to the Theory of Computation
2023 Summer Prep TA [4] CSC 240 Enriched Introduction to the Theory of Computation
2023 Summer TA CSC C63 (UTSC) Computability and Computational Complexity
2023 Winter Instructor [3] CSC 373 Algorithm Design, Analysis, and Complexity
The University of British Columbia
Term Role Course Code Title
2019 Winter TA CPSC 320 Intermediate Algorithm Design and Analysis
2018 Fall TA CPSC 311 Definition of Programming Languages
2018 Winter TA CPSC 313 Computer Hardware and Operating Systems
2016 Summer & Fall TA CPSC 221 Basic Algorithms and Data Structures
2015 Summer & Fall, 2016 Winter TA CPSC 121 Models of Computation

Volunteer

Miscellaneous


Footnotes


© 2024-2025 Ziyang Jin. All rights reserved.