Glenn Sun

About Me

I'm a first-year PhD student in Computer Science at the University of Washington. My undergrad and master's were in Mathematics at UCLA. My temporary advisor is Paul Beame and my primary affiliation is with the CS Theory group, though I am frequently collaborating with the Programming Languages and Software Engineering group.

I like things that make my life (and other people's lives!) easier. My academic life so far has mostly been about math and computer science, so making life easier can manifest in a few distinct ways:

• Systems that use automated reasoning and logic to improve working efficiency and correctness, such as theorem provers and computer algebra systems for mathematicians, and code analysis and generation tools for developers.
• I also want to make mathematicians' lives easier because I like mathematics. So I definitely want to explore the theoretical limitations of such systems, such as lower bounds in particular proof systems or other questions in proof complexity, as well as develop and prove new algorithms in the above areas.
• Educational methods and tools that make learning math and CS easier are always on my mind. Although I haven't done any research in this area yet, I have been consistently applying what I read to teach grades 7–12 in various programs over the past five years.

Feel free to email me to ask about anything!

Research

1. Deterministic Graph Coloring in the Streaming Model
   Sepehr Assadi, Andrew Chen, Glenn Sun
   STOC 2022
   arXiv
   DOI
2. Visualization Equilibrium
   Paula Kayongo, Glenn Sun, Jason Hartline, Jessica Hullman
   IEEE TVCG 2022
   arXiv
   DOI

Teaching

University of Washington

• Autumn 2023: CSE 421 Introduction to Algorithms

Other

• Canada/USA Mathcamp (Summer 2024)
• UW Math Circle (current)
• AoPS Academy Bellevue (current)
• Polymath Jr. program
• UCLA Math Circle
  expand

  • Hat Puzzles and the Axiom of Choice
  • Introduction to Algorithms
  • P vs. NP
  • Intro to Quantum Computing
  • Fast Fourier Transform
  • Zero Knowledge Proofs
  • Mathematics of Juggling
  • Recurrences and Generating Functions
  • Gaussian Elimination
  • Really Big Numbers
  • Bezout's Theorem, Part 1
  • Bezout's Theorem, Part 2
• AwesomeMath Summer Program
• Program for Algorithmic and Combinatorial Thinking

Miscellaneous Writing

• Full notes for UCLA MATH 285N: Tiling Problems (Fall 2022)
• Partial notes for UCLA CS 281A: Computability and Complexity (Fall 2020)
  expand

  • Lecture 3: Universal Simulation of Turing Machines
  • Lecture 11: PH with Oracles and Introduction to Randomness
  • Lecture 12: Randomized Complexity Classes
  • Lecture 13: Sipser–Gács Theorem and Other Topics in Randomness

Last updated March 28, 2024.