75 citations · 347 across the 37 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 1 cited
Near-Optimal UGC-hardness of Approximating Max k-CSP_R
Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan
In this paper, we prove an almost-optimal hardness for Max -CSP based on Khot's Unique Games Conjecture (UGC). In Max -CSP, we are given a set of predicates each of w…
cs.IT2015
Optimal Systematic Distributed Storage Codes with Fast Encoding
Preetum Nakkiran, K. V. Rashmi, Kannan Ramchandran
Erasure codes are being increasingly used in distributed-storage systems in place of data-replication, since they provide the same level of reliability with much lower storage over…