Research

Manuscripts

• Survey of Interlacing Families for Bipartite Ramanujan Graphs 

with Saachi Mutreja

Publications

• On the Parallel Complexity of Finding a Matroid Basis

with Sanjeev Khanna and Junkai Song

FOCS 2025

• Characterizing the Distinguishability of Product Distributions through Multicalibration

with Cassandra Marcussen and Salil Vadhan

CCC 2025

• A Theory of Spectral CSP Sparsification

with Sanjeev Khanna and Madhu Sudan

ICALP 2025

• Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams

with Sanjeev Khanna and Madhu Sudan

ICALP 2025

• Bivariate Linear Operator Codes 

with Vadim Zaripov

ISIT 2025

• Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms (Sanjeev's STOC talk)

with Sepehr Assadi and Sanjeev Khanna

STOC 2025

• Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification (STOC talk)

with Sanjeev Khanna and Huan Li

STOC 2025

• Efficient Algorithms and New Characterizations for CSP Sparsification (Talk at TTIC, STOC talk)

with Sanjeev Khanna and Madhu Sudan

STOC 2025

• Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval

with William Kuszmaul, Tingqiang Xu, Hangrui Zhou, and Renfei Zhou

SODA 2025

• Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers (Talk at Simons)

with Sanjeev Khanna and Madhu Sudan

FOCS 2024

• Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs

with Sanjeev Khanna and Madhu Sudan

ICALP 2024

• Code Sparsification and Its Applications (Madhu's talk at IAS)

with Sanjeev Khanna and Madhu Sudan

SODA 2024

• Pseudorandom Linear Codes are List Decodable to Capacity (Ted's video)

with Edward Pyne

ITCS 2024

• Near-Optimal Derandomization of Medium-Width Branching Programs (Video)

with Edward Pyne

STOC 2023

Machine Learning

• Pretraining for Language-Conditioned Imitation with Transformers 

with Kevin Lu, Igor Mordatch, Pieter Abbeel

NeurIPS Offline RL 2021