default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDN. Prakash 0001
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, MA, USA
- affiliation (PhD 2015): Indian Institute of Science, Bangalore, India
Other persons with the same name
- N. Prakash — disambiguation page
- N. Prakash 0002
![[0000-0002-6873-425X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-6873-425X")
— National Institute of Technology Tiruchirappalli, India (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Alexandros Karargyris, Renato Umeton, Micah J. Sheller, Alejandro Aristizabal, Johnu George, Anna Wuest, Sarthak Pati, Hasan Kassem, Maximilian Zenk, Ujjwal Baid, Prakash Narayana Moorthy, Alexander Chowdhury, Junyi Guo, Sahil S. Nalawade, Jacob Rosenthal, David Kanter, Maria Xenochristou, Daniel J. Beutel, Verena Chung, Timothy Bergquist, James A. Eddy, Abubakar Abid, Lewis Tunstall, Omar Sanseviero, Dimitrios Dimitriadis, Yiming Qian, Xinxing Xu, Yong Liu, Rick Siow Mong Goh, Srini Bala, Victor Bittorf, Sreekar Reddy Puchala, Biagio Ricciuti, Soujanya Samineni, Eshna Sengupta, Akshay Chaudhari, Cody Coleman, Bala Desinghu, Gregory F. Diamos, Debo Dutta, Diane Feddema, Grigori Fursin, Xinyuan Huang, Satyananda Kashyap, Nicholas D. Lane, Indranil Mallick, Pietro Mascagni, Virendra Mehta, Cassiano Ferro Moraes, Vivek Natarajan, Nikola Nikolov, Nicolas Padoy, Gennady Pekhimenko, Vijay Janapa Reddi, G. Anthony Reina, Pablo Ribalta, Abhishek Singh, Jayaraman J. Thiagarajan, Jacob Albrecht, Thomas Wolf, Geralyn Miller, Huazhu Fu, Prashant Shah, Daguang Xu, Poonam Yadav, David Talby, Mark M. Awad, Jeremy P. Howard, Michael Rosenthal, Luigi Marchionni, Massimo Loda, Jason M. Johnson, Spyridon Bakas, Peter Mattson:
Federated benchmarking of medical artificial intelligence with MedPerf. Nat. Mac. Intell. 5(7): 799-810 (2023)- 2022
- [j9]Nicolas Nicolaou, Viveck R. Cadambe, N. Prakash, Andria Trigeorgi, Kishori M. Konwar, Muriel Médard, Nancy A. Lynch:
Ares: Adaptive, Reconfigurable, Erasure coded, Atomic Storage. ACM Trans. Storage 18(4): 33:1-33:39 (2022) - 2021
- [i17]G. Anthony Reina, Alexey Gruzdev, Patrick Foley, Olga Perepelkina, Mansi Sharma, Igor Davidyuk, Ilya Trushkin, Maksim Radionov, Aleksandr Mokrov, Dmitry Agapov, Jason Martin, Brandon Edwards, Micah J. Sheller, Sarthak Pati, Prakash Narayana Moorthy, Hans Shih-Han Wang, Prashant Shah, Spyridon Bakas:
OpenFL: An open-source framework for Federated Learning. CoRR abs/2105.06413 (2021)
2010 – 2019
- 2019
- [j8]N. Prakash, V. Lalitha, Balaji Srinivasan Babu, P. Vijay Kumar:
Codes With Locality for Two Erasures. IEEE Trans. Inf. Theory 65(12): 7771-7789 (2019) - [c15]Nicolas C. Nicolaou, Viveck R. Cadambe, N. Prakash, Kishori M. Konwar, Muriel Médard, Nancy A. Lynch:
ARES: Adaptive, Reconfigurable, Erasure Coded, Atomic Storage. ICDCS 2019: 2195-2205 - [c14]Kishori M. Konwar, N. Prakash, Muriel Médard, Nancy A. Lynch:
Fast Lean Erasure-Coded Atomic Memory Object. OPODIS 2019: 12:1-12:17 - 2018
- [j7]Milad Mahdian, N. Prakash, Muriel Médard, Edmund M. Yeh:
Updating Content in Cache-Aided Coded Multicast. IEEE J. Sel. Areas Commun. 36(6): 1203-1216 (2018) - [j6]N. Prakash, Vitaly Abdrashitov, Muriel Médard:
The Storage Versus Repair-Bandwidth Trade-off for Clustered Storage Systems. IEEE Trans. Inf. Theory 64(8): 5783-5805 (2018) - [j5]N. Prakash, Muriel Médard:
Communication Cost for Updating Linear Functions When Message Updates are Sparse: Connections to Maximally Recoverable Codes. IEEE Trans. Inf. Theory 64(12): 7557-7576 (2018) - [i16]Milad Mahdian, N. Prakash, Muriel Médard, Edmund M. Yeh:
Updating Content in Cache-Aided Coded Multicast. CoRR abs/1805.00396 (2018) - [i15]Viveck R. Cadambe, Nicolas C. Nicolaou, Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
ARES: Adaptive, Reconfigurable, Erasure coded, atomic Storage. CoRR abs/1805.03727 (2018) - 2017
- [c13]Vitaly Abdrashitov, N. Prakash, Muriel Médard:
The storage vs repair bandwidth trade-off for multiple failures in clustered storage networks. ITW 2017: 46-50 - [c12]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
A Layered Architecture for Erasure-Coded Consistent Distributed Storage. PODC 2017: 63-72 - [i14]N. Prakash, Vitaly Abdrashitov, Muriel Médard:
The Storage vs Repair-Bandwidth Trade-off for Clustered Storage Systems. CoRR abs/1701.04909 (2017) - [i13]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
A Layered Architecture for Erasure-Coded Consistent Distributed Storage. CoRR abs/1703.01286 (2017) - [i12]Vitaly Abdrashitov, N. Prakash, Muriel Médard:
The Storage vs Repair Bandwidth Trade-off for Multiple Failures in Clustered Storage Networks. CoRR abs/1708.05474 (2017) - 2016
- [j4]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) - [c11]Kishori M. Konwar, N. Prakash, Erez Kantor, Nancy A. Lynch, Muriel Médard, Alexander A. Schwarzmann:
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems. IPDPS 2016: 720-729 - [c10]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
RADON: Repairable Atomic Data Object in Networks. OPODIS 2016: 28:1-28:17 - [i11]N. Prakash, Muriel Médard:
Communication Cost for Updating Linear Functions when Message Updates are Sparse: Connections to Maximally Recoverable Codes. CoRR abs/1605.01105 (2016) - [i10]Kishori M. Konwar, N. Prakash, Erez Kantor, Nancy A. Lynch, Muriel Médard, Alexander A. Schwarzmann:
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems. CoRR abs/1605.01748 (2016) - [i9]Kishori M. Konwar, N. Prakash, Nancy A. Lynch, Muriel Médard:
RADON: Repairable Atomic Data Object in Networks. CoRR abs/1605.05717 (2016) - [i8]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
- [c9]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 - [i7]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
- [j3]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) - [c8]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 - [c7]N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with locality for two erasures. ISIT 2014: 1962-1966 - [i6]N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with Locality for Two Erasures. CoRR abs/1401.2422 (2014) - [i5]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) - 2013
- [j2]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. IEEE J. Sel. Areas Commun. 31(4): 678-690 (2013) - [c6]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 - [c5]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ISIT 2013: 1606-1610 - [c4]Govinda M. Kamath, N. Prakash, V. Lalitha, P. Vijay Kumar:
Codes with local regeneration. ITA 2013: 1-5 - [i4]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) - [i3]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. CoRR abs/1302.5021 (2013) - 2012
- [c3]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) - 2011
- [c2]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
A nested linear codes approach to distributed function computation over subspaces. Allerton 2011: 1202-1209 - 2010
- [j1]K. Vinodh, N. Prakash, V. Lalitha, P. Vijay Kumar:
DMT of Wireless Networks: An Overview (Invited Paper). J. Commun. 5(4): 265-281 (2010) - [c1]K. Vinodh, V. Lalitha, N. Prakash, P. Vijay Kumar, S. Sandeep Pradhan:
On the achievable rates of sources having a group alphabet in a distributed source coding setting. Allerton 2010: 479-486
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-07 21:24 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:
