Omar Alrabiah
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Proves that any binary linear 3-query LCC of block length n has dimension k ≤ O_δ(log^2 n · log log n), nearly matching quadratic Reed–Muller (Θ(log^2 n))… | ||
| nothing matches | ||