![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Govinda M. Kamath
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j3]Vivek Kumar Bagaria, Tavor Z. Baharav
, Govinda M. Kamath, David N. C. Tse:
Bandit-Based Monte Carlo Optimization for Nearest Neighbors. IEEE J. Sel. Areas Inf. Theory 2(2): 599-610 (2021) - [c13]Tri Dao, Govinda M. Kamath, Vasilis Syrgkanis, Lester Mackey:
Knowledge Distillation as Semiparametric Inference. ICLR 2021 - [c12]Ilan Shomorony, Govinda M. Kamath:
Sketching and Sequence Alignment: A Rate-Distortion Perspective. ISIT 2021: 3308-3313 - [i12]Tri Dao, Govinda M. Kamath, Vasilis Syrgkanis, Lester Mackey:
Knowledge Distillation as Semiparametric Inference. CoRR abs/2104.09732 (2021) - [i11]Ilan Shomorony, Govinda M. Kamath:
Sketching and Sequence Alignment: A Rate-Distortion Perspective. CoRR abs/2107.04202 (2021) - 2020
- [j2]Tavor Z. Baharav
, Govinda M. Kamath, David N. C. Tse, Ilan Shomorony
:
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments. Patterns 1(6): 100081 (2020) - [c11]Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony:
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment. NeurIPS 2020 - [c10]Tavor Z. Baharav, Govinda M. Kamath, David N. C. Tse, Ilan Shomorony:
Spectral Jaccard Similarity: A New Approach to Estimating Pairwise Sequence Alignments. RECOMB 2020: 223-225 - [i10]Govinda M. Kamath, Tavor Z. Baharav, Ilan Shomorony:
Adaptive Learning of Rank-One Models for Efficient Pairwise Sequence Alignment. CoRR abs/2011.04832 (2020)
2010 – 2019
- 2019
- [c9]Jesse M. Zhang, Govinda M. Kamath, David N. C. Tse:
Towards a Post-clustering Test for Differential Expression. RECOMB 2019: 328-329 - [i9]Xuechao Wang, Govinda M. Kamath, Vivek Kumar Bagaria, Sreeram Kannan, Sewoong Oh, David Tse, Pramod Viswanath:
Proof-of-Stake Longest Chain Protocols Revisited. CoRR abs/1910.02218 (2019) - 2018
- [c8]Vivek Kumar Bagaria, Govinda M. Kamath, Vasilis Ntranos, Martin J. Zhang, David Tse:
Medoids in Almost-Linear Time via Multi-Armed Bandits. AISTATS 2018: 500-509 - [i8]Vivek Kumar Bagaria, Govinda M. Kamath, David N. C. Tse:
Adaptive Monte-Carlo Optimization. CoRR abs/1805.08321 (2018) - 2017
- [i7]Vivek Kumar Bagaria, Govinda M. Kamath, Vasilis Ntranos, Martin J. Zhang, David Tse:
Medoids in almost linear time via multi-armed bandits. CoRR abs/1711.00817 (2017) - 2016
- [c7]Yuxin Chen, Govinda M. Kamath, Changho Suh, David Tse:
Community Recovery in Graphs with Locality. ICML 2016: 689-698 - [c6]Ilan Shomorony, Govinda M. Kamath, Fei Xia
, Thomas A. Courtade, David N. C. Tse:
Partial DNA assembly: A rate-distortion perspective. ISIT 2016: 1799-1803 - [i6]Yuxin Chen, Govinda M. Kamath, Changho Suh, David N. C. Tse:
Community Recovery in Graphs with Locality. CoRR abs/1602.03828 (2016) - [i5]Ilan Shomorony, Govinda M. Kamath, Fei Xia, Thomas A. Courtade, David N. C. Tse:
Partial DNA Assembly: A Rate-Distortion Perspective. CoRR abs/1605.01941 (2016) - 2015
- [c5]Govinda M. Kamath, Eren Sasoglu, David N. C. Tse:
Optimal haplotype assembly from high-throughput mate-pair reads. ISIT 2015: 914-918 - [i4]Govinda M. Kamath, Eren Sasoglu, David N. C. Tse:
Optimal Haplotype Assembly from High-Throughput Mate-Pair Reads. CoRR abs/1502.01975 (2015) - 2014
- [j1]Govinda M. Kamath, N. Prakash
, V. Lalitha, P. Vijay Kumar:
Codes With Local Regeneration and Erasure Correction. IEEE Trans. Inf. Theory 60(8): 4637-4660 (2014) - 2013
- [c4]Govinda M. Kamath, Natalia Silberstein, N. Prakash
, Ankit Singh Rawat
, V. Lalitha, Onur Ozan Koyluoglu, P. Vijay Kumar, Sriram Vishwanath:
Explicit MBR all-symbol locality codes. ISIT 2013: 504-508 - [c3]Govinda M. Kamath, N. Prakash
, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ISIT 2013: 1606-1610 - [c2]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ITA 2013: 1-5 - [i3]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar, Natalia Silberstein, Ankit Singh Rawat, Onur Ozan Koyluoglu, Sriram Vishwanath:
Explicit MBR All-Symbol Locality Codes. CoRR abs/1302.0744 (2013) - 2012
- [c1]N. Prakash
, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar:
Optimal linear codes with a local-error-correction property. ISIT 2012: 2776-2780 - [i2]N. Prakash, Govinda M. Kamath, V. Lalitha, P. Vijay Kumar:
Optimal Linear Codes with a Local-Error-Correction Property. CoRR abs/1202.2414 (2012) - [i1]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with Local Regeneration. CoRR abs/1211.1932 (2012)
Coauthor Index
aka: David N. C. Tse
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint