Sankeerth Rao

Publication Activity (10 Years)

Years Active: 2016-2020
Publications (10 Years): 15

Top Topics

Algebraic Operations

Bipartite Graph

Memory Efficient

Top Venues

Electron. Colloquium Comput. Complex.

J. Comb. Theory, Ser. A

Publications

Shachar Lovett, Sankeerth Rao, Alexander Vardy
Probabilistic existence of large sets of designs. J. Comb. Theory, Ser. A 176 (2020)
Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao
Communication and Memory Efficient Testing of Discrete Distributions. CoRR (2019)
Johan Chrisnata, Han Mao Kiah, Sankeerth Rao, Alexander Vardy, Eitan Yaakobi, Hanwen Yao
On the Number of Distinct k-Decks: Enumeration and Bounds. ISCIT (2019)
Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao
Communication and Memory Efficient Testing of Discrete Distributions. COLT (2019)
Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. ITCS (2019)
Daniel Kane, Shachar Lovett, Sankeerth Rao
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. SIAM J. Comput. 48 (4) (2019)
Daniel Kane, Sankeerth Rao
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n. Computational Complexity Conference (2018)
Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
Torus polynomials: an algebraic approach to ACC lower bounds. Electron. Colloquium Comput. Complex. 25 (2018)
Shachar Lovett, Sankeerth Rao, Alexander Vardy
Probabilistic Existence of Large Sets of Designs. SODA (2018)
Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao
Torus polynomials: an algebraic approach to ACC lower bounds. CoRR (2018)
Daniel M. Kane, Shachar Lovett, Sankeerth Rao
Labeling the complete bipartite graph with no zero cycles. CoRR (2017)
Daniel Kane, Shachar Lovett, Sankeerth Rao
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. FOCS (2017)
Shachar Lovett, Sankeerth Rao, Alexander Vardy
Probabilistic Existence of Large Sets of Designs. Electron. Colloquium Comput. Complex. 24 (2017)
Daniel M. Kane, Shachar Lovett, Sankeerth Rao
Labeling the complete bipartite graph with no zero cycles. Electron. Colloquium Comput. Complex. 24 (2017)
Sankeerth Rao, Alexander Vardy
Lower Bound on the Redundancy of PIR Codes. CoRR (2016)