| Streaming complexity of approximating max 2csp and max acyclic subgraph V Guruswami, A Velingker, S Velusamy Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2017 | 35 | 2017 |
| Optimal streaming approximations for all boolean max-2csps and max-ksat CN Chou, A Golovnev, S Velusamy 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 31 | 2020 |
| Approximability of all finite CSPs with linear sketches CN Chou, A Golovnev, M Sudan, S Velusamy 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 20* | 2022 |
| Linear space streaming lower bounds for approximating CSPs CN Chou, A Golovnev, M Sudan, A Velingker, S Velusamy Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 18 | 2022 |
| Fair allocation of a multiset of indivisible items P Gorantla, K Marwaha, S Velusamy Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 15 | 2023 |
| Streaming approximation resistance of every ordering CSP NG Singer, M Sudan, S Velusamy computational complexity 33 (1), 6, 2024 | 13 | 2024 |
| Simple, credible, and approximately-optimal auctions C Daskalakis, M Fishelson, B Lucier, V Syrgkanis, S Velusamy Proceedings of the 21st ACM Conference on Economics and Computation, 713-713, 2020 | 13 | 2020 |
| Approximability of all Boolean CSPs with linear sketches CN Chou, A Golovnev, M Sudan, S Velusamy arXiv preprint arXiv:2102.12351, 2021 | 12* | 2021 |
| On Sketching Approximations for Symmetric Boolean CSPs J Boyland, M Hwang, T Prasad, N Singer, S Velusamy Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2022 | 10* | 2022 |
| 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 | 9 | 2023 |
| Improved streaming algorithms for Maximum Directed Cut via smoothed snapshots RR Saxena, NG Singer, M Sudan, S Velusamy 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023 | 7* | 2023 |
| Sketching approximability of (weak) monarchy predicates CN Chou, A Golovnev, A Shahrasbi, M Sudan, S Velusamy arXiv preprint arXiv:2205.02345, 2022 | 6 | 2022 |
| An improved lower bound for matroid intersection prophet inequalities RR Saxena, S Velusamy, SM Weinberg arXiv preprint arXiv:2209.05614, 2022 | 2 | 2022 |
| Approximability of Constraint Satisfaction Problems in the Streaming Setting S Velusamy Harvard University, 2023 | 1 | 2023 |
| Multi-Item Nontruthful Auctions Achieve Good Revenue C Daskalakis, M Fishelson, B Lucier, V Syrgkanis, S Velusamy SIAM Journal on Computing 51 (6), 1796-1838, 2022 | 1 | 2022 |
| Elementary analysis of isolated zeroes of a polynomial system M Bafna, M Sudan, S Velusamy, D Xiang arXiv preprint arXiv:2102.00602, 2021 | 1 | 2021 |
| Efficient Location Sampling Algorithms for Road Networks S Ahmadian, S Gollapudi, K Kollias, V Kumar, A Velingker, S Velusamy Companion Proceedings of the ACM on Web Conference 2024, 899-902, 2024 | | 2024 |
| Sketching approximability of all finite CSPs CN Chou, A Golovnev, M Sudan, S Velusamy Journal of the ACM 71 (2), 1-74, 2024 | | 2024 |
| Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes P Dey, J Radhakrishnan, S Velusamy 45th International Symposium on Mathematical Foundations of Computer Science …, 2020 | | 2020 |
Madhu SudanGordon McKay Professor of Computer Science, Harvard University在 cs.harvard.edu 的电子邮件经过验证
