Hello everyone, my name is Matthew. I’m currently a senior-year undergraduate studying computer science and astrophysics at the University of California, Berkeley. Welcome to my website!

I am broadly interested in theoretical computer science research. I am currently working on proving complexity results of quantum Hamiltonians. In the past I’ve worked on combinatorial graph algorithms, distributed protocols, and streaming algorithms.

Manuscripts

Optimizing Sparse SYK

Matthew Ding, Robbie King, Bobak T. Kiani, and Eric R. Anschuetz. In Submission

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. In Submission.

Fast and Robust State Estimation and Tracking via Hierarchical Learning

Connor Mclaughlin, Matthew Ding, Denis Erdogmus, and Lili Su. IEEE Transactions on Automatic Control (TAC, Conditional Acceptance).

Publications

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

Teaching Assistant

CS 70 (Discrete Mathematics and Probability Theory), University of California, Berkeley, 2024

Fall 2024 - Present

Reader

CS 70 (Discrete Mathematics and Probability Theory), University of California, Berkeley, 2023

Spring 2023 - Spring 2024

Notes

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

“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)