Journal Article Maximally recoverable LRCs: A field size lower bound and constructions for few heavy parities 2019 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 2154-2170 Gopi S, Guruswami V, Yekhanin S
Journal Article Near-optimal Repair of Reed-Solomon Codes with Low Sub-packetization 2019 • IEEE International Symposium on Information Theory - Proceedings • 1077-1081 Guruswami V, Jiang H
Journal Article Polynomial Time Decodable Codes for the Binary Deletion Channel 2019 • IEEE Transactions on Information Theory • 65(4):2171-2178 Guruswami V, Li R
Conference Rainbow coloring hardness via low sensitivity polymorphisms 2019 • Leibniz International Proceedings in Informatics • 145: Guruswami V, Sandeep S
Journal Article Secret sharing with binary shares 2019 • Leibniz International Proceedings in Informatics • 124: Lin F, Cheraghchi M, Guruswami V, Safavi-Naini R, Wang H
Journal Article Streaming hardness of unique games 2019 • Leibniz International Proceedings in Informatics • 145: Guruswami V, Tao R
Journal Article Approximating Operator Norms via Generalized Krivine Rounding 2018 Bhattiprolu V, Ghosh M, Guruswami V, Lee E, Tulsiani M
Journal Article Coding against deletions in oblivious and online models 2018 • SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 625-643 Guruswami V, Li R
Journal Article Efficient Low-Redundancy Codes for Correcting Multiple Deletions 2018 • IEEE Transactions on Information Theory • 64(5):3403-3410 Brakensiek J, Guruswami V, Zbarsky S
Journal Article Explicit optimal-length locally repairable codes of distance 5 2018 • 2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) • 800-804 Beemer A, Coatney R, Guruswami V, Lopez HH, Pinero F
Journal Article General Strong Polarization 2018 • Annual ACM Symposium on Theory of Computing • 485-492 Blasiok J, Guruswami V, Nakkiran P, Rudra A, Sudan M
Conference Hardness of rainbow coloring hypergraphs 2018 • Leibniz International Proceedings in Informatics • 93: Guruswami V, Saket R
Journal Article How long can optimal locally repairable codes Be? 2018 • Leibniz International Proceedings in Informatics • 116: Guruswami V, Xing C, Yuan C
Journal Article Inapproximability of Matrix $p\rightarrow q$ Norms 2018 Bhattiprolu V, Ghosh M, Guruswami V, Lee E, Tulsiani M
Conference Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs 2018 • Leibniz International Proceedings in Informatics • 102: Guruswami V, Resch N, Xing C
Journal Article MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth 2018 • IEEE Transactions on Information Theory • 64(10):6506-6525 Rawat AS, Tamo I, Guruswami V, Efremenko K
Journal Article On the List-Decodability of Random Linear Rank-Metric Codes 2018 • IEEE International Symposium on Information Theory - Proceedings • 1505-1509 Guruswami V, Resch N
Conference Polar codes with exponentially small error at finite block length 2018 • Leibniz International Proceedings in Informatics • 116: Basiok J, Guruswami V, Sudan M
Conference Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy 2018 • SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS • 1782-1801 Brakensiek J, Guruswami V
Journal Article STRONG INAPPROXIMABILITY RESULTS ON BALANCED RAINBOW-COLORABLE HYPERGRAPHS 2018 • Combinatorica • 38(3):547-599 Guruswami V, Lee E
Journal Article SUBSPACE DESIGNS BASED ON ALGEBRAIC FUNCTION FIELDS 2018 • Transactions of the American Mathematical Society • 370(12):8757-8775 Guruswami V, Xing C, Yuan C
Conference ε-MSR Codes: Contacting Fewer Code Blocks for Exact Repair 2018 • 2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) • 2371-2375 Guruswami V, Lokam SV, Jayaraman SVM
Conference ∊-MSR Codes: Contacting Fewer Code Blocks for Exact Repair 2018 • IEEE International Symposium on Information Theory - Proceedings • 00:2371-2375 Guruswami V, Lokam SV, Jayaraman SVM
Journal Article (2+ε)-SAT IS NP-HARD 2017 • SIAM journal on computing (Print) • 46(5):1554-1573 Austrin P, Guruswami V, Hastad J
Journal Article An Improved Bound on the Fraction of Correctable Deletions 2017 • IEEE Transactions on Information Theory • 63(1):93-103 Bukh B, Guruswami V, Hastad J
