Yury Polyanskiy
where else to find them
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
never shared a talk
who talks about the same things
- Bernhard Haeupler2 talks
- Yuval Filmus9 talks
- Klim Efremenko5 talks
- Mike Saks2 talks
- Mary Wootters5 talks
- Nithin Varma3 talks
| title | conference | date |
|---|---|---|
| Broadcasting on Directed Acyclic Graphs | Real-Time Decision Making 2018 | 2018-04-30 |
One-bit source propagates through a directed acyclic graph with edges as binary symmetric channels (IID Bernoulli δ) and nodes applying Boolean relay… | ||
| Upper Bound on List-decoding Radius of Binary Codes | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Proves a new upper bound on the list‑decoding radius for odd list sizes L≥3 and beats Blinovsky’s 1986 bound on a nontrivial rate interval, while leaving other… | ||
| Lucky Talk: Upper Bound on List-decoding Radius of Binary Codes | Information Theory in Complexity Theory and Combinatorics 2015 | 2015-04-24 |
Claim: an upper bound on the list-decoding radius τ_L is given by an explicit function G1 of ψ0 (ψ0 = 1/2 − √(β(1−β)) from the LP1 Plotkin point), derived by… | ||
| nothing matches | ||