Omar Alrabiah

According to our database, Omar Alrabiah authored at least 11 papers between 2019 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Ideal Pseudorandom Codes.

Omar Alrabiah, Prabhanjan Ananth, Miranda Christ, Yevgeniy Dodis, Sam Gunn

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Low-Degree Polynomials Are Good Extractors.

Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro

Proceedings of the Approximation, 2025

2024

Randomly Punctured Reed-Solomon Codes Achieve List-Decoding Capacity over Linear-Sized Fields.

Omar Alrabiah, Venkatesan Guruswami, Ray Li

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets.

Omar Alrabiah, Venkatesan Guruswami, Ray Li

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles.

Omar Alrabiah, Venkatesan Guruswami

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation.

Omar Alrabiah, Venkatesan Guruswami, Pravesh K. Kothari, Peter Manohar

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Low-Degree Polynomials Extract From Local Sources.

Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

An Exponential Lower Bound on the Sub-Packetization of Minimum Storage Regenerating Codes.

Omar Alrabiah, Venkatesan Guruswami

IEEE Trans. Inf. Theory, 2021

Revisiting a Lower Bound on the Redundancy of Linear Batch Codes.

Omar Alrabiah, Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2021

Visible Rank and Codes with Locality.

Omar Alrabiah, Venkatesan Guruswami

Proceedings of the Approximation, 2021

2019

An exponential lower bound on the sub-packetization of MSR codes.

Omar Alrabiah, Venkatesan Guruswami

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019