Conference Guessing secrets efficiently via list decoding 2007 • ACM Transactions on Algorithms (TALG) • 3(4): Alon N, Guruswami V, Kaufman T, Sudan M
Conference Hardness of routing with congestion in directed graphs 2007 • Annual ACM Symposium on Theory of Computing • 165-178 Chuzhoy J, Guruswami V, Khanna S, Talwar K
Conference List decoding and pseudorandom constructions 2007 • Lecture Notes in Computer Science • 4851 LNCS:1-6 Guruswami V
Journal Article Special issue - "Conference on computational complexity 2006" - Guest editors' foreword 2007 • Computational Complexity • 16(2):113-114 Guruswami V, Kabanets V
Conference Unbalanced expanders and randomness extractors from parvaresh-vardy codes 2007 • Proceedings of the Annual IEEE Conference on Computational Complexity • 96-108 Guruswami V, Umans C, Vadhan S
Conference Achieving list decoding capacity using folded reed-solomon codes 2006 • 44th Annual Allerton Conference on Communication, Control, and Computing 2006 • 3:1180-1186 Guruswami V, Rudra A
Journal Article Algorithmic results in list decoding 2006 • Foundations and Trends in Theoretical Computer Science • 2(2):107-195 Guruswami V
Journal Article Algorithms for modular counting of roots of multivariate polynomials 2006 • Lecture Notes in Computer Science • 3887:544-555 Copalan P, Guruswami V, Lipton RJ
Conference Correlated algebraic-geometric codes: improved list decoding over bounded alphabets 2006 • Annual Symposium on Foundations of Computer Science • 227-236 Guruswami V, Patthakt AC
Journal Article Correlation clustering with a fixed number of clusters 2006 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1167-1176 Giotis I, Guruswami V
Conference Explicit capacity-achieving list-decodable codes or decoding up to the singleton bound using folded Reed-Solomon codes 2006 • Annual ACM Symposium on Theory of Computing • 2006:1-10 Guruswami V, Rudra A
Journal Article Hardness amplification via space-efficient direct products 2006 • Lecture Notes in Computer Science • 3887:556-568 Guruswami V, Kabanets V
Conference Hardness of learning halfspaces with noise 2006 • Annual Symposium on Foundations of Computer Science • 543-552 Guruswami V, Raghavendra P
Journal Article Iterative Decoding of Low-Density Parity Check Codes (A Survey) 2006 • Bulletin of the EATCS, Issue 90, October 2006 Guruswami V
Journal Article Limits to list decoding Reed-Solomon codes 2006 • IEEE Transactions on Information Theory • 52(8):3642-3649 Guruswami V, Rudra A
Conference List decoding in average-case complexity and pseudorandomness 2006 • 2006 IEEE Information Theory Workshop, ITW 2006 • 32-36 Guruswami V
Conference On 2-query codeword testing with near-perfect completeness 2006 • Lecture Notes in Computer Science • 4288 LNCS:267-276 Guruswami V
Conference Proceedings of the Annual IEEE Conference on Computational Complexity: Preface 2006 • Proceedings of the Annual IEEE Conference on Computational Complexity • 2006: Agrawal M, Ambainis A, Arvind V, Guruswami V, Hitchcock J, Kabanets V, McKenzie P, Radhakrishnan J, Sudan M, Toran J
Journal Article A lower bound on list size for list decoding 2005 • Lecture Notes in Computer Science • 3624:318-329 Guruswami V, Vadhan S
Journal Article A new multilayered PCP and the hardness of hypergraph vertex cover 2005 • SIAM journal on computing (Print) • 34(5):1129-1146 Dinur I, Guruswami V, Khot S, Regev O
Journal Article Clustering with qualitative information 2005 • Journal of Computer and System Sciences • 71(3):360-383 Charikar M, Guruswami V, Wirth A
Conference Hardness of Max 3SAT with no mixed clauses 2005 • Proceedings of the Annual IEEE Conference on Computational Complexity • 154-162 Guruswami V, Khot S
Conference Limits to list decoding Reed-Solomon codes 2005 • Annual ACM Symposium on Theory of Computing • 602-609 Guruswami V, Rudra A
Journal Article Linear-time encodable/decodable codes with near-optimal rate 2005 • IEEE Transactions on Information Theory • 51(10):3393-3400 Guruswami V, Indyk P
Journal Article Maximum-likelihood decoding of Reed-Solomon codes is NP-hard 2005 • IEEE Transactions on Information Theory • 51(7):2249-2256 Guruswami V, Vardy A
