Improved decoding of Reed-Solomon and algebraic-geometric codes
- V. Guruswami, M. Sudan
- Computer ScienceProceedings 39th Annual Symposium on Foundations…
- 8 November 1998
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.
Clustering with qualitative information
- M. Charikar, V. Guruswami, A. Wirth
- Computer Science, Mathematics44th Annual IEEE Symposium on Foundations of…
- 11 October 2003
This work considers the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity, and gives a factor 4 approximation for minimization on complete graphs, and a factor O(log n) approximation for general graphs.
On profit-maximizing envy-free pricing
- V. Guruswami, Jason D. Hartline, Anna R. Karlin, D. Kempe, Claire Mathieu, Frank McSherry
- EconomicsACM-SIAM Symposium on Discrete Algorithms
- 23 January 2005
It is shown that computing envy-free prices to maximize the seller's revenue is APX-hard in both of these cases, and the corresponding mechanism design problem, in which the consumer's preferences are private values, is investigated and given a log-competitive truthful mechanism.
Repairing Reed-Solomon Codes
- V. Guruswami, Mary Wootters
- Computer ScienceIEEE Transactions on Information Theory
- 15 September 2015
The main result is that, in some parameter regimes, Reed–Solomon codes are optimal regenerating codes, among maximum distance separable (MDS) codes withlinear repair schemes with linear repair schemes.
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- V. Guruswami, S. Khanna, R. Rajaraman, F. B. Shepherd, M. Yannakakis
- Computer Science, MathematicsSymposium on the Theory of Computing
- 1 May 1999
It is shown that in directed networks, for any e>0, EDP is NP-hard to approximate within m1/2-e even in undirected networks, and design simple approximation algorithms that achieve essentially matching approximation guarantees for some generalizations of EDP.
Multiclass learning, boosting, and error-correcting codes
- V. Guruswami, A. Sahai
- Computer ScienceAnnual Conference Computational Learning Theory
- 6 July 1999
ECC, that, by using a different weighting of the votes of the weak hypotheses, is able to improve on the performance of ADABOOST.OC, is arguably a more direct reduction of multiclass learning to binary learning problems than previous multiclass boosting algorithms.
CopyCatch: stopping group attacks by spotting lockstep behavior in social networks
- Alex Beutel, Wanhong Xu, V. Guruswami, Christopher Palow, C. Faloutsos
- Computer ScienceThe Web Conference
- 13 May 2013
The method, which is referred to as CopyCatch, detects lockstep Page Like patterns on Facebook by analyzing only the social graph between users and Pages and the times at which the edges in the graph were created.
Correlation clustering with a fixed number of clusters
- Ioannis Giotis, V. Guruswami
- Computer ScienceACM-SIAM Symposium on Discrete Algorithms
- 6 April 2005
This paper focuses on the situation when the number of clusters is stipulated to be a small constant k, and finds that for every k, there is a polynomial time approximation scheme for both maximizing agreements and minimizing disagreements.
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- V. Guruswami, A. Rudra
- Computer ScienceIEEE Transactions on Information Theory
- 18 November 2005
This paper presents an explicit construction of error-correcting codes of rate that can be list decoded in polynomial time up to a fraction of worst-case errors, and their methods directly yield better decoding algorithms for RS codes when errors occur in phased bursts.
Non-malleable Coding Against Bit-Wise and Split-State Tampering
- Mahdi Cheraghchi, V. Guruswami
- Computer Science, MathematicsJournal of Cryptology
- 4 September 2013
A general result is proved on existence of seedless non-malleable extractors, which implies that codes obtained from the reduction can achieve rates arbitrarily close to 1 / 5 and exponentially small error.
...
...