Publications by <!-- THEME DEBUG --> <!-- THEME HOOK: 'views_view_field' --> <!-- 💡 BEGIN CUSTOM TEMPLATE OUTPUT from 'themes/custom/csd/templates/views/views-view-field.html.twig' --> Venkatesan Guruswami <!-- END CUSTOM TEMPLATE OUTPUT from 'themes/custom/csd/templates/views/views-view-field.html.twig' -->

Conference

Maximum-likelihood decoding of Reed-Solomon codes is NP-hard

2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 470-478
Guruswami V, Vardy A

Conference

On profit-maximizing envy-free pricing

2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1164-1173
Guruswami V, Hartline JD, Karlin AR, Kempe D, Kenyon C, McSherry F

Conference

Efficiently Decodable Codes Meeting Gilbert-Varshamov Bound for Low Rates

2004 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 15:749-750
Guruswami V, Indyk P

Journal Article

List decoding of error-correcting codes winning thesis of the 2002 ACM doctoral disseration competition

2004 • Lecture Notes in Computer Science • 3282:
Guruswami V

Conference

The complexity of the covering radius problem on lattices and codes

2004 • Proceedings of the Annual IEEE Conference on Computational Complexity • 19:161-173
Guruswami V, Micciancio D, Regev O

Conference

Clustering with qualitative information

2003 • Annual Symposium on Foundations of Computer Science • 524-533
Charikar M, Guruswami V, Wirth A

Conference

Embeddings and non-approximability of geometric problems

2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 537-538
Guruswami V, Indyk P

Conference

List decoding with side information

2003 • Proceedings of the Annual IEEE Conference on Computational Complexity • 300-309
Guruswami V

Conference

Unconditional proof of tightness of Johnson bound

2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 754-755
Guruswami V, Shparlinski I
Displaying 251 - 275 of 309