Sankeerth Rao

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