Sotabase

Career

· Assistant Professor, Machine Learning and Computer Science Departments, Carnegie Mellon University2017–
· Visiting Graduate Student, UC Berkeley2015–
· PhD Student, UC Berkeley EECS Department2011–

Publications (0)

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
IEEE Transactions on Information Theory · 2010
715
cited
A Solution to the Network Challenges of Data Recovery in Erasure-coded Distributed Storage Systems: A Study on the Facebook Warehouse Cluster
USENIX Workshop on Hot Topics in Storage and File Systems · 2013
318
cited
Explicit construction of optimal exact regenerating codes for distributed storage
Allerton Conference on Communication, Control, and Computing · 2009
283
cited
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
IEEE Transactions on Information Theory · 2010
263
cited
A "hitchhiker's" guide to fast and efficient data reconstruction in erasure-coded data centers
Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · 2014
258
cited
Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions
IEEE Transactions on Information Theory · 2010
217
cited
One extra bit of download ensures perfectly private information retrieval
2014 IEEE International Symposium on Information Theory · 2014
209
cited
Simple, Robust and Optimal Ranking from Pairwise Comparisons
Journal of machine learning research · 2015
200
cited
When do redundant requests reduce latency ?
Allerton Conference on Communication, Control, and Computing · 2013
188
cited
Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependence
Journal of machine learning research · 2015
176
cited
Having Your Cake and Eating It Too: Jointly Optimal Erasure Codes for I/O, Storage, and Network-bandwidth
USENIX Conference on File and Storage Technologies · 2015
159
cited
Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
IEEE Transactions on Information Theory · 2015
153
cited
Information-Theoretically Secure Regenerating Codes for Distributed Storage
Global Communications Conference · 2011
119
cited
ReviewerGPT? An Exploratory Study on Using Large Language Models for Paper Reviewing
arXiv.org · 2023
117
cited
Explicit codes minimizing repair bandwidth for distributed storage
2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo) · 2009
116
cited
A piggybacking design framework for read-and download-efficient distributed storage codes
2013 IEEE International Symposium on Information Theory · 2013
111
cited
Double or Nothing: Multiplicative Incentive Mechanisms for Crowdsourcing
Journal of machine learning research · 2014
109
cited
The MDS queue: Analysing the latency performance of erasure codes
2014 IEEE International Symposium on Information Theory · 2012
107
cited
Active ranking from pairwise comparisons and when parametric assumptions do not help
Annals of Statistics · 2016
106
cited
Design and Analysis of the NIPS 2016 Review Process
Journal of machine learning research · 2017
106
cited
Sotabase