Palash Dey, Jaikumar Radhakrishnan, and Santhoshini Velusamy. 2020. “Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes.” In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), edited by Javier Esparza and Daniel Kráľ, 170: Pp. 28:1–28:12. Dagstuhl, Germany: Schloss Dagstuhl–Leibniz-Zentrum für Informatik. Publisher's Version
Chi-Ning Chou, Alexander Golovnev, and Santhoshini Velusamy. 2020. “Optimal Streaming Approximations for all Boolean Max 2-CSPs and Max k-SAT.” In Proceedings of the 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS 2020). Durham, North Carolina.
Constantinos Daskalakis, Maxwell Fishelson, Brendan Lucier, Vasilis Syrgkanis, and Santhoshini Velusamy. 2020. “Simple, Credible, and Approximately-Optimal Auctions.” In Proceedings of the 21st ACM Conference on Economics and Computation (EC 2020), Pp. 713. New York, NY, USA: Association for Computing Machinery. Arxiv Version
Venkatesan Guruswami, Ameya Velingker, and Santhoshini Velusamy. 8/2017. “Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph.” In APPROX-RANDOM, 81: Pp. 8:1--8:19. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. Publisher's Version