Sankeerth Rao Karingula

According to our database, Sankeerth Rao Karingula authored at least 18 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On the number of distinct <i>k</i>-decks: Enumeration and bounds.

Johan Chrisnata, Han Mao Kiah, Sankeerth Rao Karingula, Alexander Vardy, Eitan Yaakobi, Hanwen Yao

Adv. Math. Commun., 2023

2022

Sketching based Representations for Robust Image Classification with Provable Guarantees.

Nishanth Dikkala, Sankeerth Rao Karingula, Raghu Meka, Jelani Nelson, Rina Panigrahy, Xin Wang

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Lower bounds on the redundancy of linear codes with disjoint repair groups.

Sankeerth Rao Karingula, Alexander Vardy, Mary Wootters

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Time Series Anomaly Detection with label-free Model Selection.

Deokwoo Jung, Nandini Ramanan, Mehrnaz Amjadi, Sankeerth Rao Karingula, Jake Taylor, Claudionor José Nunes Coelho Jr.

CoRR, 2021

Boosted Embeddings for Time Series Forecasting.

Sankeerth Rao Karingula, Nandini Ramanan, Rasool Tahsambi, Mehrnaz Amjadi, Deokwoo Jung, Ricky Si, Charanraj Thimmisetty, Claudionor José Nunes Coelho Jr.

CoRR, 2021

Boosted Embeddings for Time-Series Forecasting.

Sankeerth Rao Karingula, Nandini Ramanan, Rasool Tahmasbi, Mehrnaz Amjadi, Deokwoo Jung, Ricky Si, Charanraj Thimmisetty, Luisa F. Polanía, Marjorie Sayer, Jake Taylor, Claudionor Nunes Coelho

Proceedings of the Machine Learning, Optimization, and Data Science, 2021

Singularity of Random Integer Matrices with Large Entries.

Sankeerth Rao Karingula, Shachar Lovett

Proceedings of the Approximation, 2021

2020

What not to do when your data is lost ?

Sankeerth Rao Karingula

PhD thesis, 2020

Codes over integers, and the singularity of random matrices with large entries.

Sankeerth Rao Karingula, Shachar Lovett

Electron. Colloquium Comput. Complex., 2020

2019

The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes.

Daniel Kane, Shachar Lovett, Sankeerth Rao

SIAM J. Comput., 2019

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

Johan Chrisnata, Han Mao Kiah, Sankeerth Rao, Alexander Vardy, Eitan Yaakobi, Hanwen Yao

Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

Communication and Memory Efficient Testing of Discrete Distributions.

Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao

Proceedings of the Conference on Learning Theory, 2019

2018

Torus polynomials: an algebraic approach to ACC lower bounds.

Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao

Electron. Colloquium Comput. Complex., 2018

A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n.

Daniel Kane, Sankeerth Rao

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

Probabilistic Existence of Large Sets of Designs.

Shachar Lovett, Sankeerth Rao, Alexander Vardy

Electron. Colloquium Comput. Complex., 2017

Labeling the complete bipartite graph with no zero cycles.

Daniel M. Kane, Shachar Lovett, Sankeerth Rao

Electron. Colloquium Comput. Complex., 2017

2016

Lower Bound on the Redundancy of PIR Codes.

Sankeerth Rao, Alexander Vardy

CoRR, 2016

2014

A new upperbound for the oblivious transfer capacity of discrete memoryless channels.

K. Sankeerth Rao, Vinod M. Prabhakaran

Proceedings of the 2014 IEEE Information Theory Workshop, 2014