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!
| Publication | Date of Publication | Type |
|---|---|---|
| Almost-tight bounds on preserving cuts in classes of submodular hypergraphs | 2026-01-14 | Paper |
| Tight Bounds for Sparsifying Random CSPs (available as arXiv preprint) | 2026-01-01 | Paper |
| Classification of Non-redundancy of Boolean Predicates of Arity 4 (available as arXiv preprint) | 2026-01-01 | Paper |
| Multiplicative error set system sparsification: A simpler proof via chain length contraction (available as arXiv preprint) | 2026-01-01 | Paper |
| Pseudorandom linear codes are list-decodable to capacity | 2025-11-04 | Paper |
| Sparsifying Cayley Graphs on Every Group (available as arXiv preprint) | 2025-01-01 | Paper |
| Code sparsification and its applications | 2024-11-28 | Paper |
| Near-optimal derandomization of medium-width branching programs | 2024-05-08 | Paper |
| Pseudorandom Linear Codes are List Decodable to Capacity | 2023-03-30 | Paper |
Research outcomes over time
This page was built for person: Aaron L Putterman