• Publications
  • Influence
Private information retrieval
TLDR
Schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database and get no information on the identity of the item retrieved by the user are described. Expand
Private information retrieval
TLDR
This work describes schemes that enable a user to access k replicated copies of a database and privately retrieve information stored in the database, so that each individual server gets no information on the identity of the item retrieved by the user. Expand
A Fuzzy Vault Scheme
TLDR
Fuzzy vaults have potential application to the problem of protecting data in a number of real-world, error-prone environments and also to biometric authentication systems, in which readings are inherently noisy as a result of the refractory nature of image capture and processing. Expand
Improved decoding of Reed-Solomon and algebraic-geometry codes
TLDR
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes. Expand
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
  • M. Sudan
  • Computer Science, Mathematics
  • J. Complex.
  • 1 March 1997
TLDR
To the best of the knowledge, this is the first efficient (i.e., polynomial time bounded) algorithm which provides error recovery capability beyond the error-correction bound of a code for any efficient code. Expand
Proof verification and hardness of approximation problems
TLDR
The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP. Expand
Proof verification and the hardness of approximation problems
TLDR
It is proved that no MAX SNP-hard problem has a polynomial time approximation scheme, unless NP = P, and there exists a positive ε such that approximating the maximum clique size in an N-vertex graph to within a factor of Nε is NP-hard. Expand
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
TLDR
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometric codes is presented, including a solution to a weighted curve fitting problem, which is of use in soft-decision decoding algorithms for Reed- Solomon codes. Expand
Approximate graph coloring by semidefinite programming
TLDR
A duality relationship established between the value of the optimum solution to the authors' semidefinite program and the Lovász &thgr;-function is established and lower bounds on the gap between the best known approximation ratio in terms of n are shown. Expand
The minimum latency problem
TLDR
A tour that minimizes ∑n i=1 `(i), where `( i) is the latency of pi, defined to be the distance traveled before first visiting pi, is constructed. Expand
...
1
2
3
4
5
...