default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaveen Kumar 0003
Person information
- affiliation: SK Hynix Memory Solutions
- affiliation: Iowa State University
Other persons with the same name
- Naveen Kumar — disambiguation page
- Naveen Kumar 0001
![[0000-0003-3401-6927]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-3401-6927")
— University of Delhi, New Delhi, India - Naveen Kumar 0002 — VMware Inc., Palo Alto (and 1 more)
- Naveen Kumar 0004 — Disney Research, Glendale, CA, USA (and 1 more)
- Naveen Kumar 0005 — National Institute of Technology, Kurukshetra (and 1 more)
- Naveen Kumar 0006 — University of Delaware
- Naveen Kumar 0007 — Banaras Hindu University
- Naveen Kumar 0008 — Jamia Millia Islamia
- Naveen Kumar 0009 — Indian Institute of Technology Roorkee
- Naveen Kumar 0010 — RIKEN Advanced Science Institute, Yokohama, Japan
- Naveen Kumar 0011 — Indian Institute of Information Technology Vadodara, India (and 1 more)
- Naveen Kumar 0012 — Indian Institute of Technology Madras, Department of Computer Science and Engineering, Chennai, India
- Naveen Kumar 0013 — Motilal Nehru National Institute of Technology, Allahabad, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[c5]Naveen Kumar, Marcus Marrow:
Baseline wander cancelation on trellis for perpendicular magnetic recording. ICC 2015: 382-387- 2013
- [j2]Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka:
Error Analysis for ML Sequence Detection in ISI Channels With Gauss Markov Noise. IEEE Trans. Signal Process. 61(14): 3647-3652 (2013) - [c4]Naveen Kumar, Jason Bellorado, Marcus Marrow, Kai-Keung Chan:
Inter-track interference cancelation in presence of frequency offset for shingled magnetic recording. ICC 2013: 4342-4346 - 2010
- [j1]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Maximum-likelihood sequence detector for dynamic mode high density probe storage. IEEE Trans. Commun. 58(6): 1686-1694 (2010) - [c3]Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka:
Performance Evaluation for ML Sequence Detection in ISI Channels with Gauss Markov Noise. GLOBECOM 2010: 1-5 - [i2]Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka:
Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise. CoRR abs/1006.5036 (2010)
2000 – 2009
- 2009
- [c2]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Maximum-Likelihood Sequence Detector for Dynamic Mode High Density Probe Storage. GLOBECOM 2009: 1-6 - [i1]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Maximum-Likelihood Sequence Detector for Dynamic Mode High Density Probe Storage. CoRR abs/0908.1789 (2009) - 2008
- [c1]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Channel modeling and detector design for dynamic mode high density probe storage. CISS 2008: 1273-1278
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-10-30 20:29 CET 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:
