• Publications
  • Influence
Improved decoding of Reed-Solomon and algebraic-geometry codes
tl;dr
We present an improved list decoding algorithm for decoding Reed-Solomon codes that solves this problem in polynomial time in four decades. Expand
  • 913
  • 76
  • Open Access
Improved decoding of Reed-Solomon and algebraic-geometric codes
  • V. Guruswami, M. Sudan
  • Computer Science, Mathematics
  • Proceedings 39th Annual Symposium on Foundations…
  • 8 November 1998
tl;dr
We present an improved list decoding algorithm for decoding Reed-Solomon codes in polynomial time. Expand
  • 520
  • 56
On profit-maximizing envy-free pricing
tl;dr
We study the problem of pricing items for sale to consumers so as to maximize the seller's revenue by finding envy-free prices that maximize seller profit and at the same time are envy free. Expand
  • 314
  • 56
  • Open Access
Clustering with qualitative information
tl;dr
We answer several questions left open by Bansal et al. (2002) and provide a sound overview of clustering with qualitative information. Expand
  • 349
  • 45
  • Open Access
Multiclass learning, boosting, and error-correcting codes
tl;dr
We investigate the approach of Dietterich and Bakiri [2] based on error-correcting codes (which we call ECC). Expand
  • 182
  • 24
  • Open Access
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
How can web services that depend on user generated content discern fraudulent input by spammers from legitimate input? In this paper we focus on the social network Facebook and the problem ofExpand
  • 236
  • 23
  • Open Access
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
  • V. Guruswami, A. Rudra
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 18 November 2005
tl;dr
In this paper, we present an explicit construction of error-correcting codes that achieve the information-theoretically best possible tradeoff between the rate and error-correction radius. Expand
  • 157
  • 19
  • Open Access
Correlation clustering with a fixed number of clusters
tl;dr
We continue the investigation of problems concerning correlation clustering or clustering with qualitative information, which is a clustering formulation that has been studied recently. Expand
  • 112
  • 18
  • Open Access
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
tl;dr
We study the approximability of edge-disjoint paths and related problems. Expand
  • 143
  • 17
Repairing Reed-Solomon Codes
tl;dr
We study the performance of Reed–Solomon (RS) codes for the <italic>exact repair problem in distributed storage. Expand
  • 49
  • 14
  • Open Access