Nihar B. Shah

Citirano

	Sve	Od 2020.
Citati	7130	3408
H-indeks	41	35
i10-indeks	70	64

780

390

195

585

201020112012201320142015201620172018201920202021202220232024202554 107 143 210 328 385 507 658 688 563 649 639 634 620 769 79

Javni pristup

Prikaži sve

41 članak

0 članaka

dostupno

nije dostupno

Na temelju uvjeta financiranja

Suautori

Kannan RamchandranProfessor of Electrical Engineering and Computer Science, UC BerkeleyPotvrđena adresa e-pošte na eecs.berkeley.edu
K. V. Rashmi (Rashmi Vinayak)Associate Professor, CS, Carnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
P Vijay KumarHon. Professor, Indian Institute of SciencePotvrđena adresa e-pošte na iisc.ac.in
Martin WainwrightProfessor, EECS/Mathematics, Massachusetts Institute of TechnologyPotvrđena adresa e-pošte na mit.edu
Ivan StelmakhCarnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Sivaraman BalakrishnanCarnegie Mellon UniversityPotvrđena adresa e-pošte na stat.cmu.edu
Aarti SinghProfessor of Machine Learning Department, Carnegie Mellon UniversityPotvrđena adresa e-pošte na cmu.edu
Abhay Parekh(Ex) Adjunct Professor, Electrical Engineering and Computer Science, U C BerkeleyPotvrđena adresa e-pošte na eecs.berkeley.edu
Jingyan WangToyota Technological Institute at ChicagoPotvrđena adresa e-pošte na ttic.edu
Denny ZhouResearch Scientist, Google DeepMindPotvrđena adresa e-pošte na google.com
Steven JecmenCarnegie Mellon UniversityPotvrđena adresa e-pošte na cs.cmu.edu
Kangwook LeeUniversity of Wisconsin-MadisonPotvrđena adresa e-pošte na wisc.edu
Charvi RastogiGoogle DeepMindPotvrđena adresa e-pošte na google.com
Fei FangCarnegie Mellon UniversityPotvrđena adresa e-pošte na cmu.edu
Ryan LiuPhD Student in Computer Science, Princeton UniversityPotvrđena adresa e-pošte na princeton.edu
Hal Daumé IIIAssociate Professor of Computer Science, University of MarylandPotvrđena adresa e-pošte na umiacs.umd.edu
Dhruba BorthakurHDFS, RocksDB, RocksetPotvrđena adresa e-pošte na rockset.com
Vincent ConitzerProfessor of CS, Carnegie Mellon University; Professor of CS and Philosophy, University of OxfordPotvrđena adresa e-pošte na cs.cmu.edu
Isabelle GuyonDirector of Research, Google; Prof. UPSaclay; President ChaLearnPotvrđena adresa e-pošte na chalearn.org
Preetum NakkiranApple ML ResearchPotvrđena adresa e-pošte na cs.harvard.edu

Prati

Nihar B. Shah

ML and CS departments, Carnegie Mellon University

Potvrđena adresa e-pošte na cs.cmu.edu - Početna stranica

machine learning statistics social choice peer review


Naslov Poredaj po navodima Poredaj po godini Poredaj po naslovu	Citirano Citirano	Godina
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	886	2011
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	374	2013
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	340	2009
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	317	2012
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	305	2014
When Do Redundant Requests Reduce Latency? NB Shah, K Lee, K Ramchandran 51st Allerton Conference on Communication, Control, and Computing, 2013	257	2013
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	255	2012
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	231	2014
Simple, robust and optimal ranking from pairwise comparisons NB Shah, MJ Wainwright Journal of machine learning research 18 (199), 1-38, 2018	226	2018
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	225*	2015
Stochastically transitive models for pairwise comparisons: Statistical and computational issues N Shah, S Balakrishnan, A Guntuboyina, M Wainwright IEEE Transactions on Information Theory, 2017	191	2017
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	177	2015
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	176*	2017
Active ranking from pairwise comparisons and when parametric assumptions do not help R Heckel, NB Shah, K Ramchandran, MJ Wainwright	147	2019
Challenges, experiments, and computational solutions in peer review NB Shah Communications of the ACM 65 (6), 76-87, 2022	146*	2022
Information-theoretically Secure Regenerating Codes for Distributed Storage NB Shah, KV Rashmi, PV Kumar (* = equal contribution) IEEE Globecom 2011, 2011	140	2011
A piggybacking design framework for read-and download-efficient distributed storage codes KV Rashmi, NB Shah, K Ramchandran IEEE Transactions on Information Theory 63 (9), 5802-5820, 2017	132	2017
A case for ordinal peer-evaluation in MOOCs NB Shah, JK Bradley, A Parekh, M Wainwright, K Ramchandran NIPS workshop on data driven education 15, 67, 2013	130	2013
Double or nothing: Multiplicative incentive mechanisms for crowdsourcing NB Shah, D Zhou Journal of Machine Learning Research 17 (165), 1-52, 2016	129	2016
Design and analysis of the NIPS 2016 review process NB Shah, B Tabibian, K Muandet, I Guyon, U Von Luxburg Journal of machine learning research 19 (49), 1-34, 2018	120	2018

Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.

Članci 1–20

Godišnji broj citata

Dvostruki navodi

Spojeni navodi

Dodavanje suautoraSuautori

Prati

Citirano

Suautori