| 2026 | AAAI | Who Is a Better Matchmaker? Human vs. Algorithmic Judge Assignment in a High-Stakes Startup Competition. | Yang Xi, Orelia Pi, Miaomiao Zhang, Rebecca Xiong, Jacqueline Ng Lane, Nihar B. Shah |
| 2025 | KDD | Benchmarking Fraud Detectors on Private Graph Data. | Alexander Goldberg, Giulia Fanti, Nihar B. Shah, Steven Wu |
| 2023 | WWW | A Dataset on Malicious Paper Bidding in Peer Review. | Steven Jecmen, Minji Yoon, Vincent Conitzer, Nihar B. Shah, Fei Fang |
| 2023 | SIGMETRICS | Batching of Tasks by Users of Pseudonymous Forums: Anonymity Compromise and Protection. | Alexander Goldberg, Giulia Fanti, Nihar B. Shah |
| 2022 | HCOMP | Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? | Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley, R. Ravi |
| 2022 | HCOMP | Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise. | Komal Dhull, Steven Jecmen, Pravesh Kothari, Nihar B. Shah |
| 2022 | HCOMP | Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. | Steven Jecmen, Hanrui Zhang, Ryan Liu, Fei Fang, Vincent Conitzer, Nihar B. Shah |
| 2022 | ISIT | Calibration with Privacy in Peer Review. | Wenxin Ding, Gautam Kamath, Weina Wang, Nihar B. Shah |
| 2022 | ISIT | No Rose for MLE: Inadmissibility of MLE for Evaluation Aggregation Under Levels of Expertise. | Charvi Rastogi, Ivan Stelmakh, Nihar B. Shah, Sivaraman Balakrishnan |
| 2021 | AAAI | Debiasing Evaluations That Are Biased by Evaluations. | Jingyan Wang, Ivan Stelmakh, Yuting Wei, Nihar B. Shah |
| 2021 | AAAI | Uncovering Latent Biases in Text: Method and Application to Peer Review. | Emaad A. Manzoor, Nihar B. Shah |
| 2021 | AAAI | Catch Me if I Can: Detecting Strategic Behaviour in Peer Assessment. | Ivan Stelmakh, Nihar B. Shah, Aarti Singh |
| 2021 | AAAI | A Novice-Reviewer Experiment to Address Scarcity of Qualified Reviewers in Large Conferences. | Ivan Stelmakh, Nihar B. Shah, Aarti Singh, Hal Daum III |
| 2021 | KDD | KDD 2021 Tutorial on Systemic Challenges and Solutions on Bias and Unfairness in Peer Review. | Nihar B. Shah |
| 2021 | UAI | A heuristic for statistical seriation. | Komal Dhull, Jingyan Wang, Nihar B. Shah, Yuanzhi Li, R. Ravi |
| 2021 | WSDM | WSDM 2021 Tutorial on Systematic Challenges and Computational Solutions on Bias and Unfairness in Peer Review. | Nihar B. Shah |
| 2020 | AAAI | Ranking and Rating Rankings and Ratings. | Jingyan Wang, Nihar B. Shah |
| 2020 | AISTATS | Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons. | Jingyan Wang, Nihar B. Shah, R. Ravi |
| 2020 | ISIT | Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions. | Charvi Rastogi, Sivaraman Balakrishnan, Nihar B. Shah, Aarti Singh |
| 2020 | SIGMOD | SIGMOD 2020 Tutorial on Fairness and Bias in Peer Review and Other Sociotechnical Intelligent Systems. | Nihar B. Shah, Zachary C. Lipton |
| 2020 | UAI | A SUPER* Algorithm to Optimize Paper Bidding in Peer Review. | Tanner Fiez, Nihar B. Shah, Lillian J. Ratliff |
| 2019 | ALT | PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. | Ivan Stelmakh, Nihar B. Shah, Aarti Singh |
| 2019 | IJCAI | On Strategyproof Conference Peer Review. | Yichong Xu, Han Zhao, Xiaofei Shi, Nihar B. Shah |
| 2018 | ISIT | Low Permutation-Rank Matrices: Structural Properties and Noisy Completion. | Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright |
| 2016 | ECCV | Overcoming Calibration Problems in Pattern Labeling with Pairwise Ratings: Application to Personality Traits. | Baiyu Chen, Sergio Escalera, Isabelle Guyon, Vctor Ponce-Lpez, Nihar B. Shah, Marc Oliu Simon |
| 2016 | ICML | Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues. | Nihar B. Shah, Sivaraman Balakrishnan, Aditya Guntuboyina, Martin J. Wainwright |
| 2016 | ICML | No Oops, You Won't Do It Again: Mechanisms for Self-correction in Crowdsourcing. | Nihar B. Shah, Dengyong Zhou |
| 2016 | ISIT | Feeling the bern: Adaptive estimators for Bernoulli probabilities of pairwise comparisons. | Nihar B. Shah, Sivaraman Balakrishnan, Martin J. Wainwright |
| 2015 | AAAI | On the Impossibility of Convex Inference in Human Computation. | Nihar B. Shah, Dengyong Zhou |
| 2015 | AISTATS | Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. | Nihar B. Shah, Sivaraman Balakrishnan, Joseph K. Bradley, Abhay Parekh, Kannan Ramchandran, Martin J. Wainwright |
| 2015 | FAST | Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth. | K. V. Rashmi, Preetum Nakkiran, Jingyan Wang, Nihar B. Shah, Kannan Ramchandran |
| 2015 | ICML | Approval Voting and Incentives in Crowdsourcing. | Nihar B. Shah, Dengyong Zhou, Yuval Peres |
| 2014 | GLOBECOM | Fundamental limits on communication for oblivious updates in storage networks. | Preetum Nakkiran, Nihar B. Shah, K. V. Rashmi |
| 2014 | ISIT | The MDS queue: Analysing the latency performance of erasure codes. | Nihar B. Shah, Kangwook Lee, Kannan Ramchandran |
| 2014 | ISIT | One extra bit of download ensures perfectly private information retrieval. | Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran |
| 2014 | SIGCOMM | A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers. | K. V. Rashmi, Nihar B. Shah, Dikang Gu, Hairong Kuang, Dhruba Borthakur, Kannan Ramchandran |
| 2013 | ISIT | A piggybacking design framework for read-and download-efficient distributed storage codes. | K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran |
| 2013 | ISIT | Secure network coding for distributed secret sharing with low communication cost. | Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran |
| 2012 | ISIT | Regenerating codes for errors and erasures in distributed storage. | K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran, P. Vijay Kumar |
| 2011 | GLOBECOM | Information-Theoretically Secure Regenerating Codes for Distributed Storage. | Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar |
| 2011 | ISIT | Enabling node repair in any erasure code for distributed storage. | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar |
| 2010 | ISIT | Explicit and optimal exact-regenerating codes for the minimum-bandwidth point in distributed storage. | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran |
| 2010 | ISIT | A flexible class of regenerating codes for distributed storage. | Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar |
| 2010 | ITA | Explicit and optimal codes for distributed storage. | K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran |
| 2010 | WAIFI | Regenerating Codes for Distributed Storage Networks. | Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar, Kannan Ramchandran |