default search action
Nihar B. Shah
Nihar Bhadresh Shah
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
- affiliation (former): University of California, Berkeley, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i70]Steven Jecmen, Nihar B. Shah, Fei Fang, Leman Akoglu:
On the Detection of Reviewer-Author Collusion Rings From Paper Bidding. CoRR abs/2402.07860 (2024) - [i69]Charvi Rastogi, Xiangchen Song, Zhijing Jin, Ivan Stelmakh, Hal Daumé III, Kun Zhang, Nihar B. Shah:
A Randomized Controlled Trial on Anonymizing Reviewers to Each Other in Peer Review Discussions. CoRR abs/2403.01015 (2024) - [i68]Ilia Kuznetsov, Osama Mohammed Afzal, Koen Dercksen, Nils Dycke, Alexander Goldberg, Tom Hope, Dirk Hovy, Jonathan K. Kummerfeld, Anne Lauscher, Kevin Leyton-Brown, Sheng Lu, Mausam, Margot Mieskes, Aurélie Névéol, Danish Pruthi, Lizhen Qu, Roy Schwartz, Noah A. Smith, Thamar Solorio, Jingyan Wang, Xiaodan Zhu, Anna Rogers, Nihar B. Shah, Iryna Gurevych:
What Can Natural Language Processing Do for Peer Review? CoRR abs/2405.06563 (2024) - [i67]John M. Carpenter, Andrea Corvillón, Nihar B. Shah:
Enhancing Peer Review in Astronomy: A Machine Learning and Optimization Approach to Reviewer Assignments for ALMA. CoRR abs/2410.10009 (2024) - [i66]Iryna Gurevych, Anna Rogers, Nihar B. Shah, Jingyan Wang:
Reviewer No. 2: Old and New Problems in Peer Review (Dagstuhl Seminar 24052). Dagstuhl Reports 14(1): 130-161 (2024) - 2023
- [j30]Vijay Kamble
, Nihar B. Shah, David Marn, Abhay Parekh, Kannan Ramchandran:
The Square Root Agreement Rule for Incentivizing Truthful Feedback on Online Platforms. Manag. Sci. 69(1): 377-403 (2023) - [j29]Alexander Goldberg
Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection. Proc. ACM Meas. Anal. Comput. Syst. 7(1): 22:1-22:41 (2023) - [j28]Joon Sik Kim, Valerie Chen, Danish Pruthi, Nihar B. Shah, Ameet Talwalkar:
Assisting Human Decisions in Document Matching. Trans. Mach. Learn. Res. 2023 (2023) - [c54]Martin Saveski, Steven Jecmen, Nihar B. Shah, Johan Ugander:
Counterfactual Evaluation of Peer-Review Assignment Policies. NeurIPS 2023 - [c53]Alexander Goldberg
Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection. SIGMETRICS (Abstracts) 2023: 89-90 - [c52]Steven Jecmen
A Dataset on Malicious Paper Bidding in Peer Review. WWW 2023: 3816-3826 - [i65]Nihar B. Shah:
The Role of Author Identities in Peer Review. CoRR abs/2301.00221 (2023) - [i64]Joon Sik Kim, Valerie Chen, Danish Pruthi, Nihar B. Shah, Ameet Talwalkar:
Assisting Human Decisions in Document Matching. CoRR abs/2302.08450 (2023) - [i63]Ivan Stelmakh, John Wieting, Graham Neubig, Nihar B. Shah:
A Gold Standard Dataset for the Reviewer Assignment Problem. CoRR abs/2303.16750 (2023) - [i62]Martin Saveski, Steven Jecmen, Nihar B. Shah, Johan Ugander:
Counterfactual Evaluation of Peer-Review Assignment Policies. CoRR abs/2305.17339 (2023) - [i61]Ryan Liu, Nihar B. Shah:
ReviewerGPT? An Exploratory Study on Using Large Language Models for Paper Reviewing. CoRR abs/2306.00622 (2023) - [i60]Ryan Liu, Steven Jecmen, Vincent Conitzer, Fei Fang, Nihar B. Shah:
Testing for Reviewer Anchoring in Peer Review: A Randomized Controlled Trial. CoRR abs/2307.05443 (2023) - [i59]Alexander Goldberg, Ivan Stelmakh, Kyunghyun Cho, Alice H. Oh, Alekh Agarwal, Danielle Belgrave, Nihar B. Shah:
Peer Reviews of Peer Reviews: A Randomized Controlled Trial and Other Experiments. CoRR abs/2311.09497 (2023) - 2022
- [j27]Nihar B. Shah:
Challenges, experiments, and computational solutions in peer review. Commun. ACM 65(6): 76-87 (2022) - [j26]Charvi Rastogi, Sivaraman Balakrishnan, Nihar B. Shah, Aarti Singh:
Two-Sample Testing on Ranked Preference Data and the Role of Modeling Assumptions. J. Mach. Learn. Res. 23: 225:1-225:48 (2022) - [j25]Kangwook Lee
Addendum and Erratum to "The MDS Queue: Analysing the Latency Performance of Erasure Codes". IEEE Trans. Inf. Theory 68(9): 5850-5851 (2022) - [j24]Yusha Liu, Yichong Xu, Nihar B. Shah, Aarti Singh:
Integrating Rankings into Quantized Scores in Peer Review. Trans. Mach. Learn. Res. 2022 (2022) - [c51]Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah:
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. AAMAS 2022: 1642-1644 - [c50]Komal Dhull, Steven Jecmen, Pravesh Kothari, Nihar B. Shah:
Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise. HCOMP 2022: 53-63 - [c49]Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah:
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. HCOMP 2022: 102-113 - [c48]Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? HCOMP 2022: 207-218 - [c47]Wenxin Ding, Gautam Kamath
Calibration with Privacy in Peer Review. ISIT 2022: 1635-1640 - [c46]Charvi Rastogi, Ivan Stelmakh, Nihar B. Shah, Sivaraman Balakrishnan:
No Rose for MLE: Inadmissibility of MLE for Evaluation Aggregation Under Levels of Expertise. ISIT 2022: 3168-3173 - [i58]Komal Dhull, Steven Jecmen, Pravesh Kothari, Nihar B. Shah:
The Price of Strategyproofing Peer Assessment. CoRR abs/2201.10631 (2022) - [i57]Wenxin Ding, Gautam Kamath, Weina Wang, Nihar B. Shah:
Calibration with Privacy in Peer Review. CoRR abs/2201.11308 (2022) - [i56]Ivan Stelmakh, Charvi Rastogi, Ryan Liu, Shuchi Chawla, Federico Echenique, Nihar B. Shah:
Cite-seeing and Reviewing: A Study on Citation Bias in Peer Review. CoRR abs/2203.17239 (2022) - [i55]Charvi Rastogi, Ivan Stelmakh, Xinwei Shen, Marina Meila, Federico Echenique, Shuchi Chawla, Nihar B. Shah:
To ArXiv or not to ArXiv: A Study Quantifying Pros and Cons of Posting Preprints Online. CoRR abs/2203.17259 (2022) - [i54]Yusha Liu, Yichong Xu, Nihar B. Shah, Aarti Singh:
Integrating Rankings into Quantized Scores in Peer Review. CoRR abs/2204.03505 (2022) - [i53]Steven Jecmen, Minji Yoon, Vincent Conitzer, Nihar B. Shah, Fei Fang
A Dataset on Malicious Paper Bidding in Peer Review. CoRR abs/2207.02303 (2022) - [i52]Steven Jecmen, Nihar B. Shah, Fei Fang
Tradeoffs in Preventing Manipulation in Paper Bidding for Reviewer Assignment. CoRR abs/2207.11315 (2022) - [i51]Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? CoRR abs/2209.08665 (2022) - [i50]Alexander Goldberg, Giulia Fanti, Nihar B. Shah:
Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection. CoRR abs/2211.12686 (2022) - [i49]Charvi Rastogi, Ivan Stelmakh, Alina Beygelzimer, Yann N. Dauphin, Percy Liang, Jennifer Wortman Vaughan, Zhenyu Xue, Hal Daumé III, Emma Pierson, Nihar B. Shah:
How do Authors' Perceptions of their Papers Compare with Co-authors' Perceptions and Peer-review Decisions? CoRR abs/2211.12966 (2022) - 2021
- [j23]Ritesh Noothigattu, Nihar B. Shah, Ariel D. Procaccia:
Loss Functions, Axioms, and Peer Review. J. Artif. Intell. Res. 70: 1481-1515 (2021) - [j22]Ivan Stelmakh, Nihar B. Shah, Aarti Singh:
PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. J. Mach. Learn. Res. 22: 163:1-163:66 (2021) - [j21]Ivan Stelmakh, Nihar B. Shah, Aarti Singh, Hal Daumé III:
Prior and Prejudice: The Novice Reviewers' Bias against Resubmissions in Conference Peer Review. Proc. ACM Hum. Comput. Interact. 5(CSCW1): 75:1-75:17 (2021) - [j20]Nihar B. Shah
A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness. IEEE Trans. Inf. Theory 67(6): 4162-4184 (2021) - [c45]Emaad A. Manzoor, Nihar B. Shah:
Uncovering Latent Biases in Text: Method and Application to Peer Review. AAAI 2021: 4767-4775 - [c44]Ivan Stelmakh, Nihar B. Shah, Aarti Singh, Hal Daumé III:
A Novice-Reviewer Experiment to Address Scarcity of Qualified Reviewers in Large Conferences. AAAI 2021: 4785-4793 - [c43]Ivan Stelmakh, Nihar B. Shah, Aarti Singh:
Catch Me if I Can: Detecting Strategic Behaviour in Peer Assessment. AAAI 2021: 4794-4802 - [c42]Jingyan Wang, Ivan Stelmakh, Yuting Wei, Nihar B. Shah:
Debiasing Evaluations That Are Biased by Evaluations. AAAI 2021: 10120-10128 - [c41]Nihar B. Shah:
JCDL 2021 Tutorial on Systemic Challenges and Computational Solutions on Bias and Unfairness in Peer Review. JCDL 2021: 356-357 - [c40]Nihar B. Shah:
KDD 2021 Tutorial on Systemic Challenges and Solutions on Bias and Unfairness in Peer Review. KDD 2021: 4066-4067 - [c39]Komal Dhull, Jingyan Wang, Nihar B. Shah, Yuanzhi Li, R. Ravi:
A heuristic for statistical seriation. UAI 2021: 621-631 - [c38]Nihar B. Shah:
WSDM 2021 Tutorial on Systematic Challenges and Computational Solutions on Bias and Unfairness in Peer Review. WSDM 2021: 1131-1133 - [i48]Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah:
Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. CoRR abs/2108.06371 (2021) - 2020
- [j19]Nihar B. Shah, Dengyong Zhou:
Approval Voting and Incentives in Crowdsourcing. ACM Trans. Economics and Comput. 8(3): 13:1-13:40 (2020) - [c37]Jingyan Wang, Nihar B. Shah:
Ranking and Rating Rankings and Ratings. AAAI 2020: 13704-13707 - [c36]Jingyan Wang, Nihar B. Shah, R. Ravi:
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons. AISTATS 2020: 66-76 - [c35]Charvi Rastogi, Sivaraman Balakrishnan, Nihar B. Shah, Aarti Singh:
Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions. ISIT 2020: 1271-1276 - [c34]Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, Fei Fang:
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments. NeurIPS 2020 - [c33]Nihar B. Shah, Zachary C. Lipton:
SIGMOD 2020 Tutorial on Fairness and Bias in Peer Review and Other Sociotechnical Intelligent Systems. SIGMOD Conference 2020: 2637-2640 - [c32]Tanner Fiez, Nihar B. Shah, Lillian J. Ratliff:
A SUPER* Algorithm to Optimize Paper Bidding in Peer Review. UAI 2020: 580-589 - [i47]Charvi Rastogi, Sivaraman Balakrishnan, Nihar B. Shah, Aarti Singh:
Two-Sample Testing on Ranked Preference Data and the Role of Modeling Assumptions. CoRR abs/2006.11909 (2020) - [i46]Wenxin Ding, Nihar B. Shah, Weina Wang:
On the Privacy-Utility Tradeoff in Peer-Review Data Analysis. CoRR abs/2006.16385 (2020) - [i45]Steven Jecmen, Hanrui Zhang, Ryan Liu, Nihar B. Shah, Vincent Conitzer, Fei Fang:
Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments. CoRR abs/2006.16437 (2020) - [i44]Tanner Fiez, Nihar B. Shah, Lillian J. Ratliff:
A SUPER* Algorithm to Optimize Paper Bidding in Peer Review. CoRR abs/2007.07079 (2020) - [i43]Ivan Stelmakh, Nihar B. Shah, Aarti Singh:
Catch Me if I Can: Detecting Strategic Behaviour in Peer Assessment. CoRR abs/2010.04041 (2020) - [i42]Emaad A. Manzoor, Nihar B. Shah:
Uncovering Latent Biases in Text: Method and Application to Peer Review. CoRR abs/2010.15300 (2020) - [i41]Ivan Stelmakh, Nihar B. Shah, Aarti Singh, Hal Daumé III:
Prior and Prejudice: The Novice Reviewers' Bias against Resubmissions in Conference Peer Review. CoRR abs/2011.14646 (2020) - [i40]Ivan Stelmakh, Nihar B. Shah, Aarti Singh, Hal Daumé III:
A Novice-Reviewer Experiment to Address Scarcity of Qualified Reviewers in Large Conferences. CoRR abs/2011.15050 (2020) - [i39]Ivan Stelmakh, Charvi Rastogi, Nihar B. Shah, Aarti Singh, Hal Daumé III:
A Large Scale Randomized Controlled Trial on Herding in Peer-Review Discussions. CoRR abs/2011.15083 (2020) - [i38]Jingyan Wang, Ivan Stelmakh, Yuting Wei, Nihar B. Shah:
Debiasing Evaluations That are Biased by Evaluations. CoRR abs/2012.00714 (2020)
2010 – 2019
- 2019
- [j18]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-rank Matrices: Structural Properties and Noisy Completion. J. Mach. Learn. Res. 20: 101:1-101:43 (2019) - [j17]Nihar B. Shah
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. IEEE Trans. Inf. Theory 65(8): 4854-4874 (2019) - [c31]Ivan Stelmakh, Nihar B. Shah, Aarti Singh:
PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. ALT 2019: 827-855 - [c30]Jingyan Wang, Nihar B. Shah:
Your 2 is My 1, Your 3 is My 9: Handling Arbitrary Miscalibrations in Ratings. AAMAS 2019: 864-872 - [c29]Yichong Xu, Han Zhao, Xiaofei Shi
On Strategyproof Conference Peer Review. IJCAI 2019: 616-622 - [c28]Ivan Stelmakh, Nihar B. Shah, Aarti Singh:
On Testing for Biases in Peer Review. NeurIPS 2019: 5287-5297 - [i37]Jingyan Wang, Nihar B. Shah, R. Ravi:
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons. CoRR abs/1906.04066 (2019) - 2018
- [j16]Yuan Luo
Parametric Prediction from Parametric Agents. Oper. Res. 66(2): 313-326 (2018) - [j15]Nihar B. Shah, Behzad Tabibian, Krikamol Muandet, Isabelle Guyon, Ulrike von Luxburg:
Design and Analysis of the NIPS 2016 Review Process. J. Mach. Learn. Res. 19: 49:1-49:34 (2018) - [j14]K. V. Rashmi
Information-Theoretically Secure Erasure Codes for Distributed Storage. IEEE Trans. Inf. Theory 64(3): 1621-1646 (2018) - [c27]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-Rank Matrices: Structural Properties and Noisy Completion. ISIT 2018: 366-370 - [i36]Jingyan Wang, Nihar B. Shah:
Your 2 is My 1, Your 3 is My 9: Handling Arbitrary Miscalibrations in Ratings. CoRR abs/1806.05085 (2018) - [i35]Ivan Stelmakh, Nihar B. Shah, Aarti Singh:
PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. CoRR abs/1806.06237 (2018) - [i34]Yichong Xu, Han Zhao, Xiaofei Shi, Nihar B. Shah:
On Strategyproof Conference Peer Review. CoRR abs/1806.06266 (2018) - [i33]Ritesh Noothigattu, Nihar B. Shah, Ariel D. Procaccia:
Choosing How to Choose Papers. CoRR abs/1808.09057 (2018) - [i32]Susu Xu, Weiguang Mao, Yue Cao, Hae Young Noh, Nihar B. Shah:
An Incentive Mechanism for Crowd Sensing with Colluding Agents. CoRR abs/1809.05161 (2018) - 2017
- [b1]Nihar Bhadresh Shah:
Learning From People. University of California, Berkeley, USA, 2017 - [j13]Nihar B. Shah, Martin J. Wainwright:
Simple, Robust and Optimal Ranking from Pairwise Comparisons. J. Mach. Learn. Res. 18: 199:1-199:38 (2017) - [j12]Nihar B. Shah
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. IEEE Trans. Inf. Theory 63(2): 934-959 (2017) - [j11]Kangwook Lee
The MDS Queue: Analysing the Latency Performance of Erasure Codes. IEEE Trans. Inf. Theory 63(5): 2822-2842 (2017) - [j10]K. V. Rashmi
A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes. IEEE Trans. Inf. Theory 63(9): 5802-5820 (2017) - [i31]Nihar B. Shah, Behzad Tabibian, Krikamol Muandet
Design and Analysis of the NIPS 2016 Review Process. CoRR abs/1708.09794 (2017) - [i30]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Low Permutation-rank Matrices: Structural Properties and Noisy Completion. CoRR abs/1709.00127 (2017) - 2016
- [j9]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. J. Mach. Learn. Res. 17: 58:1-58:47 (2016) - [j8]Nihar B. Shah, Dengyong Zhou:
Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing. J. Mach. Learn. Res. 17: 165:1-165:52 (2016) - [j7]Nihar B. Shah, Kangwook Lee, Kannan Ramchandran:
When Do Redundant Requests Reduce Latency? IEEE Trans. Commun. 64(2): 715-722 (2016) - [c26]Baiyu Chen, Sergio Escalera
Overcoming Calibration Problems in Pattern Labeling with Pairwise Ratings: Application to Personality Traits. ECCV Workshops (3) 2016: 419-432 - [c25]Nihar B. Shah, Dengyong Zhou:
No Oops, You Won't Do It Again: Mechanisms for Self-correction in Crowdsourcing. ICML 2016: 1-10 - [c24]Nihar B. Shah, Sivaraman Balakrishnan, Aditya Guntuboyina, Martin J. Wainwright:
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. ICML 2016: 11-20 - [c23]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright
Feeling the bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisons. ISIT 2016: 1153-1157 - [i29]Yuan Luo, Nihar B. Shah, Jianwei Huang, Jean C. Walrand:
Parametric Prediction from Parametric Agents. CoRR abs/1602.07435 (2016) - [i28]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. CoRR abs/1603.06881 (2016) - [i27]Reinhard Heckel, Nihar B. Shah, Kannan Ramchandran, Martin J. Wainwright:
Active Ranking from Pairwise Comparisons and the Futility of Parametric Assumptions. CoRR abs/1606.08842 (2016) - [i26]Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright:
A Permutation-based Model for Crowd Labeling: Optimal Estimation and Robustness. CoRR abs/1606.09632 (2016) - 2015
- [j6]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Distributed Secret Dissemination Across a Network. IEEE J. Sel. Top. Signal Process. 9(7): 1206-1216 (2015) - [j5]Yuan Luo, Nihar B. Shah, Jianwei Huang, Jean C. Walrand:
Parametric Prediction from Parametric Agents? SIGMETRICS Perform. Evaluation Rev. 43(3): 57 (2015) - [c22]Nihar B. Shah, Dengyong Zhou:
On the Impossibility of Convex Inference in Human Computation. AAAI 2015: 1291-1297 - [c21]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. AISTATS 2015 - [c20]K. V. Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, Kannan Ramchandran:
Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth. FAST 2015: 81-94 - [c19]Nihar B. Shah, Dengyong Zhou, Yuval Peres:
Approval Voting and Incentives in Crowdsourcing. ICML 2015: 10-19 - [c18]Nihar Bhadresh Shah, Denny Zhou:
Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing. NIPS 2015: 1-9 - [i25]Nihar B. Shah, Dengyong Zhou, Yuval Peres:
Approval Voting and Incentives in Crowdsourcing. CoRR abs/1502.05696 (2015) - [i24]Dengyong Zhou, Qiang Liu, John C. Platt
Regularized Minimax Conditional Entropy for Crowdsourcing. CoRR abs/1503.07240 (2015) - [i23]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. CoRR abs/1505.01462 (2015) - [i22]Vijay Kamble, Nihar B. Shah, David Marn, Abhay Parekh, Kannan Ramchandran:
Truth Serums for Massively Crowdsourced Evaluation Tasks. CoRR abs/1507.07045 (2015) - [i21]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran, P. Vijay Kumar:
Information-theoretically Secure Erasure Codes for Distributed Storage. CoRR abs/1508.03787 (2015) - [i20]Nihar B. Shah, Sivaraman Balakrishnan, Adityanand Guntuboyina, Martin J. Wainwright:
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. CoRR abs/1510.05610 (2015) - [i19]Nihar B. Shah, Martin J. Wainwright:
Simple, Robust and Optimal Ranking from Pairwise Comparisons. CoRR abs/1512.08949 (2015) - 2014
- [c17]Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi:
Fundamental limits on communication for oblivious updates in storage networks. GLOBECOM 2014: 2363-2368 - [c16]Birenjith Sasidharan
Optimality of the product-matrix construction for secure MSR regenerating codes. ISCCSP 2014: 10-14 - [c15]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
One extra bit of download ensures perfectly private information retrieval. ISIT 2014: 856-860 - [c14]Nihar B. Shah, Kangwook Lee, Kannan Ramchandran:
The MDS queue: Analysing the latency performance of erasure codes. ISIT 2014: 861-865 - [c13]K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran:
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers. SIGCOMM 2014: 331-342 - [i18]Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright:
When is it Better to Compare than to Score? CoRR abs/1406.6618 (2014) - [i17]Nihar B. Shah, Dengyong Zhou:
Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing. CoRR abs/1408.1387 (2014) - [i16]Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi:
Fundamental Limits on Communication for Oblivious Updates in Storage Networks. CoRR abs/1409.1666 (2014) - [i15]Nihar B. Shah, Dengyong Zhou:
On the Impossibility of Convex Inference in Human Computation. CoRR abs/1411.5977 (2014) - 2013
- [j4]Nihar B. Shah:
On Minimizing Data-Read and Download for Storage-Node Recovery. IEEE Commun. Lett. 17(5): 964-967 (2013) - [c12]Nihar B. Shah, Kangwook Lee, Kannan Ramchandran:
When do redundant requests reduce latency ? Allerton 2013: 731-738 - [c11]K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran:
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster. HotStorage 2013 - [c10]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran:
A piggybacking design framework for read-and download-efficient distributed storage codes. ISIT 2013: 331-335 - [c9]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Secure network coding for distributed secret sharing with low communication cost. ISIT 2013: 2404-2408 - [i14]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran:
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes. CoRR abs/1302.5872 (2013) - [i13]K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran:
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster. CoRR abs/1309.0186 (2013) - [i12]Nihar B. Shah, Kangwook Lee, Kannan Ramchandran:
When Do Redundant Requests Reduce Latency ? CoRR abs/1311.2851 (2013) - 2012
- [j3]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff. IEEE Trans. Inf. Theory 58(3): 1837-1852 (2012) - [j2]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions. IEEE Trans. Inf. Theory 58(4): 2134-2158 (2012) - [c8]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating codes for errors and erasures in distributed storage. ISIT 2012: 1202-1206 - [i11]K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar:
Regenerating Codes for Errors and Erasures in Distributed Storage. CoRR abs/1202.1050 (2012) - [i10]Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran:
Secret Share Dissemination across a Network. CoRR abs/1207.0120 (2012) - [i9]Nihar B. Shah, Kangwook Lee, Kannan Ramchandran:
The MDS Queue. CoRR abs/1211.5405 (2012) - [i8]Nihar B. Shah:
On Minimizing Disk-read and Download for Storage-Node Recovery. CoRR abs/1212.6952 (2012) - 2011
- [j1]Korlakai Vinayak Rashmi, Nihar B. Shah, P. Vijay Kumar:
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. IEEE Trans. Inf. Theory 57(8): 5227-5239 (2011) - [c7]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
Information-Theoretically Secure Regenerating Codes for Distributed Storage. GLOBECOM 2011: 1-5 - [c6]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling node repair in any erasure code for distributed storage. ISIT 2011: 1235-1239 - [i7]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Enabling Node Repair in Any Erasure Code for Distributed Storage. CoRR abs/1101.0133 (2011) - [i6]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
Information-theoretically Secure Regenerating Codes for Distributed Storage. CoRR abs/1107.5279 (2011) - 2010
- [c5]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage. ISIT 2010: 1938-1942 - [c4]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar:
A flexible class of regenerating codes for distributed storage. ISIT 2010: 1943-1947 - [c3]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Explicit and optimal codes for distributed storage. ITA 2010: 240-244 - [c2]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Regenerating Codes for Distributed Storage Networks. WAIFI 2010: 215-223 - [i5]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
The MISER Code: An MDS Distributed Storage Code that Minimizes Repair Bandwidth for Systematic Nodes through Interference Alignment. CoRR abs/1005.1634 (2010) - [i4]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar:
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction. CoRR abs/1005.4178 (2010) - [i3]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Distributed Storage Codes with Repair-by-Transfer and Non-achievability of Interior Points on the Storage-Bandwidth Tradeoff. CoRR abs/1011.2361 (2010)
2000 – 2009
- 2009
- [c1]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar
Explicit construction of optimal exact regenerating codes for distributed storage. Allerton 2009: 1243-1249 - [i2]K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Exact Regenerating Codes for Distributed Storage. CoRR abs/0906.4913 (2009) - [i1]Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran:
Explicit Codes Minimizing Repair Bandwidth for Distributed Storage. CoRR abs/0908.2984 (2009)
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-12-01 01:15 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: