Hey there! Welcome to my website.

I graduated from the University of Toronto in 2024 with a PhD in Computer Science. I was a member of the Theory Group and was fortunate enough to be supervised by Aleksandar Nikolov (Sasho). Prior to this, I graduated from Simon Fraser University with a BSc double majoring in Computer Science and Mathematics.

My research mainly focuses on discrete mathematics and optimization problems. A few of my primary interests include:

• Discrepancy Theory: This is the study of unbalance in a set system, a collection of sets on an universe of elements which can be modelled by a zero-one incidence matrix (rows represent sets, while columns represent elements). The discrepancy of a set system is the least balanced that we can make the most unbalanced set in the set system by colouring elements of the universe $\pm 1$. Variants of discrepancy (e.g., linear discrepancy) have been used to improve integer rounding problems. The Discrepancy Method: Randomness and Complexity by Bernard Chazelle and Geometric Discrepancy: An Illustrated Guide by Jiři Matoušek are great resources to get acquainted with the subject.
• Graph Partitioning: For a group of people some of whom are friends it possible to partition them into two equal parts so that everyone has as many friends in their own part as compared to the other part? No. What if we allow constantly many more friends in the other part? Yes! This is a result of Stiebitz [J. Graph Theory, 23.3 (1996), pp. 321--324]. Variants of the problem consider partitioning into many equal parts and algorithms for computing the good partitions.

Email: username [at] cs [dot] toronto [dot] edu | LinkedIn