Omar Alrabiah

I’m a second-year graduate student at UC Berkeley and part of Berkeley’s Theory Group. I am very fortunate to be advised by Venkatesan Guruswami. Previously, I was an undergraduate student at Carnegie Mellon University, where I majored in mathematics with an additional major in computer science and graduated with University Honors and Mellon College of Science Research Honors.

My primary interests lie in coding theory and pseudorandomness. I care about constructing useful algebraic objects (or showing that they cannot exist).

Email: oalrabiah [at] berkeley [dot] edu

My Google Scholar page

Publications/Preprints

  1. A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation
    with Venkatesan Guruswami, Pravesh Kothari, and Peter Manohar
    ECCC TR22-101
    Venkat’s TCS+ Talk

  2. Low-Degree Polynomials Extract from Local Sources
    with Eshan Chattopadhyay, Jesse Goodman, Xin Li, and João Ribeiro
    ICALP 2022

  3. Revisiting a Lower Bound on the Redundancy of Linear Batch Codes
    with Venkatesan Guruswami
    ECCC TR21-145

  4. Visible Rank and Codes with Locality
    with Venkatesan Guruswami
    RANDOM 2021

  5. An Exponential Lower Bound on the Sub-Packetization of MSR Codes
    with Venkatesan Guruswami
    STOC 2019