Journal Article
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
On profit-maximizing envy-free pricing
Efficiently Decodable Codes Meeting Gilbert-Varshamov Bound for Low Rates
Inapproximability results for set splitting and satisfiability problems with no mixed clauses
List decoding of error-correcting codes winning thesis of the 2002 ACM doctoral disseration competition
The complexity of the covering radius problem on lattices and codes
Clustering with qualitative information
Embeddings and non-approximability of geometric problems
List decoding with side information
Unconditional proof of tightness of Johnson bound