Aaron Putterman

23 papers A* 9A 1B 1Journal 12
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bounded Independence Edge Sampling for Combinatorial Graph Properties.
CoRR
Aaron Putterman, Salil P. Vadhan, Vadim Zaripov
2026 J jnl
Classification of Non-redundancy of Boolean Predicates of Arity 4.
CoRR
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman
2026 J jnl
Fault-Tolerant Distance Oracles Below the n · f Barrier.
CoRR
Sanjeev Khanna, Christian Konrad, Aaron Putterman
2026 A* conf
Sparsifying Cayley Graphs on Every Group.
SODA
Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang
2025 A* conf
A Theory of Spectral CSP Sparsification.
ICALP
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
2025 J jnl
A Theory of Spectral CSP Sparsification.
CoRR
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
2025 B conf
Bivariate Linear Operator Codes.
ISIT
Aaron Putterman, Vadim Zaripov
2025 A conf
Characterizing the Distinguishability of Product Distributions Through Multicalibration.
CCC
Cassandra Marcussen, Aaron Putterman, Salil P. Vadhan
2025 A* conf
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms.
STOC
Sepehr Assadi, Sanjeev Khanna, Aaron Putterman
2025 J jnl
Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms.
CoRR
Sepehr Assadi, Sanjeev Khanna, Aaron Putterman
2025 A* conf
Efficient Algorithms and New Characterizations for CSP Sparsification.
STOC
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
2025 A* conf
Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams.
ICALP
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
2025 A* conf
Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification.
STOC
Sanjeev Khanna, Huan Li, Aaron Putterman
2025 J jnl
Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams.
CoRR
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
2025 J jnl
Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification.
CoRR
Sanjeev Khanna, Huan Li, Aaron Putterman
2025 A* conf
On the Parallel Complexity of Finding a Matroid Basis.
FOCS
Sanjeev Khanna, Aaron Putterman, Junkai Song
2025 J jnl
On the Parallel Complexity of Finding a Matroid Basis.
CoRR
Sanjeev Khanna, Aaron Putterman, Junkai Song
2025 J jnl
Optimal Parallel Basis Finding in Graphic and Related Matroids.
CoRR
Sanjeev Khanna, Aaron Putterman, Junkai Song
2025 J jnl
Sparsifying Cayley Graphs on Every Group.
CoRR
Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang
2025 A* conf
Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval.
SODA
William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou
2025 J jnl
Tight Bounds for Sparsifying Random CSPs.
CoRR
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman
2024 A* conf
Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers.
FOCS
Sanjeev Khanna, Aaron Putterman, Madhu Sudan
2024 J jnl
Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval.
CoRR
William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou