default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHirakendu Das
- > Home > Persons > Hirakendu Das
Publications
- 2017
[c15]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh:
A Unified Maximum Likelihood Approach for Estimating Symmetric Properties of Discrete Distributions. ICML 2017: 11-21- 2016
- [i3]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh:
A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation. CoRR abs/1611.02960 (2016) - [i2]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Ananda Theertha Suresh:
A Unified Maximum Likelihood Approach for Optimal Distribution Property Estimation. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j1]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. SIAM J. Discret. Math. 29(3): 1340-1371 (2015) - 2014
- [c14]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
Quadratic-backtracking algorithm for string reconstruction from substring compositions. ISIT 2014: 1296-1300 - [i1]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
String Reconstruction from Substring Compositions. CoRR abs/1403.2439 (2014) - 2013
- [c12]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
Tight bounds for universal compression of large alphabets. ISIT 2013: 2875-2879 - 2012
- [c11]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Estimating multiple concurrent processes. ISIT 2012: 1628-1632 - [c9]Jayadev Acharya, Hirakendu Das, Alon Orlitsky:
Tight Bounds on Profile Redundancy and Distinguishability. NIPS 2012: 3266-3274 - [c8]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, Ananda Theertha Suresh:
Competitive Classification and Closeness Testing. COLT 2012: 22.1-22.18 - 2011
- [c7]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan:
Algebraic computation of pattern maximum likelihood. ISIT 2011: 400-404 - [c6]Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan:
Competitive Closeness Testing. COLT 2011: 47-68 - 2010
- [c5]Jayadev Acharya, Hirakendu Das, Olgica Milenkovic, Alon Orlitsky, Shengjun Pan:
On reconstructing a string from its substring compositions. ISIT 2010: 1238-1242 - [c4]Jayadev Acharya, Hirakendu Das, Alon Orlitsky, Shengjun Pan, Narayana P. Santhanam:
Classification using pattern probability estimators. ISIT 2010: 1493-1497 - [c3]Jayadev Acharya, Hirakendu Das, Hosein Mohimani, Alon Orlitsky, Shengjun Pan:
Exact calculation of pattern probabilities. ISIT 2010: 1498-1502
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:55 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:
