Aaron L Putterman

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Almost-tight bounds on preserving cuts in classes of submodular hypergraphs2026-01-14Paper
Tight Bounds for Sparsifying Random CSPs
(available as arXiv preprint)
2026-01-01Paper
Classification of Non-redundancy of Boolean Predicates of Arity 4
(available as arXiv preprint)
2026-01-01Paper
Multiplicative error set system sparsification: A simpler proof via chain length contraction
(available as arXiv preprint)
2026-01-01Paper
Pseudorandom linear codes are list-decodable to capacity2025-11-04Paper
Sparsifying Cayley Graphs on Every Group
(available as arXiv preprint)
2025-01-01Paper
Code sparsification and its applications2024-11-28Paper
Near-optimal derandomization of medium-width branching programs2024-05-08Paper
Pseudorandom Linear Codes are List Decodable to Capacity2023-03-30Paper


Research outcomes over time


This page was built for person: Aaron L Putterman