Prahladh Harsha
where else to find them
bluesky:prahladh.bsky.social
what they talk about
where they keep going back
- ITCS3 editions2021–2023
on a stage with
- Alon Rosenonce
- Amey Bhangaleonce
- Daniel Mitropolskyonce
all 7 in the filters
who talks about the same things
- Amey Bhangale3 talks
- Madhur Tulsiani4 talks
- Yuval Filmus9 talks
- Emanuele Viola7 talks
- Ran Raz6 talks
- Alon Rosen2 talks
| title | conference | date |
|---|---|---|
| Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Shows explicit codes (univariate multiplicity and folded Reed–Solomon) that are list-decodable up to capacity and whose decoding runs in n·polylog n time… | ||
| Downward self-reducibility in TFNP | ITCS 2023 | 2023-01-10 |
Paper proves that if a TFNP search problem is downward self-reducible then it lies in PLS, and that circuit-style d.s.r. with poly-blowup also implies PLS… | ||
| Mixing of 3-term progressions in Quasirandom Groups | ITCS 2022 | 2022-01-31 |
Proves Gowers’ conjecture: for every finite d‑quasi‑random group the 3‑term progression counting form equals the product of expectations up to error… | ||
| Explicit SoS lower bounds from high-dimensional expanders | ITCS 2021 | 2021-01-06 |
Constructs deterministic, polynomial-time Max-3-XOR instances from Ramanujan complexes whose true optimum is at most 1 − μ (μ a fixed constant, e.g. ~0.1) yet… | ||
| nothing matches | ||