Sivakanth Gopi

Sivakanth Gopi 

Sivakanth Gopi
Postdoctoral Researcher
Microsoft Research Redmond
One Microsoft Way, Redmond, WA 98052
Email: 'si'+last_name+'@microsoft.com'

I am a postdocotoral researcher in the theory group at Microsoft Research Redmond. I recently graduated with a PhD from Princeton University where I was 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, ECCC] [Talk at Microsoft Research Redmond]

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][Talk at ITCS]

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]
Journal version in IEEE Transactions on Information Theory 2018. [IEEETransInfo]

Competitive analysis of the top-K ranking problem

with Xi Chen, Jieming Mao and Jon Schneider. SODA 2017. [arXiv]
Journal version in IEEE Transactions on Information Theory 2018. [IEEETransInfo]

Lower bounds for constant query affine-invariant LCCs and LTCs

with Arnab Bhattacharyya. CCC 2016. [ECCC, arXiv]
Journal version in ACM Transactions on Computation Theory (TOCT) 2017. [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] [Talk at DIMACS workshop (Rutgers University), Zeev's TCS+ talk]
Journal version in Journal of the ACM (JACM) 2016. [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]