Nithin Varma
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
- Sofya Raskhodnikova2×
- Amit Levionce
- Iden Kalemajonce
all 6 in the filters
who talks about the same things
- Sofya Raskhodnikova7 talks
- Amit Levi2 talks
- Ronen Shaltiel2 talks
- Yuval Filmus9 talks
- Ran Raz6 talks
- Dor Minzer8 talks
| title | conference | date |
|---|---|---|
| Sublinear-Time Computation in the Presence of Online Erasures | ITCS 2022 | 2022-01-31 |
Introduces an online erasure model where after each query an adversary can hide up to t entries and proves concrete testing limits: linearity is testable with… | ||
| 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… | ||
| Erasure-Resilient Sublinear-Time Graph Algorithms | ITCS 2021 | 2021-01-06 |
Defines queries on an alpha-erased graph (adjacency lists with adversarial missing entries) and measures performance over all completions; degree and neighbor… | ||
| nothing matches | ||