Follow
Venkatesan Guruswami
Title
Cited by
Cited by
Year
Improved decoding of Reed-Solomon and algebraic-geometric codes
V Guruswami, M Sudan
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
16121998
Clustering with qualitative information
M Charikar, V Guruswami, A Wirth
Journal of Computer and System Sciences 71 (3), 360-383, 2005
5662005
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
V Guruswami, C Umans, S Vadhan
Journal of the ACM (JACM) 56 (4), 1-34, 2009
4732009
Copycatch: stopping group attacks by spotting lockstep behavior in social networks
A Beutel, W Xu, V Guruswami, C Palow, C Faloutsos
Proceedings of the 22nd international conference on World Wide Web, 119-130, 2013
4442013
On profit-maximizing envy-free pricing.
V Guruswami, JD Hartline, AR Karlin, D Kempe, C Kenyon, F McSherry
SODA 5, 1164-1173, 2005
4162005
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
V Guruswami, S Khanna, R Rajaraman, B Shepherd, M Yannakakis
Proceedings of the thirty-first Annual ACM Symposium on Theory of Computing …, 1999
3441999
List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition
V Guruswami
Springer Science & Business Media, 2004
3392004
Correlation clustering with a fixed number of clusters
I Giotis, V Guruswami
arXiv preprint cs/0504023, 2005
2322005
Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy
V Guruswami, A Rudra
IEEE Transactions on information theory 54 (1), 135-150, 2008
2282008
Multiclass learning, boosting, and error-correcting codes
V Guruswami, A Sahai
Proceedings of the twelfth annual conference on Computational learning …, 1999
2231999
A new multilayered PCP and the hardness of hypergraph vertex cover
I Dinur, V Guruswami, S Khot, O Regev
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2142003
Repairing reed-solomon codes
V Guruswami, M Wootters
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
2032016
Hardness of learning halfspaces with noise
V Guruswami, P Raghavendra
SIAM Journal on Computing 39 (2), 742-765, 2009
1952009
Agnostic learning of monomials by halfspaces is hard
V Feldman, V Guruswami, P Raghavendra, Y Wu
SIAM Journal on Computing 41 (6), 1558-1590, 2012
1782012
Efficient low-redundancy codes for correcting multiple deletions
J Brakensiek, V Guruswami, S Zbarsky
IEEE Transactions on Information Theory 64 (5), 3403-3410, 2017
1692017
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
V Guruswami, A Vardy
IEEE Transactions on Information Theory 51 (7), 2249-2256, 2005
1532005
Optimal column-based low-rank matrix reconstruction
V Guruswami, AK Sinop
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1492012
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
A Bhaskara, M Charikar, V Guruswami, A Vijayaraghavan, Y Zhou
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
1422012
Expander-based constructions of efficiently decodable codes
V Guruswami, P Indyk
Proceedings 42nd IEEE Symposium on Foundations of Computer Science, 658-667, 2001
1342001
Non-malleable coding against bit-wise and split-state tampering
M Cheraghchi, V Guruswami
Journal of Cryptology 30, 191-241, 2017
1322017
The system can't perform the operation now. Try again later.
Articles 1–20