Venkatesan Guruswami Adjunct Faculty Website Email venkatg@cs.cmu.edu Department Computer Science Department Publications Journal Article Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder Than Random 2022 • Annual ACM Symposium on Theory of Computing • 678-689 Guruswami V, Kothari PK, Manohar P Journal Article Bounds for List-Decoding and List-Recovery of Random Linear Codes 2022 • IEEE Transactions on Information Theory • 68(2):923-939 Guruswami V, Li R, Mosheiff J, Resch N, Silas S, Wootters M Journal Article Threshold Rates for Properties of Random Codes 2022 • IEEE Transactions on Information Theory • 68(2):905-922 Guruswami V, Moshieff J, Resch N, Silas S, Wootters M Journal Article $\ell_p$-Spread and Restricted Isometry Properties of Sparse Random Matrices 2021 Guruswami V, Manohar P, Mosheiff J Conference A locality-based lens for coded computation 2021 • IEEE International Symposium on Information Theory - Proceedings • 00:1070-1075 Rudow M, Rashmi KV, Guruswami V
Journal Article Algorithms and Certificates for Boolean CSP Refutation: Smoothed Is No Harder Than Random 2022 • Annual ACM Symposium on Theory of Computing • 678-689 Guruswami V, Kothari PK, Manohar P
Journal Article Bounds for List-Decoding and List-Recovery of Random Linear Codes 2022 • IEEE Transactions on Information Theory • 68(2):923-939 Guruswami V, Li R, Mosheiff J, Resch N, Silas S, Wootters M
Journal Article Threshold Rates for Properties of Random Codes 2022 • IEEE Transactions on Information Theory • 68(2):905-922 Guruswami V, Moshieff J, Resch N, Silas S, Wootters M
Journal Article $\ell_p$-Spread and Restricted Isometry Properties of Sparse Random Matrices 2021 Guruswami V, Manohar P, Mosheiff J
Conference A locality-based lens for coded computation 2021 • IEEE International Symposium on Information Theory - Proceedings • 00:1070-1075 Rudow M, Rashmi KV, Guruswami V
