Venkatesan Guruswami
Affiliations: | University of Washington, Seattle, Seattle, WA |
Area:
Computer ScienceGoogle:
"Venkatesan Guruswami"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Guruswami V, Lokam SV, Jayaraman SVM. (2020) $\epsilon$-MSR Codes: Contacting Fewer Code Blocks for Exact Repair Ieee Transactions On Information Theory. 1-1 |
Gopi S, Guruswami V, Yekhanin S. (2020) Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities Ieee Transactions On Information Theory. 66: 6066-6083 |
Guruswami V, Jin L, Xing C. (2020) Constructions of maximally recoverable Local Reconstruction Codes via function fields Ieee Transactions On Information Theory. 66: 6133-6143 |
Guruswami V, Li R. (2020) Coding Against Deletions in Oblivious and Online Models Ieee Transactions On Information Theory. 66: 2352-2374 |
Dalai M, Guruswami V, Radhakrishnan J. (2020) An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel Ieee Transactions On Information Theory. 66: 749-756 |
Guruswami V, Xing C, Yuan C. (2019) How Long Can Optimal Locally Repairable Codes Be Ieee Transactions On Information Theory. 65: 3662-3670 |
Guruswami V, Li R. (2019) Polynomial Time Decodable Codes for the Binary Deletion Channel Ieee Transactions On Information Theory. 65: 2171-2178 |
Guruswami V, Resch N, Xing C. (2018) Lossless dimension expanders via linearized polynomials and subspace designs Electronic Colloquium On Computational Complexity. 25: 17 |
Rawat AS, Tamo I, Guruswami V, et al. (2018) MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth Ieee Transactions On Information Theory. 64: 6506-6525 |
Austrin P, Guruswami V, Håstad J. (2017) $(2+\varepsilon)$-Sat Is NP-hard Siam Journal On Computing. 46: 1554-1573 |