Arturs Backurs
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 |
|---|---|---|
| Which Regular Expression Patterns are Hard to Match? | Computational Complexity of Low-Polynomial Time Problems (Simons Institute workshop, 2015) | 2015-12-08 |
Arturs Backurs, Massachusetts Institute of Technology
Computational Complexity of Low-Polynomial Time… | ||
| nothing matches | ||