| Calibration with Privacy in Peer Review. | 0 | 0.34 | 2022 |
| Improving the peer review process in a scientific manner shows promise | 0 | 0.34 | 2022 |
| Near-Optimal Reviewer Splitting in Two-Phase Paper Reviewing and Conference Experiment Design. | 0 | 0.34 | 2022 |
| Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? | 0 | 0.34 | 2022 |
| A Novice-Reviewer Experiment To Address Scarcity Of Qualified Reviewers In Large Conferences | 0 | 0.34 | 2021 |
| KDD 2021 Tutorial on Systemic Challenges and Solutions on Bias and Unfairness in Peer Review | 0 | 0.34 | 2021 |
| A Permutation-based Model for Crowd Labeling: Optimal Estimation and Robustness | 0 | 0.34 | 2021 |
| Catch Me If I Can: Detecting Strategic Behaviour In Peer Assessment | 0 | 0.34 | 2021 |
| Prior and Prejudice: The Novice Reviewers' Bias against Resubmissions in Conference Peer Review. | 0 | 0.34 | 2021 |
| A heuristic for statistical seriation. | 0 | 0.34 | 2021 |
| Debiasing Evaluations That Are Biased By Evaluations | 0 | 0.34 | 2021 |
| JCDL 2021 Tutorial on Systemic Challenges and Computational Solutions on Bias and Unfairness in Peer Review | 0 | 0.34 | 2021 |
| Uncovering Latent Biases In Text: Method And Application To Peer Review | 0 | 0.34 | 2021 |
| A SUPER* Algorithm to Optimize Paper Bidding in Peer Review. | 0 | 0.34 | 2020 |
| Mitigating Manipulation in Peer Review via Randomized Reviewer Assignments | 0 | 0.34 | 2020 |
| Ranking And Rating Rankings And Ratings | 0 | 0.34 | 2020 |
| SIGMOD 2020 Tutorial on Fairness and Bias in Peer Review and Other Sociotechnical Intelligent Systems | 1 | 0.35 | 2020 |
| Two-Sample Testing on Pairwise Comparison Data and the Role of Modeling Assumptions | 0 | 0.34 | 2020 |
| Low Permutation-rank Matrices: Structural Properties and Noisy Completion. | 0 | 0.34 | 2019 |
| On Testing for Biases in Peer Review | 0 | 0.34 | 2019 |
| PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review. | 1 | 0.36 | 2018 |
| On Strategyproof Conference Peer Review. | 1 | 0.40 | 2018 |
| Low Permutation-Rank Matrices: Structural Properties and Noisy Completion | 1 | 0.35 | 2018 |
| Your 2 is My 1, Your 3 is My 9: Handling Arbitrary Miscalibrations in Ratings | 1 | 0.36 | 2018 |
| Information-Theoretically Secure Erasure Codes for Distributed Storage. | 1 | 0.43 | 2018 |
| Choosing How to Choose Papers. | 0 | 0.34 | 2018 |
| An Incentive Mechanism for Crowd Sensing with Colluding Agents. | 0 | 0.34 | 2018 |
| Design and analysis of the NIPS 2016 review process | 3 | 0.43 | 2017 |
| The MDS Queue: Analysing the Latency Performance of Erasure Codes. | 2 | 0.46 | 2017 |
| Active Ranking from Pairwise Comparisons and the Futility of Parametric Assumptions. | 0 | 0.34 | 2016 |
| No Oops, You Won't Do It Again: Mechanisms for Self-correction in Crowdsourcing. | 8 | 0.41 | 2016 |
| Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons. | 4 | 0.44 | 2016 |
| Approval Voting and Incentives in Crowdsourcing. | 16 | 0.70 | 2015 |
| Information-theoretically Secure Erasure Codes for Distributed Storage | 2 | 0.36 | 2015 |
| Truth Serums for Massively Crowdsourced Evaluation Tasks | 8 | 0.56 | 2015 |
| Having your cake and eating it too: jointly optimal erasure codes for I/O, storage and network-bandwidth | 36 | 1.05 | 2015 |
| Regularized Minimax Conditional Entropy for Crowdsourcing. | 15 | 0.71 | 2015 |
| Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues | 11 | 0.64 | 2015 |
| Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence. | 19 | 0.85 | 2015 |
| Parametric Prediction from Parametric Agents? | 2 | 0.37 | 2015 |
| Simple, Robust and Optimal Ranking from Pairwise Comparisons | 13 | 0.65 | 2015 |
| One extra bit of download ensures perfectly private information retrieval | 46 | 3.51 | 2014 |
| Fundamental limits on communication for oblivious updates in storage networks | 4 | 0.41 | 2014 |
| When is it Better to Compare than to Score? | 6 | 0.47 | 2014 |
| A \"hitchhiker's\" guide to fast and efficient data reconstruction in erasure-coded data centers | 57 | 1.70 | 2014 |
| Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing. | 23 | 1.03 | 2014 |
| On The Impossibility Of Convex Inference In Human Computation | 1 | 0.35 | 2014 |
| Optimality of the product-matrix construction for secure MSR regenerating codes | 3 | 0.38 | 2014 |
| The MDS queue: Analysing the latency performance of erasure codes | 32 | 1.19 | 2014 |
| When Do Redundant Requests Reduce Latency ? | 52 | 2.22 | 2013 |
