Conference Decoding concatenated codes using soft information 2002 • Proceedings of the Annual IEEE Conference on Computational Complexity • 148-157 Guruswami V, Sudan M
Conference Guessing secrets efficiently via list decoding (extended abstract) 2002 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 06-08-January-2002:254-262 Alon N, Guruswami V, Kaufman T, Sudan M
Journal Article Hardness of approximate hypergraph coloring 2002 • SIAM journal on computing (Print) • 31(6):1663-1686 Guruswami V, Håstad J, Sudan M
Conference Is constraint satisfaction over two variables always easy? 2002 • Lecture Notes in Computer Science • 2483:224-238 Engebretsen L, Guruswami V
Conference Limits to list decodability of linear codes 2002 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 802-811 Guruswami V
Conference Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets 2002 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 812-821 Guruswami V, Indyk P
Journal Article Query strategies for priced information 2002 • Journal of Computer and System Sciences • 64(4):785-819 Charikar M, Fagin R, Guruswami V, Kleinberg J, Raghavan P, Sahai A
Conference Constructions of codes from number fields 2001 • Lecture Notes in Computer Science • 2227:129-140 Guruswami V
Conference Expander-based constructions of efficiently decodable codes 2001 • Annual Symposium on Foundations of Computer Science • 658-667 Guruswami V, Indyk P
Conference List decoding from erasures: Bounds and code constructions 2001 • Lecture Notes in Computer Science • 2245:195-206 Guruswami V
Journal Article On representations of algebraic-geometry codes 2001 • IEEE Transactions on Information Theory • 47(4):1610-1613 Guruswami V, Sudan M
Journal Article The <i>K<sub>r</sub></i>-packing problem 2001 • Computing (Vienna/New York) • 66(1):79-89 Guruswami V, Rangan CP, Chang MS, Chang GJ, Wong CK
Journal Article Algorithmic aspects of clique-transversal and clique-independent sets 2000 • Discrete Applied Mathematics • 100(3):183-202 Guruswami V, Rangan CP
Conference Combinatorial feature selection problems 2000 • Annual Symposium on Foundations of Computer Science • 631-640 Charikar M, Guruswami V, Kumar R, Rajagopalan S, Sahai A
Conference Hardness of approximate hypergraph coloring 2000 • Annual Symposium on Foundations of Computer Science • 149-158 Guruswami V, Hastad J, Sudan M
Conference Inapproximability results for set splitting and satisfiability problems with no mixed clauses 2000 • Lecture Notes in Computer Science • 1913:155-166 Guruswami V
Conference List decoding algorithms for certain concatenated codes 2000 • Annual ACM Symposium on Theory of Computing • 181-190 Guruswami V, Sudan M
Journal Article On representations of algebraic-geometric codes for list decoding 2000 • Lecture Notes in Computer Science • 1879:244-255 Guruswami V, Sudan M
Conference On the hardness of 4-coloring a 3-colorable graph 2000 • Proceedings of the Annual IEEE Conference on Computational Complexity • 188-197 Guruswami V, Khanna S
Conference Query strategies for priced information (extended abstract) 2000 • Annual ACM Symposium on Theory of Computing • 582-591 Charikar M, Fagin R, Guruswami V, Kleinberg J, Raghavan P, Sahai A
Conference `Soft-decision' decoding of Chinese Remainder Codes 2000 • Annual Symposium on Foundations of Computer Science • 159-168 Guruswami V, Sahai A, Sudan M
Conference 2-Catalog segmentation problem 1999 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms Dodis Y, Guruswami V, Khanna S
Journal Article Enumerative aspects of certain subclasses of perfect graphs 1999 • Discrete Mathematics • 205(1-3):97-117 Guruswami V
Journal Article Improved decoding of Reed-Solomon and algebraic-geometry codes 1999 • IEEE Transactions on Information Theory • 45(6):1757-1767 Guruswami V, Sudan M
Journal Article Maximum cut on line and total graphs 1999 • Discrete Applied Mathematics • 92(2-3):217-221 Guruswami V
