Sankeerth Rao

sankeerth1729 at gmail.com

About me

Hi! I am a PhD Candidate at UC San Diego. I am very fortunate to be advised by Shachar Lovett and Alex Vardy. During Summer 2018 I interned with Sergey Yekhanin at Microsoft Research, Redmond. I completed my undergraduate studies at IIT Bombay advised by Vinod Prabhakaran.

I am broadly interested in Theoretical Computer Science. In particular I have worked on problems in Coding Theory, Combinatorics, Pseudo randomness and Learning Theory.

Research

Communication and Memory Efficient Testing of Discrete Distributions.

Ilias Diakonikolas, Themis Gouleakis, Daniel Kane, Sankeerth Rao [COLT 2019]

Torus Polynomials: An Algebraic Approach to ACC Lower Bounds.

Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao [ITCS 2019]

Near optimal PRG for Boolean PTF of Degree 2.

Daniel Kane, Sankeerth Rao [CCC 2018]

Probabilistic Existence of Large Sets of Designs.

Shachar Lovett, Sankeerth Rao, Alexander Vardy [SODA 18] [JCTA in process]

Coding for Distributed Storage and the Birkhoff Polytope.

Daniel Kane, Shachar Lovett, Sankeerth Rao [FOCS 17] [SICOMP]

Lower Bound on the Redundancy of PIR Codes.

Sankeerth Rao, Alexander Vardy

On the Number of Distinct k-Decks: Enumeration and Bounds.

Johan Chrisnata, Han Mao Kiah, Sankeerth Rao, Alexander Vardy, Eitan Yaakobi, Hanwen Yao [ISCIT 19]

A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels.

Sankeerth Rao, Vinod Prabhakaran [ITW 2014]