Klim Efremenko
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- ITCS2 editions2021–2023
all 4 in the filters
on a stage with
who talks about the same things
- Gillat Kol5 talks
- Dmitry Paramonov3 talks
- Raghuvansh R. Saxena4 talks
- Ran Raz6 talks
- Michael Kapralov7 talks
- Yuval Filmus9 talks
| title | conference | date |
|---|---|---|
| Binary Codes with Resilience Beyond 1/4 via Interaction | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Constructs two-way binary codes that achieve resilience strictly >1/4 at constant rate with Bob sending one short reply, using a three-round non-adaptive… | ||
| Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds | ITCS 2023 | 2023-01-10 |
Proves that noisy-CAS vs CAS can incur the worst-case slowdown Θ(log n): any adaptive protocol that uses √n rounds on CAS yields an equivalent beeping (OR)… | ||
| Computation Over the Noisy Broadcast Channel with Malicious Parties | ITCS 2021 | 2021-01-06 |
Shows a protocol that computes bit‑exchange over a noisy broadcast channel tolerating up to half malicious parties while cutting per‑player communication from… | ||
| Tutorial on List Decodable Coding Schemes and Interactive Communication in Networks (Part 1 of 2) | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Shows a protocol that uses list decoding/list recovery to solve pointer‑jumping: given Alice and Bob’s layered edge sets the protocol outputs a small list of… | ||
| Circuits of Bounded Depth | Algorithms and Complexity in Algebraic Geometry Boot Camp 2014 | 2014-09-02 |
Claims an exponential lower bound: any depth-d arithmetic circuit computing the n×n determinant needs size at least exp(Ω(n^{1/d})), proven by exhibiting… | ||
| nothing matches | ||