Closed-form expressions for the sketching approximability of (some) symmetric Boolean CSPs. - Joanna Boyland; Michael Hwang; Tarun Prasad; Noah Singer; Santhoshini Velusamy (CoRR, 2021)

On sketching approximations for symmetric Boolean CSPs. - Joanna Boyland; Michael Hwang; Tarun Prasad; Noah Singer; Santhoshini Velusamy (Electron. Colloquium Comput. Complex., 2022)

Streaming complexity of CSPs with randomly ordered constraints. - Raghuvansh Saxena; Noah Singer; Madhu Sudan 001; Santhoshini Velusamy (Electron. Colloquium Comput. Complex., 2022)

Streaming beyond sketching for Maximum Directed Cut. - Raghuvansh Saxena; Noah Singer; Madhu Sudan 001; Santhoshini Velusamy (Electron. Colloquium Comput. Complex., 2022)

Point-hyperplane Incidence Geometry and the Log-rank Conjecture. - Noah Singer; Madhu Sudan 001 (ACM Trans. Comput. Theory, 2022)

Oblivious Algorithms for the Max-kAND Problem. - Noah G. Singer (APPROX/RANDOM, 2023)

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. - Raghuvansh R. Saxena; Noah G. Singer; Madhu Sudan 001; Santhoshini Velusamy (FOCS, 2023)

On streaming approximation algorithms for constraint satisfaction problems. - Noah G. Singer (CoRR, 2023)

Coboundary expansion inside Chevalley coset complex HDXs. - Ryan O'Donnell; Noah G. Singer (CoRR, 2024)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds. - Samuel Hwang; Noah G. Singer; Santhoshini Velusamy (CoRR, 2024)

Streaming approximation resistance of every ordering CSP. - Noah G. Singer; Madhu Sudan 001; Santhoshini Velusamy (Comput. Complex., 2024)

Latency Guarantees for Caching with Delayed Hits. - Keerthana Gurushankar; Noah G. Singer; Bernardo Subercaseaux (INFOCOM, 2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut. - Raghuvansh R. Saxena; Noah G. Singer; Madhu Sudan 001; Santhoshini Velusamy (SODA, 2025)

A Classical Quadratic Speedup for Planted kXOR. - Meghal Gupta; William He; Ryan O'Donnell; Noah G. Singer (CoRR, 2025)