| Streaming approximation resistance of every ordering CSP N Singer, M Sudan, S Velusamy APPROX 2021, 2021 | 11 | 2021 |
| On sketching approximations for symmetric Boolean CSPs J Boyland, M Hwang, T Prasad, N Singer, S Velusamy arXiv preprint arXiv:2112.06319, 2021 | 8* | 2021 |
| Streaming complexity of CSPs with randomly ordered constraints RR Saxena, N Singer, M Sudan, S Velusamy Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 7 | 2023 |
| Oblivious algorithms for the Max-AND Problem NG Singer arXiv preprint arXiv:2305.04438, 2023 | 4 | 2023 |
| Point-hyperplane incidence geometry and the log-rank conjecture N Singer, M Sudan ACM Transactions on Computation Theory (TOCT) 14 (2), 1-16, 2022 | 4 | 2022 |
| On streaming approximation algorithms for constraint satisfaction problems N Singer Harvard University, 2022 | 4 | 2022 |
| Streaming beyond sketching for Maximum Directed Cut. RR Saxena, N Singer, M Sudan, S Velusamy Electron. Colloquium Comput. Complex., 2022 | 1 | 2022 |
| Borges and the aesthetics of computation NG Singer Variaciones Borges 56, 0 | | |
Santhoshini VelusamyToyota Technological Institute at Chicago在 ttic.edu 的電子郵件地址已通過驗證
