Raphaël Clifford
where else to find them
no profile links on file
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 |
|---|---|---|
| Lower Bounds and Open Problems in Streams | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Proves unconditional streaming lower bounds in the cell-probe model: online convolution requires Ω(Δ·log n / w) amortized cell probes per output (Δ = bits per… | ||
| nothing matches | ||