| Publication | Date of Publication | Type |
|---|
Addendum and Erratum to “The MDS Queue: Analysing the Latency Performance of Erasure Codes”
IEEE Transactions on Information Theory | 2022-10-11 | Paper |
scientific article; zbMATH DE number 7415106 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-27 | Paper |
| scientific article; zbMATH DE number 7415106 (Why is no real title available?) | 2021-10-27 | Paper |
A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Loss Functions, Axioms, and Peer Review
Journal of Artificial Intelligence Research | 2021-05-25 | Paper |
Parametric prediction from parametric agents
Operations Research | 2020-10-05 | Paper |
| Low permutation-rank matrices: structural properties and noisy completion | 2020-02-07 | Paper |
Low permutation-rank matrices: structural properties and noisy completion
(available as arXiv preprint) | 2020-02-07 | Paper |
Active ranking from pairwise comparisons and when parametric assumptions do not help
The Annals of Statistics | 2020-01-15 | Paper |
Active ranking from pairwise comparisons and when parametric assumptions do not help
The Annals of Statistics | 2020-01-15 | Paper |
Feeling the Bern: Adaptive Estimators for Bernoulli Probabilities of Pairwise Comparisons
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| Simple, Robust and Optimal Ranking from Pairwise Comparisons | 2018-11-22 | Paper |
Simple, Robust and Optimal Ranking from Pairwise Comparisons
(available as arXiv preprint) | 2018-11-22 | Paper |
| Design and analysis of the NIPS 2016 review process | 2018-11-21 | Paper |
Design and analysis of the NIPS 2016 review process
(available as arXiv preprint) | 2018-11-21 | Paper |
Information-Theoretically Secure Erasure Codes for Distributed Storage
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
PeerReview4All: Fair and Accurate Reviewer Assignment in Peer Review
(available as arXiv preprint) | 2018-06-16 | Paper |
A Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
| scientific article; zbMATH DE number 6765483 (Why is no real title available?) | 2017-08-25 | Paper |
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Double or nothing: multiplicative incentive mechanisms for crowdsourcing
Journal of Machine Learning Research (JMLR) | 2016-11-22 | Paper |
Double or nothing: multiplicative incentive mechanisms for crowdsourcing
Journal of Machine Learning Research (JMLR) | 2016-11-22 | Paper |
Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
Estimation from pairwise comparisons: sharp minimax bounds with topology dependence
Journal of Machine Learning Research (JMLR) | 2016-06-06 | Paper |
The MDS Queue: Analysing the Latency Performance of Erasure Codes
(available as arXiv preprint) | 2012-11-22 | Paper |
Regenerating codes for distributed storage networks
Arithmetic of Finite Fields | 2010-07-20 | Paper |
