publications

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence

with Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, and Yinzhan Xu

[arXiv]

The Computational Complexity of Factored Graphs

with Shreya Gupta, Boyang Huang, Russell Impagliazzo, and Stanley Woo

ITCS 2025

[arXiv]

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More

with Barna Saha, Virginia Vassilevska Williams, and Yinzhan Xu

SODA 2025

[arXiv]

Replicable Uniformity Testing

with Sihan Liu

NeurIPS 2024

[arXiv]

Replicability in High Dimensional Statistics

with Max Hopkins, Russell Impagliazzo, Daniel Kane, and Sihan Liu

FOCS 2024

[arXiv]

I/O Complexity of Attention, or How Optimal is FlashAttention?

with Barna Saha

ICML 2024

Selected for Oral Presentation

[arXiv] [ICML]

On the Complexity of Algorithms with Prediction for Dynamic Graph Problems

with Monika Henzinger, Barna Saha, and Martin Seybold

ITCS 2024

[arXiv] [ITCS]

Faster Approximate All Pairs Shortest Paths

with Barna Saha

SODA 2024

[arXiv] [SODA]