default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSankeerth Rao Karingula
Person information
- affiliation: University of California, San Diego, USA
- affiliation (former): Indian Institute of Technology, Bombay, Mumbai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2020
[b1]Sankeerth Rao Karingula:
What not to do when your data is lost ? University of California, San Diego, USA, 2020
Journal Articles
- 2023
- [j3]Johan Chrisnata, Han Mao Kiah, Sankeerth Rao Karingula, Alexander Vardy, Eitan Yaakobi, Hanwen Yao:
On the number of distinct k-decks: Enumeration and bounds. Adv. Math. Commun. 17(4): 960-978 (2023) - 2020
- [j2]Shachar Lovett, Sankeerth Rao
, Alexander Vardy:
Probabilistic existence of large sets of designs. J. Comb. Theory A 176: 105286 (2020) - 2019
- [j1]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): 1425-1435 (2019)
Conference and Workshop Papers
- 2022
- [c11]Sankeerth Rao Karingula, Alexander Vardy, Mary Wootters:
Lower bounds on the redundancy of linear codes with disjoint repair groups. ISIT 2022: 975-979 - [c10]Nishanth Dikkala, Sankeerth Rao Karingula, Raghu Meka, Jelani Nelson, Rina Panigrahy, Xin Wang:
Sketching based Representations for Robust Image Classification with Provable Guarantees. NeurIPS 2022 - 2021
- [c9]Sankeerth Rao Karingula, Shachar Lovett:
Singularity of Random Integer Matrices with Large Entries. APPROX-RANDOM 2021: 33:1-33:16 - [c8]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:
Boosted Embeddings for Time-Series Forecasting. LOD 2021: 1-14 - 2019
- [c7]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao:
Communication and Memory Efficient Testing of Discrete Distributions. COLT 2019: 1070-1106 - [c6]Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. ITCS 2019: 13:1-13:16 - [c5]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: 519-524 - 2018
- [c4]Daniel Kane, Sankeerth Rao:
A PRG for Boolean PTF of Degree 2 with Seed Length Subpolynomial in epsilon and Logarithmic in n. CCC 2018: 2:1-2:24 - [c3]Shachar Lovett, Sankeerth Rao, Alexander Vardy:
Probabilistic Existence of Large Sets of Designs. SODA 2018: 1545-1556 - 2017
- [c2]Daniel Kane, Shachar Lovett, Sankeerth Rao:
The Independence Number of the Birkhoff Polytope Graph, and Applications to Maximally Recoverable Codes. FOCS 2017: 252-259 - 2014
- [c1]K. Sankeerth Rao, Vinod M. Prabhakaran:
A new upperbound for the oblivious transfer capacity of discrete memoryless channels. ITW 2014: 35-39
Informal and Other Publications
- 2021
- [i12]Sankeerth Rao Karingula, Nandini Ramanan, Rasool Tahsambi, Mehrnaz Amjadi, Deokwoo Jung, Ricky Si, Charanraj Thimmisetty, Claudionor José Nunes Coelho Jr.:
Boosted Embeddings for Time Series Forecasting. CoRR abs/2104.04781 (2021) - [i11]Deokwoo Jung, Nandini Ramanan, Mehrnaz Amjadi, Sankeerth Rao Karingula, Jake Taylor, Claudionor José Nunes Coelho Jr.:
Time Series Anomaly Detection with label-free Model Selection. CoRR abs/2106.07473 (2021) - 2020
- [i10]Sankeerth Rao Karingula, Shachar Lovett:
Codes over integers, and the singularity of random matrices with large entries. CoRR abs/2010.12081 (2020) - [i9]Sankeerth Rao Karingula, Shachar Lovett:
Codes over integers, and the singularity of random matrices with large entries. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- [i8]Ilias Diakonikolas, Themis Gouleakis, Daniel M. Kane, Sankeerth Rao:
Communication and Memory Efficient Testing of Discrete Distributions. CoRR abs/1906.04709 (2019) - 2018
- [i7]Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus polynomials: an algebraic approach to ACC lower bounds. CoRR abs/1804.08176 (2018) - [i6]Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, Sankeerth Rao:
Torus polynomials: an algebraic approach to ACC lower bounds. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i5]Daniel M. Kane, Shachar Lovett, Sankeerth Rao:
Labeling the complete bipartite graph with no zero cycles. CoRR abs/1702.05773 (2017) - [i4]Daniel M. Kane, Shachar Lovett, Sankeerth Rao:
Labeling the complete bipartite graph with no zero cycles. Electron. Colloquium Comput. Complex. TR17 (2017) - [i3]Shachar Lovett, Sankeerth Rao, Alexander Vardy:
Probabilistic Existence of Large Sets of Designs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i2]Sankeerth Rao, Alexander Vardy:
Lower Bound on the Redundancy of PIR Codes. CoRR abs/1605.01869 (2016) - 2014
- [i1]K. Sankeerth Rao, Vinod M. Prabhakaran:
A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels. CoRR abs/1405.2049 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
