SU\G(š”ø)/KĀ·U

Omar Alrabiah

Follow

Generating author description...

All published works
Action Title Year Authors
+ PDF Chat A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation 2025 Omar Alrabiah
Venkatesan Guruswami
Pravesh K. Kothari
Peter Manohar
+ PDF Chat Low-Degree Polynomials Are Good Extractors 2024 Omar Alrabiah
Jesse Goodman
Jonathan Mosheiff
JoĆ£o Ribeiro
+ PDF Chat AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets 2024 Omar Alrabiah
Venkatesan Guruswami
Ray Li
+ PDF Chat AG Codes Have No List-decoding Friends: Approaching the Generalized Singleton Bound Requires Exponential Alphabets 2024 Omar Alrabiah
Venkatesan Guruswami
Ray Li
+ A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation 2023 Omar Alrabiah
Venkatesan Guruswami
Pravesh K. Kothari
Peter Manohar
+ Randomly punctured Reed--Solomon codes achieve list-decoding capacity over linear-sized fields 2023 Omar Alrabiah
Venkatesan Guruswami
Ray Li
+ AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets 2023 Omar Alrabiah
Venkatesan Guruswami
Ray Li
+ A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation 2023 Omar Alrabiah
Venkatesan Guruswami
Pravesh K. Kothari
Peter Manohar
+ Low-Degree Polynomials Extract from Local Sources 2022 Omar Alrabiah
Eshan Chattopadhyay
Jesse Goodman
Xin Li
JoĆ£o Ribeiro
+ Visible Rank and Codes with Locality 2021 Omar Alrabiah
Venkatesan Guruswami
Common Coauthors
Coauthor Papers Together
Venkatesan Guruswami 8
Ray Li 4
Peter Manohar 3
Pravesh K. Kothari 3
Jesse Goodman 2
JoĆ£o Ribeiro 2
Jonathan Mosheiff 1
Eshan Chattopadhyay 1
Xin Li 1
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat An Introduction to Matrix Concentration Inequalities 2015 Joel A. Tropp
 2
+ Concentration and Moment Inequalities for Polynomials of Independent Random Variables 2012 Warren Schudy
Maxim Sviridenko
 1
+ PDF Chat Analysis of Boolean Functions 2014 Ryan Oā€™Donnell
 1
+ Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than random 2022 Venkatesan Guruswami
Pravesh K. Kothari
Peter Manohar
 1
+ PDF Chat A simple and sharper proof of the hypergraph Moore bound 2023 Jun-Ting Hsieh
Pravesh K. Kothari
Sidhanth Mohanty
 1