Nihar B. Shah
Title
Cited by
Cited by
Year
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
KV Rashmi*, NB Shah*, PV Kumar (* = equal contribution)
Information Theory, IEEE Transactions on 57 (8), 5227-5239, 2011
7552011
Explicit construction of optimal exact regenerating codes for distributed storage
KV Rashmi*, NB Shah*, PV Kumar, ...
Communication, Control, and Computing, 2009. Allerton 2009. 47th Annual …, 2009
3272009
Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff
NB Shah*, KV Rashmi*, PV Kumar, ...
Information Theory, IEEE Transactions on 58 (3), 1837-1852, 2012
2902012
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster
KV Rashmi, NB Shah, D Gu, H Kuang, D Borthakur, K Ramchandran
USENIX HotStorage 2013, 2013
2672013
A" hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
KV Rashmi, NB Shah, D Gu, H Kuang, D Borthakur, K Ramchandran
Proceedings of the 2014 ACM Conference on SIGCOMM, 331-342, 2014
2442014
Interference alignment in regenerating codes for distributed storage: Necessity and code constructions
NB Shah*, KV Rashmi*, PV Kumar, ...
Information Theory, IEEE Transactions on 58 (4), 2134-2158, 2012
2352012
When Do Redundant Requests Reduce Latency?
NB Shah, K Lee, K Ramchandran
51st Allerton Conference on Communication, Control, and Computing, 2013
2062013
One extra bit of download ensures perfectly private information retrieval
NB Shah, KV Rashmi, K Ramchandran
2014 IEEE International Symposium on Information Theory, 856-860, 2014
1742014
The MDS queue: Analysing the latency performance of erasure codes
K Lee, NB Shah, L Huang, K Ramchandran
IEEE Transactions on Information Theory 63 (5), 2822-2842, 2017
152*2017
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
NB Shah, S Balakrishnan, J Bradley, A Parekh, K Ramchandran, ...
Proceedings of the Eighteenth International Conference on Artificial …, 2015
139*2015
Having your cake and eating it too: Jointly optimal erasure codes for i/o, storage, and network-bandwidth
KV Rashmi, P Nakkiran, J Wang, NB Shah, K Ramchandran
13th {USENIX} Conference on File and Storage Technologies ({FAST} 15), 81-94, 2015
1352015
Stochastically transitive models for pairwise comparisons: Statistical and computational issues
N Shah, S Balakrishnan, A Guntuboyina, M Wainwright
IEEE Transactions on Information Theory, 2017
1332017
Information-theoretically Secure Regenerating Codes for Distributed Storage
NB Shah*, KV Rashmi*, PV Kumar (* = equal contribution)
IEEE Globecom 2011, 2011
1292011
Simple, robust and optimal ranking from pairwise comparisons
NB Shah, MJ Wainwright
The Journal of Machine Learning Research 18 (1), 7246-7283, 2017
1282017
Explicit codes minimizing repair bandwidth for distributed storage
NB Shah*, KV Rashmi*, PV Kumar, ...
Information Theory Workshop (ITW), 2010 IEEE, 1-5, 2010
1162010
Double or nothing: Multiplicative incentive mechanisms for crowdsourcing
NB Shah, D Zhou
Advances in neural information processing systems 28, 1-9, 2015
1132015
Explicit codes uniformly reducing repair bandwidth in distributed storage
NB Shah*, KV Rashmi*, PV Kumar, ...
Communications (NCC), 2010 National Conference on, 2010
113*2010
Regenerating Codes for Errors and Erasures in Distributed Storage
KV Rashmi*, NB Shah*, K Ramchandran*, ...
IEEE International Symposium on Information Theory (ISIT), 2012, 2012
1002012
A case for ordinal peer-evaluation in MOOCs
NB Shah, JK Bradley, A Parekh, M Wainwright, K Ramchandran
NIPS Workshop on Data Driven Education, 1-8, 2013
982013
Active ranking from pairwise comparisons and when parametric assumptions do not help
R Heckel, NB Shah, K Ramchandran, MJ Wainwright
The Annals of Statistics 47 (6), 3099-3126, 2019
90*2019
The system can't perform the operation now. Try again later.
Articles 1–20