default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Nikhil Krishnan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Myna Vajha
, Vinayak Ramkumar, M. Nikhil Krishnan, P. Vijay Kumar:
Explicit Rate-Optimal Streaming Codes With Smaller Field Size. IEEE Trans. Inf. Theory 70(5): 3242-3261 (2024)- [c17]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan:
Streaming Codes for Three-Node Relay Networks with Burst Erasures. ISIT 2024: 1979-1984 - 2023
- [j11]Gustavo Kasper Facenda, M. Nikhil Krishnan, Elad Domanovitz, Silas L. Fong, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network. IEEE Trans. Inf. Theory 69(7): 4345-4360 (2023) - [c16]Muralee Nikhil Krishnan, MohammadReza Ebrahimi, Ashish J. Khisti:
Sequential Gradient Coding For Straggler Mitigation. ICLR 2023 - [c15]M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Explicit Information-Debt-Optimal Streaming Codes With Small Memory. ISIT 2023: 1112-1117 - [c14]M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. ISIT 2023: 2547-2552 - [i16]M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar:
Explicit Information-Debt-Optimal Streaming Codes With Small Memory. CoRR abs/2305.06303 (2023) - [i15]M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan:
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes. CoRR abs/2311.14116 (2023) - 2022
- [j10]Vinayak Ramkumar, Balaji Srinivasan Babu, Birenjith Sasidharan, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Codes for Distributed Storage. Found. Trends Commun. Inf. Theory 19(4): 547-813 (2022) - [c13]Vinayak Ramkumar, M. Nikhil Krishnan, Myna Vajha, P. Vijay Kumar:
On Information-Debt-Optimal Streaming Codes With Small Memory. ISIT 2022: 1578-1583 - [c12]Gustavo Kasper Facenda, Elad Domanovitz, M. Nikhil Krishnan, Ashish Khisti, Silas L. Fong, Wai-Tian Tan, John G. Apostolopoulos:
On State-Dependent Streaming Erasure Codes over the Three-Node Relay Network. ISIT 2022: 1951-1956 - [i14]Gustavo Kasper Facenda, M. Nikhil Krishnan, Elad Domanovitz, Silas L. Fong, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
Adaptive relaying for streaming erasure codes in a three node relay network. CoRR abs/2203.05102 (2022) - [i13]M. Nikhil Krishnan, MohammadReza Ebrahimi, Ashish Khisti:
Sequential Gradient Coding For Straggler Mitigation. CoRR abs/2211.13802 (2022) - 2021
- [j9]M. Nikhil Krishnan, Erfan Hosseini, Ashish Khisti:
Coded Sequential Matrix Multiplication for Straggler Mitigation. IEEE J. Sel. Areas Inf. Theory 2(3): 830-844 (2021) - [j8]M. Nikhil Krishnan, Erfan Hosseini, Ashish Khisti:
Sequential Gradient Coding for Packet-Loss Networks. IEEE J. Sel. Areas Inf. Theory 2(3): 919-930 (2021) - [j7]Mahdi Haghifam, M. Nikhil Krishnan, Ashish Khisti, Xiaoqing Zhu, Wai-Tian Tan, John G. Apostolopoulos:
On Streaming Codes With Unequal Error Protection. IEEE J. Sel. Areas Inf. Theory 2(4): 1165-1179 (2021) - [c11]Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, P. Vijay Kumar:
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. ISIT 2021: 736-741 - [c10]M. Nikhil Krishnan, Gustavo Kasper Facenda, Elad Domanovitz, Ashish Khisti, Wai-Tian Tan, John G. Apostolopoulos:
High Rate Streaming Codes Over the Three-Node Relay Network. ITW 2021: 1-6 - [i12]Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan, P. Vijay Kumar:
Explicit Rate-Optimal Streaming Codes with Smaller Field Size. CoRR abs/2105.04432 (2021) - 2020
- [j6]M. Nikhil Krishnan, Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar:
Simple Streaming Codes for Reliable, Low-Latency Communication. IEEE Commun. Lett. 24(2): 249-253 (2020) - [j5]M. Nikhil Krishnan, V. Lalitha, Sreeranjani Didugu:
Codes With Minimum Bandwidth Cooperative Local Regeneration. IEEE Commun. Lett. 24(12): 2669-2673 (2020) - [j4]M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar:
Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures. IEEE Trans. Inf. Theory 66(8): 4869-4891 (2020) - [c9]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. ISIT 2020: 503-508 - [c8]M. Nikhil Krishnan, Seyederfan Hosseini, Ashish Khisti:
Coded Sequential Matrix Multiplication For Straggler Mitigation. NeurIPS 2020 - [i11]Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan, P. Vijay Kumar:
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes. CoRR abs/2005.07113 (2020) - [i10]Vinayak Ramkumar, Myna Vajha, S. B. Balaji, M. Nikhil Krishnan, Birenjith Sasidharan, P. Vijay Kumar:
Codes for Distributed Storage. CoRR abs/2010.01344 (2020)
2010 – 2019
- 2019
- [c7]M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar:
A Quadratic Field-Size Rate-Optimal Streaming Code for Channels with Burst and Random Erasures. ISIT 2019: 852-856 - [i9]M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar:
Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures. CoRR abs/1903.06210 (2019) - 2018
- [j3]Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar:
Erasure coding for distributed storage: an overview. Sci. China Inf. Sci. 61(10): 100301:1-100301:45 (2018) - [j2]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
Exploiting Locality for Improved Decoding of Binary Cyclic Codes. IEEE Trans. Commun. 66(6): 2346-2358 (2018) - [c6]M. Nikhil Krishnan, Anantha Narayanan R., P. Vijay Kumar:
Codes with Combined Locality and Regeneration Having Optimal Rate, $d_{\min}$ and Linear Field Size. ISIT 2018: 1196-1200 - [c5]M. Nikhil Krishnan, P. Vijay Kumar:
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. ISIT 2018: 1809-1813 - [i8]M. Nikhil Krishnan, P. Vijay Kumar:
Rate-Optimal Streaming Codes for Channels with Burst and Isolated Erasures. CoRR abs/1801.05919 (2018) - [i7]M. Nikhil Krishnan, Anantha Narayanan R., P. Vijay Kumar:
Codes with Combined Locality and Regeneration Having Optimal Rate, dmin and Linear Field Size. CoRR abs/1804.00564 (2018) - [i6]Balaji Srinivasan Babu, M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar, Birenjith Sasidharan, P. Vijay Kumar:
Erasure Coding for Distributed Storage: An Overview. CoRR abs/1806.04437 (2018) - 2017
- [c4]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A study on the impact of locality in the decoding of binary cyclic codes. ISIT 2017: 176-180 - [i5]M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar, Itzhak Tamo, Alexander Barg:
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes. CoRR abs/1702.03786 (2017) - 2016
- [j1]Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor, P. Vijay Kumar:
Outer bounds on the storage-repair bandwidth trade-off of exact-repair regenerating codes. Int. J. Inf. Coding Theory 3(4): 255-298 (2016) - [c3]Muralee Nikhil Krishnan, P. Vijay Kumar:
On MBR codes with replication. ISIT 2016: 71-75 - [i4]M. Nikhil Krishnan, P. Vijay Kumar:
On MBR codes with replication. CoRR abs/1601.08190 (2016) - [i3]Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan, Myna Vajha, Kaushik Senthoor, P. Vijay Kumar:
Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes. CoRR abs/1606.04467 (2016) - 2015
- [c2]N. Prakash, M. Nikhil Krishnan:
The storage-repair-bandwidth trade-off of exact repair linear regenerating codes for the case d = k = n - 1. ISIT 2015: 859-863 - [i2]N. Prakash, M. Nikhil Krishnan:
The Storage-Repair-Bandwidth Trade-off of Exact Repair Linear Regenerating Codes for the Case $d = k = n-1$. CoRR abs/1501.03983 (2015) - 2014
- [c1]M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi:
Evaluation of Codes with Inherent Double Replication for Hadoop. HotStorage 2014 - [i1]M. Nikhil Krishnan, N. Prakash, V. Lalitha, Birenjith Sasidharan, P. Vijay Kumar, Srinivasan Narayanamurthy, Ranjit Kumar, Siddhartha Nandi:
Evaluation of Codes with Inherent Double Replication for Hadoop. CoRR abs/1406.6783 (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-10-12 23:01 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:
