Ronen Shaltiel
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2022
on a stage with
- Emanuele Violaonce
- Nithin Varmaonce
- Noga Ron-Zewionce
who talks about the same things
- Emanuele Viola7 talks
- Nithin Varma3 talks
- Ran Raz6 talks
- Yuval Filmus9 talks
- Prahladh Harsha4 talks
- Avishay Tal4 talks
| title | conference | date |
|---|---|---|
| On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization | ITCS 2022 | 2022-01-31 |
Asks whether scaling the Impagliazzo–Wigderson assumption yields an extreme high-end PRG (seed R = (1+o(1))·L, output M ≈ 2^{1−o(1)·L}, total compute ≈… | ||
| Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate | ITCS 2021 | 2021-01-06 |
Proves query lower bounds for local list decoding of very low‑rate binary codes and shows these bounds hold even for exponentially large lists. Main… | ||
| nothing matches | ||