Journal Article Efficient low-redundancy codes for correcting multiple deletions 2016 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 3:1884-1892 Brakensiek J, Guruswami V, Zbarsky S
Journal Article Efficiently decodable insertion/deletion codes for high-noise and high-rate regimes 2016 • IEEE International Symposium on Information Theory - Proceedings • 620-624 Guruswami V, Li R
Journal Article Explicit List-Decodable Rank-Metric and Subspace Codes via Subspace Designs 2016 • IEEE Transactions on Information Theory • 62(5):2707-2718 Guruswami V, Wang C, Xing C
Journal Article Explicit subspace designs 2016 • Combinatorica • 36(2):161-185 Guruswami V, Kopparty S
Conference Nearly optimal NP-Hardness of unique coverage 2016 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 3:1724-1730 Guruswami V, Lee E
Conference New Hardness Results for Graph and Hypergraph Colorings 2016 • Leibniz International Proceedings in Informatics • 50: Brakensiek J, Guruswami V
Journal Article New MDS codes with small sub-packetization and near-optimal repair bandwidth 2016 Guruswami V, Rawat AS
Journal Article Optimal Rate Code Constructions for Computationally Simple Channels 2016 • Journal of the ACM • 63(4): Guruswami V, Smith A
Journal Article Repairing Reed-Solomon Codes 2016 • Annual ACM Symposium on Theory of Computing • 216-226 Guruswami V, Wootters M
Conference Robust Fourier and Polynomial Curve Fitting 2016 • Annual Symposium on Foundations of Computer Science • 751-759 Guruswami V, Zuckerman D
Journal Article Simple Proof of Hardness of Feedback Vertex Set 2016 • Theory of Computing • 12: Guruswami V, Lee E
Journal Article Superlinear Lower Bounds for Multipass Graph Processing 2016 • Algorithmica • 76(3):654-683 Guruswami V, Onak K
Conference Tight Bounds for Communication-Assisted Agreement Distillation 2016 • Leibniz International Proceedings in Informatics • 50: Guruswami V, Radhakrishnan J
Journal Article An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets 2015 • Leibniz International Proceedings in Informatics • 33:42-57 Guruswami V, Velingker A
Journal Article An improved bound on the fraction of correctable deletions 2015 Bukh B, Guruswami V, Håstad J
Journal Article Approximate hypergraph coloring under low-discrepancy and related promises 2015 • Leibniz International Proceedings in Informatics • 40:152-174 Bhattiprolu VVSP, Guruswami V, Lee E
Journal Article Communication with Imperfectly Shared Randomness 2015 • PROCEEDINGS OF THE 6TH INNOVATIONS IN THEORETICAL COMPUTER SCIENCE (ITCS'15) • 257-262 Canonne CL, Guruswami V, Meka R, Sudan M
Journal Article Deletion codes in the high-noise and high-rate regimes 2015 • Leibniz International Proceedings in Informatics • 40:867-880 Guruswami V, Wang C
Journal Article Dimension expanders via rank condensers 2015 • Leibniz International Proceedings in Informatics • 40:800-814 Forbes MA, Guruswami V
Journal Article Inapproximability of H-transversal/packing 2015 • Leibniz International Proceedings in Informatics • 40:284-304 Guruswami V, Lee E
Journal Article INAPPROXIMABILITY OF MINIMUM VERTEX COVER ON <i>k</i>-UNIFORM <i>k</i>-PARTITE HYPERGRAPHS 2015 • SIAM Journal on Discrete Mathematics • 29(1):36-58 Guruswami V, Sachdeva S, Saket R
Conference Limitations on testable affine-invariant codes in the high-rate regime 2015 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 2015-January(January):1312-1325 Guruswami V, Sudan M, Velingker A, Wang C
Journal Article Optimal rate algebraic list decoding using narrow ray class fields 2015 • Journal of combinatorial theory. Series A • 129:160-183 Guruswami V, Xing C
