Hello everyone, my name is Matthew. I am an incoming Ph.D. student in computer science at Stanford University starting in Fall 2025. Welcome to my website!

I am broadly interested in theoretical computer science and quantum information theory. In the past I’ve worked on combinatorial graph algorithms, distributed protocols, and streaming algorithms.

I received my B.A. in computer science and astrophysics at the University of California, Berkeley. During my undergraduate years, I was fortunate to be advised by Jason Li, Jelani Nelson, and John Preskill, among many others.

Manuscripts

Optimizing Sparse SYK
Matthew Ding, Robbie King, Bobak T. Kiani, and Eric R. Anschuetz. In submission.

Publications

Space Complexity of Minimum Cut Problems in Single-Pass Streams
Matthew Ding, Alexandro Garces, Jason Li, Honghao Lin, Jelani Nelson, Vihan Shah, and David P. Woodruff. Innovations in Theoretical Computer Science (ITCS 2025).

Deterministic Minimum Steiner Cut in Maximum Flow Time
Matthew Ding and Jason Li. European Symposium on Algorithms (ESA 2024).

BeeGees: Stayin’ Alive in Chained BFT
Neil Giridharan, Florian Suri-Payer, Matthew Ding, Heidi Howard, Ittai Abraham, and Natacha Crooks. ACM Symposium on Principles of Distributed Computing (PODC 2023).

Teaching Experience

Teaching Assistant
EECS 126: Probability and Random Processes (UC Berkeley, Spring 2025)

Teaching Assistant
CS 70: Discrete Mathematics and Probability Theory (UC Berkeley, Fall 2024)

Notes

Lecture 24 Notes: The Sensitivity Conjecture
CS 294-92: Analysis of Boolean Functions (UC Berkeley, Spring 2025)

Lecture 12 Notes: Linear probing with 5-wise independence, symmetrization, approximate membership
CS 270: Combinatorial Algorithms and Data Structures (UC Berkeley, Spring 2023)

“We shall not cease from exploration. And the end of all our exploring will be to arrive where we started and know the place for the first time.”

—T.S. Eliot, from “Little Gidding”, Four Quartets (1943)