Joshua Brody
where else to find them
what they talk about
their talks carry no tags yet
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Strong Direct Sum for Randomized Query Complexity | Interactive Complexity 2018 | 2018-10-15 |
Proves a strong direct sum for randomized query complexity with aborts: computing k independent copies with overall error epsilon requires Θ(k) times the… | ||
| nothing matches | ||