Tobias Nipkow
where else to find them
what they talk about
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 |
|---|---|---|
| Proof Pearl: Braun Trees | CPP 2020 | 2020-01-20 |
Paper supplies verified code and machine-checked proofs that pin down concrete claims: computing size in log^2 time, building an all-equal tree with n nodes in… | ||
| nothing matches | ||