Sivakanth Gopi

Sivakanth Gopi 

Sivakanth Gopi
Dept. of Computer Science
Princeton University
35 Olden Street, Princeton, NJ 08540-5233
Email: mathrm{sgopi@{cs.princeton.edu,princeton.edu}}

I am a fourth year graduate student studying Theoretical Computer Science at Princeton University. I am fortunate to be advised by Prof. Zeev Dvir. I am mainly interested in Coding Theory, Pseudorandomness, Complexity Theory, and Additive Combinatorics. I completed my undergraduate studies at IIT Bombay with a major in computer science and a minor in mathematics.

CV

Publications

Gaussian width bounds with applications to arithmetic progressions in random settings

with Jop Briët. [arXiv]

On Maximally Recoverable Local Reconstruction Codes

with Venkatesan Guruswami and Sergey Yekhanin. [arXiv]

Lower bounds for 2-query LCCs over large alphabet

with Arnab Bhattacharyya and Avishay Tal. RANDOM 2017. [arXiv]

Outlaw distributions and locally decodable codes

with Jop Briët and Zeev Dvir. ITCS 2017. [arXiv]

Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound

with Swastik Kopparty, Rafael Oliveira, Noga Ron-Zewi and Shubhangi Saraf. SODA 2017. [ECCC]

Competitive analysis of the top-K ranking problem

with Xi Chen, Jieming Mao and Jon Schneider. SODA 2017. [arXiv]

Lower bounds for constant query affine-invariant LCCs and LTCs

with Arnab Bhattacharyya. CCC 2016. [ECCC, arXiv, TOCT]

On the number of rich lines in truly high dimensional sets

with Zeev Dvir. SoCG 2015. [arXiv]

2-Server PIR with sub-polynomial communication

with Zeev Dvir. STOC 2015 (co-winner of best paper award). [ECCC, arXiv, JACM]

One-bit compressed sensing: Provable support and vector recovery

with Prateek Jain, Praneeth Netrapalli, and Aditya V. Nori. ICML 2013. [JMLR]

Synthesis from incompatible specifications

with Pavol Černý, Thomas A. Henzinger, Arjun Radhakrishna, and Nishant Totla. EMSOFT 2012. [Link]