Relay Protocol for Approximate Byzantine Consensus. - Matthew Ding 001 (CoRR, 2020)

An Analysis of Multi-hop Iterative Approximate Byzantine Consensus with Local Communication. - Matthew Ding 001 (ISCC, 2021)

BeeGees: Stayin' Alive in Chained BFT. - Neil Giridharan; Florian Suri-Payer; Matthew Ding 001; Heidi Howard; Ittai Abraham; Natacha Crooks (PODC, 2023)

Fast and Robust State Estimation and Tracking via Hierarchical Learning. - Connor Mclaughlin; Matthew Ding 001; Deniz Edogmus; Lili Su (CoRR, 2023)

Network Fault-tolerant and Byzantine-resilient Social Learning via Collaborative Hierarchical Non-Bayesian Learning. - Connor Mclaughlin; Matthew Ding 001; Deniz Edogmus; Lili Su (CoRR, 2023)

Byzantine-Resilient Collaborative Hierarchical Non-Bayesian Learning. - Connor Mclaughlin; Matthew Ding 001; Deniz Erdogmus; Lili Su (IEEECONF, 2024)

Deterministic Minimum Steiner Cut in Maximum Flow Time. - Matthew Ding 001; Jason Li 006 (ESA, 2024)

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

Optimizing Sparse SYK. - Matthew Ding 001; Robbie King; Bobak T. Kiani; Eric R. Anschütz (CoRR, 2025)