Venkatesan Guruswami
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
- Jonathan Mosheiffonce
- Mary Woottersonce
- Nicolas Reschonce
all 5 in the filters
who talks about the same things
- Mary Wootters5 talks
- Edward Pyne2 talks
- Ran Raz6 talks
- Uma Girish4 talks
- Yuval Filmus9 talks
- Prahladh Harsha4 talks
| title | conference | date |
|---|---|---|
| Parameterized Inapproximability of the Minimum Distance Problem over all Fields... | Advances in the Theory of Error-Correcting Codes | 2024-04-08 |
Proves the Minimum Distance Problem parameterized by the distance bound is W[1]-hard under randomized reductions over every fixed finite field, with no FPT… | ||
| Sharp Threshold Rates for Random Codes | ITCS 2021 | 2021-01-06 |
Characterizes exact threshold rates for a wide class of monotone symmetric properties of completely random codes: R = 1 − max_tau H_q(tau)/b, shows these… | ||
| Pseudobinomiality of the Sticky Random Walk | ITCS 2021 | 2021-01-06 |
Defines a sticky random walk (first bit uniform, later bits stay with prob (1+λ)/2) and proves the Hamming-weight distribution differs from Bin(n,1/2) by total… | ||
| nothing matches | ||