☰

Venkatesan Guruswami - Publications

Affiliations: 
University of Washington, Seattle, Seattle, WA 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

116 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Guruswami V, Lokam SV, Jayaraman SVM. $\epsilon$-MSR Codes: Contacting Fewer Code Blocks for Exact Repair Ieee Transactions On Information Theory. 1-1. DOI: 10.1109/Tit.2020.3023110  0.518
2020 Gopi S, Guruswami V, Yekhanin S. Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities Ieee Transactions On Information Theory. 66: 6066-6083. DOI: 10.1109/Tit.2020.2990981  0.431
2020 Guruswami V, Jin L, Xing C. Constructions of maximally recoverable Local Reconstruction Codes via function fields Ieee Transactions On Information Theory. 66: 6133-6143. DOI: 10.1109/Tit.2020.2988459  0.391
2020 Guruswami V, Li R. Coding Against Deletions in Oblivious and Online Models Ieee Transactions On Information Theory. 66: 2352-2374. DOI: 10.1109/Tit.2020.2968298  0.481
2020 Dalai M, Guruswami V, Radhakrishnan J. An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel Ieee Transactions On Information Theory. 66: 749-756. DOI: 10.1109/Tit.2019.2933424  0.531
2019 Guruswami V, Xing C, Yuan C. How Long Can Optimal Locally Repairable Codes Be Ieee Transactions On Information Theory. 65: 3662-3670. DOI: 10.1109/Tit.2019.2891765  0.423
2019 Guruswami V, Li R. Polynomial Time Decodable Codes for the Binary Deletion Channel Ieee Transactions On Information Theory. 65: 2171-2178. DOI: 10.1109/Tit.2018.2876861  0.446
2018 Guruswami V, Resch N, Xing C. Lossless dimension expanders via linearized polynomials and subspace designs Electronic Colloquium On Computational Complexity. 25: 17. DOI: 10.4230/Lipics.Ccc.2018.4  0.31
2018 Rawat AS, Tamo I, Guruswami V, Efremenko K. MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth Ieee Transactions On Information Theory. 64: 6506-6525. DOI: 10.1109/Tit.2018.2810095  0.527
2017 Austrin P, Guruswami V, Håstad J. $(2+\varepsilon)$-Sat Is NP-hard Siam Journal On Computing. 46: 1554-1573. DOI: 10.1137/15M1006507  0.364
2017 Canonne CL, Guruswami V, Meka R, Sudan M. Communication With Imperfectly Shared Randomness Ieee Transactions On Information Theory. 63: 6799-6818. DOI: 10.1109/Tit.2017.2734103  0.622
2017 Guruswami V, Jin L, Xing C. Efficiently List-Decodable Punctured Reed-Muller Codes Ieee Transactions On Information Theory. 63: 4317-4324. DOI: 10.1109/Tit.2017.2692212  0.492
2016 Guruswami V, Lee E. Simple Proof of Hardness of Feedback Vertex Set Theory of Computing. 12: 1-11. DOI: 10.4086/Toc.2016.V012A006  0.311
2016 Guruswami V, Smith A. Optimal rate code constructions for computationally simple channels Journal of the Acm. 63. DOI: 10.1145/2936015  0.482
2016 Guruswami V, Lee E. Nearly optimal NP-Hardness of unique coverage Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 3: 1724-1730. DOI: 10.1137/16M1070682  0.396
2016 Brakensiek J, Guruswami V, Zbarsky S. Efficient low-redundancy codes for correcting multiple deletions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 3: 1884-1892. DOI: 10.1109/Tit.2017.2746566  0.561
2016 Guruswami V, Wootters M. Repairing reed-solomon codes Proceedings of the Annual Acm Symposium On Theory of Computing. 19: 216-226. DOI: 10.1109/Tit.2017.2702660  0.487
2016 Guruswami V, Wang C, Xing C. Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs Ieee Transactions On Information Theory. 62: 2707-2718. DOI: 10.1109/Tit.2016.2544347  0.578
2016 Guruswami V, Kopparty S. Explicit subspace designs Combinatorica. 36: 161-185. DOI: 10.1007/S00493-014-3169-1  0.495
2016 Bukh B, Guruswami V. An improved bound on the fraction of correctable deletions Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 3: 1893-1901.  0.425
2015 Guruswami V, Lee E. Towards a characterization of approximation resistance for Symmetric CSPs Leibniz International Proceedings in Informatics, Lipics. 40: 305-322. DOI: 10.4086/Toc.2017.V013A003  0.336
2015 Guruswami V, Lee E. Inapproximability of H-transversal/packing Leibniz International Proceedings in Informatics, Lipics. 40: 284-304. DOI: 10.1137/16M1070670  0.311
2015 Guruswami V, Sachdeva S, Saket R. Inapproximability of minimum vertex cover on k-uniform k-partite hypergraphs Siam Journal On Discrete Mathematics. 29: 36-58. DOI: 10.1137/130919416  0.361
2015 Guruswami V, Wang C. Deletion codes in the high-noise and high-rate regimes Leibniz International Proceedings in Informatics, Lipics. 40: 867-880. DOI: 10.1109/Tit.2017.2659765  0.536
2015 Guruswami V, Xia P. Polar Codes: Speed of Polarization and Polynomial Gap to Capacity Ieee Transactions On Information Theory. 61: 3-16. DOI: 10.1109/Tit.2014.2371819  0.479
2015 Guruswami V, Xing C. Optimal rate algebraic list decoding using narrow ray class fields Journal of Combinatorial Theory. Series A. 129: 160-183. DOI: 10.1016/J.Jcta.2014.09.003  0.556
2015 Dinur I, Guruswami V. PCPs via the low-degree long code and hardness for constrained hypergraph coloring Israel Journal of Mathematics. 209: 611-649. DOI: 10.1007/S11856-015-1231-3  0.475
2015 Guruswami V, Lee E. Strong inapproximability results on balanced rainbow-colorable hypergraphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 822-836. DOI: 10.1007/S00493-016-3383-0  0.366
2015 Guruswami V, Sudan M, Velingker A, Wang C. Limitations on testable affine-invariant codes in the high-rate regime Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 1312-1325.  0.373
2014 Guruswami V, Wang C. Evading subspaces over large fields and explicit list-decodable rank-metric codes Leibniz International Proceedings in Informatics, Lipics. 28: 748-761. DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.748  0.501
2014 Austrin P, Guruswami V, Håstad J. (2 + ε)-SAT is NP-hard Siam Journal On Computing. 46: 1554-1573. DOI: 10.14288/1.0056672  0.347
2014 Guruswami V, Harsha P, Håstad J, Srinivasan S, Varma G. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes Proceedings of the Annual Acm Symposium On Theory of Computing. 614-623. DOI: 10.1137/140995520  0.436
2014 Guruswami V, Sinop AK, Zhou Y. Constant factor Lasserre integrality gaps for graph partitioning problems Siam Journal On Optimization. 24: 1698-1717. DOI: 10.1137/13093025X  0.362
2014 Cheraghchi M, Guruswami V. Capacity of non-malleable codes Itcs 2014 - Proceedings of the 2014 Conference On Innovations in Theoretical Computer Science. 155-168. DOI: 10.1109/Tit.2015.2511784  0.45
2014 Guruswami V, Narayanan S. Combinatorial limitations of average-radius list-decoding Ieee Transactions On Information Theory. 60: 5827-5842. DOI: 10.1109/TIT.2014.2343224  0.486
2014 Guruswami V, Xing C. Hitting sets for low-degree polynomials with optimal density Proceedings of the Annual Ieee Conference On Computational Complexity. 161-168. DOI: 10.1109/CCC.2014.24  0.359
2014 Guruswami V, Lee E. Complexity of approximating CSP with balance / Hard constraints Itcs 2014 - Proceedings of the 2014 Conference On Innovations in Theoretical Computer Science. 439-448. DOI: 10.1007/S00224-015-9638-0  0.374
2014 Cheraghchi M, Guruswami V. Non-malleable coding against bit-wise and split-state tampering Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8349: 440-464. DOI: 10.1007/S00145-015-9219-Z  0.56
2014 Guruswami V, Xing C. Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1858-1866.  0.39
2013 Guruswami V, Xing C. List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound Proceedings of the Annual Acm Symposium On Theory of Computing. 843-852. DOI: 10.1145/2488608.2488715  0.512
2013 Cheraghchi M, Guruswami V, Velingker A. Restricted isometry of fourier matrices and list decodability of random linear codes Siam Journal On Computing. 42: 1888-1914. DOI: 10.1137/120896773  0.529
2013 Guruswami V, Wang C. Linear-algebraic list decoding for variants of reed-solomon codes Ieee Transactions On Information Theory. 59: 3257-3268. DOI: 10.1109/Tit.2013.2246813  0.589
2013 Dinur I, Guruswami V. PCPs via low-degree long code and hardness for constrained hypergraph coloring Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 340-349. DOI: 10.1109/FOCS.2013.44  0.383
2013 Guruswami V, Onak K. Superlinear lower bounds for multipass graph processing Proceedings of the Annual Ieee Conference On Computational Complexity. 287-298. DOI: 10.1007/S00453-016-0138-7  0.383
2013 Guruswami V, Narayanan S. Combinatorial limitations of average-radius list decoding Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 591-606. DOI: 10.1007/978-3-642-40328-6_41  0.385
2012 Guruswami V, Xing C. Folded codes from function field towers and improved optimal rate list decoding Proceedings of the Annual Acm Symposium On Theory of Computing. 339-350. DOI: 10.1145/2213977.2214009  0.343
2012 Guruswami V, Narayanan S, Wang C. List decoding subspace codes from insertions and deletions Itcs 2012 - Innovations in Theoretical Computer Science Conference. 183-189. DOI: 10.1145/2090236.2090252  0.504
2011 Guruswami V, Zhou Y. Tight bounds on the approximability of almost-satisfiable horn SAT and exact hitting set Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1574-1589. DOI: 10.4086/Toc.2012.V008A011  0.407
2011 Gopalan P, Guruswami V, Raghavendra P. List decoding tensor products and interleaved codes Siam Journal On Computing. 40: 1432-1462. DOI: 10.1137/090778274  0.582
2011 Guruswami V, H̊Astad J, Manokaran R, Raghavendra P, Charikar M. Beating the random ordering is hard: Every ordering csp is approximation resistant Siam Journal On Computing. 40: 878-914. DOI: 10.1137/090756144  0.372
2011 Guruswami V, Rudra A. Soft decoding, dual BCH codes, and better list-decodable ε-biased codes Ieee Transactions On Information Theory. 57: 705-717. DOI: 10.1109/Tit.2010.2095193  0.667
2011 Guruswami V. Linear-algebraic list decoding of folded Reed-Solomon codes Proceedings of the Annual Ieee Conference On Computational Complexity. 77-85. DOI: 10.1109/CCC.2011.22  0.505
2011 Guruswami V, Wang C. Optimal rate list decoding via derivative codes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6845: 593-604. DOI: 10.1007/978-3-642-22935-0_50  0.501
2010 Guruswami V. Cyclotomic function fields, Artin-Frobenius automorphisms, and list error correction with optimal rate Algebra and Number Theory. 4: 433-463. DOI: 10.2140/Ant.2010.4.433  0.57
2010 Guruswami V, Hastad J, Kopparty S. On the list-decodability of random linear codes Proceedings of the Annual Acm Symposium On Theory of Computing. 409-416. DOI: 10.1145/1806689.1806747  0.465
2010 Ben-Sasson E, Guruswami V, Kaufman T, Sudan M, Viderman M. Locally testable codes require redundant testers Siam Journal On Computing. 39: 3230-3247. DOI: 10.1137/090779875  0.736
2010 Guruswami V, Vadhan S. A lower bound on list size for list decoding Ieee Transactions On Information Theory. 56: 5681-5688. DOI: 10.1109/Tit.2010.2070170  0.446
2010 Guruswami V, Rudra A. The existence of concatenated codes list-decodable up to the Hamming bound Ieee Transactions On Information Theory. 56: 5195-5206. DOI: 10.1109/Tit.2010.2059572  0.709
2010 Guruswami V, Smith A. Codes for computationally simple channels: Explicit constructions with optimal rate venkatesan guruswami Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 723-732. DOI: 10.1109/FOCS.2010.74  0.314
2010 Guruswami V, Lee JR, Razborov A. Almost Euclidean subspaces of ℓ1NVIA expander codes Combinatorica. 30: 47-68. DOI: 10.1007/S00493-010-2463-9  0.501
2010 Andrews M, Chuzhoy J, Guruswami V, Khanna S, Talwar K, Zhang L. Inapproximability of Edge-Disjoint Paths and Low Congestion Routing on Undirected Graphs Combinatorica. 30: 485-520. DOI: 10.1007/S00493-010-2455-9  0.317
2010 Guruswami V. Bridging Shannon and Hamming: List error-correction with optimal rate Proceedings of the International Congress of Mathematicians 2010, Icm 2010. 2648-2675.  0.348
2009 Guruswami V, Umans C, Vadhan S. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes Journal of the Acm. 56. DOI: 10.1145/1538902.1538904  0.457
2009 Guruswami V. Artin automorphisms, cyclotomic function fields, and folded list-decodable codes Proceedings of the Annual Acm Symposium On Theory of Computing. 23-32. DOI: 10.1145/1536414.1536420  0.391
2009 Guruswami V, Rudra A. Error correction up to the information-theoretic limit Communications of the Acm. 52: 87-95. DOI: 10.1145/1467247.1467269  0.643
2009 Guruswami V, Rudra A. Better binary list decodable codes via multilevel concatenation Ieee Transactions On Information Theory. 55: 19-26. DOI: 10.1109/Tit.2008.2008124  0.714
2009 Guruswami V, Lee JR, Wigderson A. Expander codes over reals, Euclidean sections, and compressed sensing 2009 47th Annual Allerton Conference On Communication, Control, and Computing, Allerton 2009. 1231-1234. DOI: 10.1109/ALLERTON.2009.5394536  0.369
2009 Guruswami V, Sinop AK. Improved inapproximability results for maximum k-colorable subgraph Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5687: 163-176. DOI: 10.1007/978-3-642-03685-9_13  0.328
2009 Guruswami V. List decoding of binary codes-A brief survey of some recent results Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5557: 97-106. DOI: 10.1007/978-3-642-01877-0_10  0.439
2008 Guruswami V, Rudra A. Explicit codes achieving list decoding capacity: Error-correction with optimal redundancy Ieee Transactions On Information Theory. 54: 135-150. DOI: 10.1109/Tit.2007.911222  0.698
2008 Guruswami V, Machmouchi W. Explicit interleavers for a Repeat Accumulate Accumulate (RAA) code construction Ieee International Symposium On Information Theory - Proceedings. 1968-1972. DOI: 10.1109/ISIT.2008.4595333  0.508
2008 Gopalan P, Guruswami V. Hardness amplification within NP against deterministic algorithms Proceedings of the Annual Ieee Conference On Computational Complexity. 19-30. DOI: 10.1016/J.Jcss.2010.06.008  0.467
2008 Gopalan P, Guruswami V, Lipton RJ. Algorithms for modular counting of roots of multivariate polynomials Algorithmica (New York). 50: 479-496. DOI: 10.1007/S00453-007-9097-3  0.377
2008 Guruswami V, Lee JR, Wigderson A. Euclidean sections of ℓ1N with sublinear randomness and error-correction over the reals Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5171: 444-454. DOI: 10.1007/978-3-540-85363-3_35  0.445
2008 Guruswami V, Rudra A. Concatenated codes can achieve list-decoding capacity Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 258-267.  0.653
2007 Alon N, Guruswami V, Kaufman T, Sudan M. Guessing secrets efficiently via list decoding Acm Transactions On Algorithms. 3. DOI: 10.1145/1290672.1290679  0.653
2007 Guruswami V. List decoding and pseudorandom constructions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4851: 1-6. DOI: 10.1007/978-3-540-77224-8_1  0.443
2007 Guruswami V, Rudra A. Better binary list-decodable codes via multilevel concatenation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4627: 554-568.  0.658
2006 Guruswami V, Rudra A. Limits to list decoding reed-solomon codes Ieee Transactions On Information Theory. 52: 3642-3649. DOI: 10.1109/Tit.2006.878164  0.713
2006 Guruswami V, Patthakt AC. Correlated algebraic-geometric codes: improved list decoding over bounded alphabets Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 227-236. DOI: 10.1090/S0025-5718-07-02012-1  0.595
2006 Guruswami V, Kabanets V. Hardness amplification via space-efficient direct products Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3887: 556-568. DOI: 10.1007/S00037-008-0253-1  0.435
2006 Guruswami V, Rudra A. Achieving list decoding capacity using folded reed-solomon codes 44th Annual Allerton Conference On Communication, Control, and Computing 2006. 3: 1180-1186.  0.649
2006 Guruswami V, Rudra A. Explicit capacity-achieving list-decodable codes or decoding up to the singleton bound using folded Reed-Solomon codes Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 1-10.  0.667
2005 Dinur I, Guruswami V, Khot S, Regev O. A new multilayered PCP and the hardness of hypergraph vertex cover Siam Journal On Computing. 34: 1129-1146. DOI: 10.1137/S0097539704443057  0.395
2005 Guruswami V, Indyk P. Linear-time encodable/decodable codes with near-optimal rate Ieee Transactions On Information Theory. 51: 3393-3400. DOI: 10.1109/Tit.2005.855587  0.579
2005 Guruswami V, Vardy A. Maximum-likelihood decoding of Reed-Solomon codes is NP-hard Ieee Transactions On Information Theory. 51: 2249-2256. DOI: 10.1109/Tit.2005.850102  0.559
2005 Guruswami V, Micciancio D, Regev O. The complexity of the covering radius problem Computational Complexity. 14: 90-121. DOI: 10.1007/S00037-005-0193-Y  0.366
2005 Guruswami V, Rudra A. Tolerant locally testable codes Lecture Notes in Computer Science. 3624: 306-317.  0.63
2004 Guruswami V. Guest column: error-correcting codes and expander graphs Sigact News. 35: 25-41. DOI: 10.1145/1027914.1027924  0.539
2004 Guruswami V, Khanna S. On the hardness of 4-coloring a 3-colorable graph Siam Journal On Discrete Mathematics. 18: 30-40. DOI: 10.1137/S0895480100376794  0.352
2004 Guruswami V. List decoding of error-correcting codes winning thesis of the 2002 ACM doctoral disseration competition Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3282.  0.416
2004 Guruswami V. Better extractors for better codes? Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 436-444.  0.44
2004 Guruswami V, Indyk P. Efficiently Decodable Codes Meeting Gilbert-Varshamov Bound for Low Rates Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 749-750.  0.459
2004 Guruswami V, Micciancio D, Regev O. The complexity of the covering radius problem on lattices and codes Proceedings of the Annual Ieee Conference On Computational Complexity. 19: 161-173.  0.381
2003 Guruswami V, Khanna S, Rajaraman R, Shepherd B, Yannakakis M. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems Journal of Computer and System Sciences. 67: 473-496. DOI: 10.1016/S0022-0000(03)00066-7  0.358
2003 Guruswami V. List decoding with side information Proceedings of the Annual Ieee Conference On Computational Complexity. 300-309.  0.32
2003 Guruswami V, Indyk P. Linear time encodable and list decodable codes Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 126-135.  0.475
2002 Guruswami V, Håstad J, Sudan M. Hardness of approximate hypergraph coloring Siam Journal On Computing. 31: 1663-1686. DOI: 10.1137/S0097539700377165  0.655
2002 Guruswami V, Håstad J, Sudan M, Zuckerman D. Combinatorial bounds for list decoding Ieee Transactions On Information Theory. 48: 1021-1034. DOI: 10.1109/18.995539  0.723
2002 Engebretsen L, Guruswami V. Is constraint satisfaction over two variables always easy? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2483: 224-238. DOI: 10.1002/Rsa.20026  0.37
2002 Guruswami V. Limits to list decodability of linear codes Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 802-811.  0.457
2002 Guruswami V, Indyk P. Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 812-821.  0.454
2002 Guruswami V, Sudan M. Decoding concatenated codes using soft information Proceedings of the Annual Ieee Conference On Computational Complexity. 148-157.  0.404
2002 Alon N, Guruswami V, Kaufman T, Sudan M. Guessing secrets efficiently via list decoding (extended abstract) Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 6: 254-262.  0.316
2001 Guruswami V. List decoding from erasures: Bounds and code constructions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2245: 195-206. DOI: 10.1109/Tit.2003.815776  0.565
2001 Guruswami V. Constructions of codes from number fields Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2227: 129-140. DOI: 10.1109/Tit.2002.808131  0.521
2001 Guruswami V, Sudan M. On representations of algebraic-geometric codes Ieee Transactions On Information Theory. 47: 1610-1613. DOI: 10.1109/18.923745  0.699
2001 Guruswami V, Pandu Rangan C, Chang MS, Chang GJ, Wong CK. The Kr-packing problem Computing (Vienna/New York). 66: 79-89. DOI: 10.1007/S006070170039  0.343
2001 Guruswami V, Indyk P. Expander-based constructions of efficiently decodable codes Annual Symposium On Foundations of Computer Science - Proceedings. 658-667.  0.498
2000 Guruswami V, Rangan CP. Algorithmic aspects of clique-transversal and clique-independent sets Discrete Applied Mathematics. 100: 183-202. DOI: 10.1016/S0166-218X(99)00159-6  0.359
2000 Guruswami V. Inapproximability results for set splitting and satisfiability problems with no mixed clauses Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1913: 155-166. DOI: 10.1007/S00453-003-1072-Z  0.374
2000 Guruswami V, Sudan M. On representations of algebraic-geometric codes for list decoding Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1879: 244-255.  0.399
1999 Guruswami V, Sudan M. Improved decoding of reed-solomon and algebraic-geometry codes Ieee Transactions On Information Theory. 45: 1757-1767. DOI: 10.1109/18.782097  0.749
1999 Guruswami V. Maximum cut on line and total graphs Discrete Applied Mathematics. 92: 217-221. DOI: 10.1016/S0166-218X(99)00056-6  0.31
1999 Guruswami V. Enumerative aspects of certain subclasses of perfect graphs Discrete Mathematics. 205: 97-117. DOI: 10.1016/S0012-365X(99)00022-9  0.325
1998 Guruswami V, Rangan CP. A natural family of optimization problems with arbitrarily small approximation thresholds Information Processing Letters. 68: 241-248. DOI: 10.1016/S0020-0190(98)00169-0  0.339
Show low-probability matches.