Kasper Green Larsen
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
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Yes, There is an Oblivious RAM Lower Bound! | Interactive Complexity 2018 | 2018-10-15 |
Shows a concrete lower bound: any online oblivious RAM that hides access patterns against a polynomial-time adversary must incur Ω(log n / m) bandwidth… | ||
| Fast Combinatorial 3SUM breaks BMM | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Claim: a combinatorial 3SUM algorithm running in N^{3/2 - ε} would yield a subcubic combinatorial Boolean matrix multiplication algorithm, so under the… | ||
| nothing matches | ||