Differentially Private Set Union | 0 | 0.34 | 2020 |
Spanoids - an abstraction of spanning structures, and a barrier for LCCs | 1 | 0.35 | 2020 |
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities | 5 | 0.43 | 2020 |
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. | 0 | 0.34 | 2019 |
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. | 0 | 0.34 | 2018 |
On Maximally Recoverable Local Reconstruction Codes. | 2 | 0.36 | 2017 |
Gaussian Width Bounds With Applications To Arithmetic Progressions In Random Settings | 0 | 0.34 | 2017 |
Outlaw distributions and locally decodable codes. | 0 | 0.34 | 2017 |
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. | 1 | 0.35 | 2017 |
Competitive analysis of the top- K ranking problem | 0 | 0.34 | 2016 |
Lower bounds for 2-query LCCs over large alphabet. | 0 | 0.34 | 2016 |
On the Number of Rich Lines in Truly High Dimensional Sets. | 2 | 0.45 | 2015 |
Lower bounds for constant query affine-invariant LCCs and LTCs. | 0 | 0.34 | 2015 |
2-Server PIR with sub-polynomial communication. | 14 | 0.99 | 2014 |