| An exponential lower bound on the sub-packetization of MSR codes O Alrabiah, V Guruswami Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 37* | 2019 |
| Randomly punctured Reed–Solomon codes achieve list-decoding capacity over linear-sized fields O Alrabiah, V Guruswami, R Li Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 1458-1469, 2024 | 19 | 2024 |
| A near-cubic lower bound for 3-query locally decodable codes from semirandom CSP refutation O Alrabiah, V Guruswami, PK Kothari, P Manohar Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1438-1448, 2023 | 12 | 2023 |
| Low-degree polynomials extract from local sources O Alrabiah, E Chattopadhyay, J Goodman, X Li, J Ribeiro arXiv preprint arXiv:2205.13725, 2022 | 5 | 2022 |
| AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets O Alrabiah, V Guruswami, R Li IEEE Transactions on Information Theory, 2024 | 4 | 2024 |
| Low-Degree Polynomials Are Good Extractors O Alrabiah, J Goodman, J Mosheiff, J Ribeiro arXiv preprint arXiv:2405.10297, 2024 | 1 | 2024 |
| Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles O Alrabiah, V Guruswami arXiv preprint arXiv:2404.05864, 2024 | 1 | 2024 |
| AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets O Alrabiah, V Guruswami, R Li arXiv preprint arXiv:2308.13424, 2023 | 1 | 2023 |
| Visible rank and codes with locality O Alrabiah, V Guruswami arXiv preprint arXiv:2108.12687, 2021 | 1 | 2021 |
| Revisiting a Lower Bound on the Redundancy of Linear Batch Codes O Alrabiah, V Guruswami Electron. Colloquium Comput. Complex. 28, 145, 2021 | 1 | 2021 |
Venkatesan GuruswamiUniversity of California, Berkeley在 berkeley.edu 的电子邮件经过验证
