Near-Optimal Derandomization of Medium-Width Branching Programs. - Aaron (Louie) Putterman; Edward Pyne (Electron. Colloquium Comput. Complex., 2022)

Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. - Sanjeev Khanna; Aaron Putterman; Madhu Sudan 001 (FOCS, 2024)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. - Sanjeev Khanna; Aaron (Louie) Putterman; Madhu Sudan 001 (ICALP, 2024)

Pseudorandom Linear Codes Are List-Decodable to Capacity. - Aaron (Louie) Putterman; Edward Pyne (ITCS, 2024)

Code Sparsification and its Applications. - Sanjeev Khanna; Aaron (Louie) Putterman; Madhu Sudan 001 (SODA, 2024)

Characterizations of Sparsifiability for Affine CSPs and Symmetric CSPs. - Sanjeev Khanna; Aaron (Louie) Putterman; Madhu Sudan 001 (CoRR, 2024)

Bivariate Linear Operator Codes. - Aaron (Louie) Putterman; Vadim Zaripov (CoRR, 2024)

Characterizing the Distinguishability of Product Distributions Through Multicalibration. - Cassandra Marcussen; Aaron Putterman; Salil P. Vadhan (CCC, 2025)

A Theory of Spectral CSP Sparsification. - Sanjeev Khanna; Aaron Putterman; Madhu Sudan 001 (ICALP, 2025)

Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams. - Sanjeev Khanna; Aaron Putterman; Madhu Sudan 001 (ICALP, 2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. - William Kuszmaul; Aaron Putterman; Tingqiang Xu; Hangrui Zhou; Renfei Zhou (SODA, 2025)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. - Sepehr Assadi; Sanjeev Khanna; Aaron Putterman (STOC, 2025)

Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification. - Sanjeev Khanna; Huan Li 002; Aaron Putterman (STOC, 2025)

Efficient Algorithms and New Characterizations for CSP Sparsification. - Sanjeev Khanna; Aaron Putterman; Madhu Sudan 001 (STOC, 2025)

On the Parallel Complexity of Finding a Matroid Basis. - Sanjeev Khanna; Aaron Putterman; Junkai Song (CoRR, 2025)

Sparsifying Cayley Graphs on Every Group. - Jun-Ting Hsieh; Daniel Z. Lee; Sidhanth Mohanty; Aaron Putterman; Rachel Yun Zhang (CoRR, 2025)

Tight Bounds for Sparsifying Random CSPs. - Joshua Brakensiek; Venkatesan Guruswami; Aaron Putterman (CoRR, 2025)