| 2026 | CP | Classification of Non-Redundancy of Boolean Predicates of Arity 4. | Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman |
| 2026 | ICALP | Multiplicative Error Set System Sparsification: A Simpler Proof via Chain Length Contraction. | Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman |
| 2026 | ICALP | An (n | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2026 | ICALP | Optimal Parallel Basis Finding in Graphic and Related Matroids. | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2026 | SODA | Sparsifying Cayley Graphs on Every Group. | Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang |
| 2025 | FOCS | On the Parallel Complexity of Finding a Matroid Basis. | Sanjeev Khanna, Aaron Putterman, Junkai Song |
| 2025 | ICALP | A Theory of Spectral CSP Sparsification. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2025 | ICALP | Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2025 | ISIT | Bivariate Linear Operator Codes. | Aaron Putterman, Vadim Zaripov |
| 2025 | SODA | Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval. | William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou |
| 2025 | STOC | Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms. | Sepehr Assadi, Sanjeev Khanna, Aaron Putterman |
| 2025 | STOC | Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification. | Sanjeev Khanna, Huan Li, Aaron Putterman |
| 2025 | STOC | Efficient Algorithms and New Characterizations for CSP Sparsification. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |
| 2024 | FOCS | Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. | Sanjeev Khanna, Aaron Putterman, Madhu Sudan |