The following papers are roughly organized (reverse) chronologically. You can also find my work on
DBLP and Google Scholar. My ORCID is 0000-0002-0076-521X
. See also this YouTube playlist of my research talks.
Research publications
-
Improved streaming algorithms for Maximum Directed Cut via smoothed snapshots
Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, and Santhoshini Velusamy
FOCS 2023
-
Oblivious algorithms for the Max-\(k\)AND Problem
Noah G. Singer
APPROX 2023
-
Streaming complexity of CSPs with randomly ordered constraints
Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, and Santhoshini Velusamy
SODA 2023
-
On sketching approximations for symmetric Boolean CSPs
Joanna Boyland, Michael Hwang, Tarun Prasad, Noah G. Singer, and Santhoshini Velusamy
APPROX 2022
Talk -
Streaming approximation resistance of every ordering CSP
Noah G. Singer, Madhu Sudan, and Santhoshini Velusamy
APPROX 2021
Talk -
Point-hyperplane incidence geometry and the log-rank conjecture
Noah G. Singer and Madhu Sudan
ACM Transactions on Computation Theory 14.2 (2022)
Miscellaneous writing
-
Borges and the aesthetics of computation
Noah G. Singer
Variaciones Borges 56
-
On streaming approximation algorithms for constraint satisfaction problems
Noah G. Singer
Harvard College Senior Thesis
Hoopes Prize (Harvard College)
-
CS 121.5 Notes, Fall 2019
Noah G. Singer
Notes from advanced section in CS 121: Introduction to Theoretical Computer Science (Fall 2019)