Aaron (Louie) Putterman

According to our database, Aaron (Louie) Putterman authored at least 23 papers between 2023 and 2026.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2026

An ~O(n^3/7) Round Parallel Algorithm for Matroid Bases.

Sanjeev Khanna, Aaron Putterman, Junkai Song

CoRR, May, 2026

Many Hamiltonians Are Sparsifiable.

Arpon Basu, Joshua Brakensiek, Aaron Putterman

CoRR, May, 2026

Bounded Independence Edge Sampling for Combinatorial Graph Properties.

Aaron Putterman, Salil P. Vadhan, Vadim Zaripov

CoRR, March, 2026

Fault-Tolerant Distance Oracles Below the n · f Barrier.

Sanjeev Khanna, Christian Konrad, Aaron Putterman

CoRR, March, 2026

Classification of Non-redundancy of Boolean Predicates of Arity 4.

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

CoRR, March, 2026

Sparsifying Cayley Graphs on Every Group.

Jun-Ting Hsieh, Daniel Z. Lee, Sidhanth Mohanty, Aaron Putterman, Rachel Yun Zhang

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025

Optimal Parallel Basis Finding in Graphic and Related Matroids.

Sanjeev Khanna, Aaron Putterman, Junkai Song

CoRR, November, 2025

Tight Bounds for Sparsifying Random CSPs.

Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman

CoRR, August, 2025

Efficient Algorithms and New Characterizations for CSP Sparsification.

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification.

Sanjeev Khanna, Huan Li, Aaron Putterman

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms.

Sepehr Assadi, Sanjeev Khanna, Aaron Putterman

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval.

William Kuszmaul, Aaron Putterman, Tingqiang Xu, Hangrui Zhou, Renfei Zhou

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Bivariate Linear Operator Codes.

Aaron Putterman, Vadim Zaripov

Proceedings of the IEEE International Symposium on Information Theory, 2025

Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams.

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

A Theory of Spectral CSP Sparsification.

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

On the Parallel Complexity of Finding a Matroid Basis.

Sanjeev Khanna, Aaron Putterman, Junkai Song

Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Characterizing the Distinguishability of Product Distributions Through Multicalibration.

Cassandra Marcussen, Aaron Putterman, Salil P. Vadhan

Proceedings of the 40th Computational Complexity Conference, 2025

2024

Characterizations of Sparsifiability for Affine CSPs and Symmetric CSPs.

Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan

CoRR, 2024

Code Sparsification and its Applications.

Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Pseudorandom Linear Codes Are List-Decodable to Capacity.

Aaron (Louie) Putterman, Edward Pyne

Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

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

Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers.

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Near-Optimal Derandomization of Medium-Width Branching Programs.

Aaron (Louie) Putterman, Edward Pyne

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023